Related papers: Queues and risk models with simultaneous arrivals
While mobile edge computing (MEC) alleviates the computation and power limitations of mobile devices, additional latency is incurred when offloading tasks to remote MEC servers. In this work, the power-delay tradeoff in the context of task…
The field of risk theory has traditionally focused on ruin-related quantities. In particular, the socalled Expected Discounted Penalty Function has been the object of a thorough study over the years. Although interesting in their own right,…
In a financial market, for agents with long investment horizons or at times of severe market stress, it is often changes in the asset price that act as the trigger for transactions or shifts in investment position. This suggests the use of…
The supermarket model is a system of $n$ queues each with serving rates $1$ and arrival rates $\lambda$ per vertex, where tasks will move on arrival to the shortest adjacent queue. We consider the supermarket model in the small $\lambda$…
Current mobility models for simultaneous mobility have their convolution in designing simultaneous movement where mobile nodes (MNs) travel randomly from the two adjacent cells at the same time and also have their complexity in the…
In this paper we analyze an $M/M/1$ queueing system with an arbitrary number of customer classes, with class-dependent exponential service rates and preemptive priorities between classes. The queuing system can be described by a…
We consider the stability of robust scheduling policies for multiclass queueing networks. These are open networks with arbitrary routing matrix and several disjoint groups of queues in which at most one queue can be served at a time. The…
Consider a system with $K$ parallel queues in which the server for each queue processes jobs at rate $n$ and the total arrival rate to the system is $nK-\upsilon \sqrt{n}$ where $\upsilon \in (0, \infty)$ and $n$ is large. We study…
A queueing model has $J\ge2$ heterogeneous service stations, each consisting of many independent servers with identical capabilities. Customers of $I\ge2$ classes can be served at these stations at different rates, that depend on both the…
We study randomized experiments in a service system when stochastic congestion can arise from temporarily limited supply or excess demand. Such congestion gives rise to cross-unit interference between the waiting customers, and analytic…
Consider a system performing a continuous-time random walk on the integers, subject to catastrophes occurring at constant rate, and followed by exponentially-distributed repair times. After any repair the system starts anew from state zero.…
We consider a one-dimensional stochastic reaction-diffusion generalizing the totally asymmetric simple exclusion process, and aiming at describing single lane roads with vehicles that can change speed. To each particle is associated a jump…
In this paper, we consider the M/GI/1 queue with single vacations under the gated service discipline. We obtain the probability generating function of the stationary queue length, the Laplace-Stieltjes transform of the system delay…
Car sharing is expected to reduce traffic congestion and pollution in cities while at the same time improving accessibility to public transport. However, the most popular form of car sharing, one-way car sharing, still suffers from the…
In this work, we study the stationary distribution of the scaled queue length vector process in multiclass queueing networks operating under static buffer priority service policies. We establish that when subjected to a multi-scale heavy…
The infinite servers queue with Poisson arrivals state transient probabilities, considering the time origin at the beginning of a busy period, mean and variance monotony as time functions is studied. These studies, for which results it is…
We consider a stochastic network with mobile users in a heavy-traffic regime. We derive the scaling limit of the multi-dimensional queue length process and prove a form of spatial state space collapse. The proof exploits a recent result by…
We introduce and study some queueing models with random resetting, including Markovian and non--Markovian models. The Markovian models include M/M/$\infty$, M/M/r and M/M/1+M queues with random resetting, in which a continuous-time Markov…
Task replication has recently been advocated as a practical solution to reduce latencies in parallel systems. In addition to several convincing empirical studies, some others provide analytical results, yet under some strong assumptions…
We consider a pair of coupled queues driven by independent spectrally-positive Levy processes. With respect to the bi-variate workload process this framework includes both the coupled processor model and the two-server fluid network with…