Related papers: Queues with random back-offs
We consider random-access networks with nodes representing transmitter-receiver pairs whose signals interfere with each other depending on their vicinity. Data packets arrive at the nodes over time and form queues. The nodes can be either…
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…
We consider a switch operating under the MaxWeight scheduling algorithm, under any traffic pattern such that all the ports are loaded. This system is interesting to study since the queue lengths exhibit a multi-dimensional state-space…
We study the scheduling polices for asymptotically optimal delay in queueing systems with switching overhead. Such systems consist of a single server that serves multiple queues, and some capacity is lost whenever the server switches to…
The traffic in wireless networks has become diverse and fluctuating both spatially and temporally due to the emergence of new wireless applications and the complexity of scenarios. The purpose of this paper is to quantitatively analyze the…
We carry out a delay stability analysis (i.e., determine conditions under which expected steady-state delays at a queue are finite) for a simple 3-queue system operated under the Max-Weight scheduling policy, for the case where one of the…
Recent studies indicate that in many situations service times are affected by the experienced queueing delay of the particular customer. This effect has been detected in different areas, such as health care, call centers and…
This paper addresses the analysis of the queue-length process of single-server queues under overdispersion, i.e., queues fed by an arrival process for which the variance of the number of arrivals in a given time window exceeds the…
Motivated by applications in online marketplaces such as ride-hailing platforms and payment channel networks, we study a single-server queue with state-dependent arrival control. The service operator dynamically chooses the arrival rate as…
In this paper, we study the stability of light traffic achieved by a scheduling algorithm which is suitable for heterogeneous traffic networks. Since analyzing a scheduling algorithm is intractable using the conventional mathematical tool,…
The aim of this paper is to use a very simple queuing model to compare a number of models from the literature which have been used to replicate the statistical nature of internet traffic and, in particular, the long-range dependence of this…
Motivated by emerging applications in online matching platforms and marketplaces, we study a matching queue. Customers and servers that arrive in a matching queue depart as soon as they are matched. While state-dependent control is an…
The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the…
Stochastic networks with complex structures are key modelling tools for many important applications. In this paper, we consider a specific type of network: the retrial queueing systems with priority. This type of queueing system is…
We consider a horizontal traffic queue (HTQ) on a periodic road segment, where vehicles arrive according to a spatio-temporal Poisson process, and depart after traveling a distance that is sampled independently and identically from a…
In random access protocols, the service rate depends on the number of stations with a packet buffered for transmission. We demonstrate via numerical analysis that this state-dependent rate along with the consideration of Poisson traffic and…
Tandem queueing networks are widely used to model systems where services are provided in sequential stages. In this study, we assume that each station in the tandem system operates under a general renewal process. Additionally, we assume…
We study a vacation-type queueing model, and a single-server multi-queue polling model, with the special feature of retrials. Just before the server arrives at a station there is some deterministic glue period. Customers (both new arrivals…
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 consider the steady-state distribution of the sojourn time of a job entering an M/GI/1 queue with the foreground-background scheduling policy in heavy traffic. The growth rate of its mean, as well as the limiting distribution, are…