Related papers: Queues with random back-offs

Queue networks describe complex stochastic systems of both theoretical and practical interest. They provide the means to assess alterations, diagnose poor performance and evaluate robustness across sets of interconnected resources. In the…

We calculate asymptotics of the distribution of the number of customers in orbit in a two-class priority retrial $M/G/1$-type queueing model. In this model, priority customers wait in line while non-priority customers join an orbit and…

We study a control problem for queueing systems where customers may return for additional episodes of service after their initial service completion. At each service completion epoch, the decision maker can choose to reduce the probability…

This paper presents a second-order heavy traffic analysis of a single server queue that processes customers having deadlines using the earliest-deadline-first scheduling policy. For such systems, referred to as real-time queueing systems,…

A graph-theoretic analysis of the steady-state behavior of an open Jackson queueing network is developed. In particular, a number of queueing-network performance metrics are shown to exhibit a spatial dependence on local drivers (e.g.…

A single queue incorporating a retransmission protocol is investigated, assuming that the sequence of per effort success probabilities in the Automatic Retransmission reQuest (ARQ) chain is a priori defined and no channel state information…

We present a heavy traffic analysis of a single-server polling model, with the special features of retrials and glue periods. The combination of these features in a polling model typically occurs in certain optical networking models, and in…

We study the generalization of the G/G/1 queue obtained by relaxing the assumption of independence between inter-arrival times and service requirements. The analysis is carried out for the class of multivariate matrix exponential…

We examine the impact of torpid mixing and meta-stability issues on the delay performance in wireless random-access networks. Focusing on regular meshes as prototypical scenarios, we show that the mean delays in an $L\times L$ toric grid…

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…

We consider dense wireless random-access networks, modeled as systems of particles with hard-core interaction. The particles represent the network users that try to become active after an exponential back-off time, and stay active for an…

Modern Internet services, such as those at Google, Yahoo!, and Amazon, handle billions of requests per day on clusters of thousands of computers. Because these services operate under strict performance requirements, a statistical…

The growth of Machine-Type Communication (MTC) increases the relevance of queuing scenarios with deterministic service times. In this letter, we present a model for queues without waiting lines and with degenerate service time distributions…

Due to recurrent (e.g. daily or weekly) patterns and non-recurrent disruptions (e.g. caused by incidents), travel times in road networks are time-dependent and inherently random. This is challenging for travelers planning a future trip,…

Most existing routing strategies to improve transport efficiency have little attention what order should the packets be delivered, just simply used first-in-first-out queue discipline. However, it is far from optimal. In this paper we apply…

We consider an automatic overload control for two large service systems modeled as multi-server queues, such as call centers. We assume that the two systems are designed to operate independently, but want to help each other respond to…

This paper studies the asymptotic behavior of the steady-state waiting time, W_infty, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide…

We study a multiclass M/M/1 queueing control problem with finite buffers under heavy-traffic where the decision maker is uncertain about the rates of arrivals and service of the system and by scheduling and admission/rejection decisions…

We study the impact of service-time distributions on the distribution of the maximum queue length during a busy period for the M^X/G/1 queue. The maximum queue length is an important random variable to understand when designing the buffer…

Driven by the rapid development of wireless communication system, more and more vehicular services can be efficiently supported via vehicle-to-everything (V2X) communications. In order to allocate radio resource with the reasonable…