English
Related papers

Related papers: Continuity of large closed queueing networks with …

200 papers

This paper studies a diffusion model that arises as the limit of a queueing system scheduling problem in the asymptotic heavy traffic regime of Halfin and Whitt. The queueing system consists of several customer classes and many servers…

Probability · Mathematics 2007-05-23 Rami Atar

We consider the problem of selfish agents in discrete-time queuing systems, where competitive queues try to get their packets served. In this model, a queue gets to send a packet each step to one of the servers, which will attempt to serve…

Computer Science and Game Theory · Computer Science 2020-11-23 Jason Gaitonde , Eva Tardos

We consider the processor sharing $M/M/1$-PS queue which also models balking. A customer that arrives and sees $n$ others in the system "balks" (i.e., decides not to enter) with probability $1-b_n$. If $b_n$ is inversely proportional to…

Probability · Mathematics 2011-04-26 Qiang Zhen , Johan S. H. van Leeuwaarden , Charles Knessl

In a recent study [C Arita, Phys. Rev. E 80, 051119 (2009)], an extension of the M/M/1 queueing process with the excluded-volume effect as in the totally asymmetric simple exclusion process (TASEP) was introduced. In this paper, we consider…

Physics and Society · Physics 2014-09-18 Chikashi Arita , Daichi Yanagisawa

The mathematics of the finite single server queue with Poisson input and semi-Markov service times($M/SM/1/b$) is similar to that used for $BMAP/G/1/b$ systems. This observation results in new analytical formulas for a queue size in the…

Probability · Mathematics 2018-06-15 Krzysztof Rusek , Zdzisław Papir

We consider many-server queueing systems with heterogeneous exponential servers and renewal arrivals. The service rate of each server is a random variable drawn from a given distribution. We develop a framework for analyzing the heavy…

Probability · Mathematics 2019-05-13 Burak Büke , Wenyi Qin

Network capacity region of multi-queue multi-server queueing system with random ON-OFF connectivities and stationary arrival processes is derived in this paper. Specifically, the necessary and sufficient conditions for the stability of the…

Information Theory · Computer Science 2010-01-14 Hassan Halabian , Ioannis Lambadaris , Chung-Horng Lung

We consider a load balancing system consisting of $n$ single-server queues working in parallel, with heterogeneous service rates. Jobs arrive to a central dispatcher, which has to dispatch them to one of the queues immediately upon arrival.…

Performance · Computer Science 2025-10-17 Yishun Luo , Martin Zubeldia

In this paper, wireless systems operating under queueing constraints in the form of limitations on the buffer violation probabilities are considered. The throughput under such constraints is captured by the effective capacity formulation.…

Information Theory · Computer Science 2010-09-16 Mustafa Cenk Gursoy

Bounding the queue length in a multiserver queue is a central challenge in queueing theory. Even for the classical $G/G/n$ queue with homogeneous servers, it is highly non-trivial to derive a simple and accurate bound for the steady-state…

Probability · Mathematics 2026-04-07 Yige Hong

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…

Probability · Mathematics 2018-01-23 Joris Walraevens , Dieter Claeys , Tuan Phung-Duc

The utilization of universal frequency reuse in multi-beam satellite systems introduces a non-negligible level of co-channel interference (CCI), which in turn penalizes the quality of service experienced by users. Taking this as starting…

Information Theory · Computer Science 2016-11-15 Vincent Boussemart , Loris Marini , Matteo Berioli

We consider the FCFS $GI/GI/n$ queue in the Halfin-Whitt heavy traffic regime, and prove bounds for the steady-state probability of delay (s.s.p.d.) for generally distributed processing times. We prove that there exist $\epsilon_1,…

Probability · Mathematics 2016-09-02 David A. Goldberg

Given a random variable $N$ with values in ${\mathbb{N}}$, and $N$ i.i.d. positive random variables $\{\mu_k\}$, we consider a queue with renewal arrivals and $N$ exponential servers, where server $k$ serves at rate $\mu_k$, under two work…

Probability · Mathematics 2008-08-22 Rami Atar

In many cognitive radio applications, there are multiple types of message queues. Existing queueing analysis works in underlay CR networks failed to discuss packets heterogeneity. Therefore high priority packets with impatient waiting time…

Networking and Internet Architecture · Computer Science 2017-06-27 Long Chen , Liusheng Huang , Hongli Xu , Jie Hu

In this paper, we characterize the stability region of multi-queue multi-server (MQMS) queueing systems with stationary channel and packet arrival processes. Toward this, the necessary and sufficient conditions for the stability of the…

Information Theory · Computer Science 2015-03-19 Hassan Halabian , Ioannis Lambadaris , Chung-Horng Lung

Quantum satellite communication (QSC) is emerging as a strategic technology for secure global networking and long-distance quantum connectivity. This review prioritizes the major challenges that still hinder large-scale deployment,…

Signal Processing · Electrical Eng. & Systems 2026-05-05 Omar Alnaseri , Yassine Himeur , Ahmed Al Asadi , Mohammed A. Ala'anzy , Rida Gadhafi , Shadi Atalla , Wathiq Mansoor

Inspired by the work of Atar and Miyazawa [1] (2026) as well as applications to energy-saving problems, we are interested in the heavy-traffic limit of the stationary queue length distribution, which is not addressed in [1]. In this paper,…

Probability · Mathematics 2026-04-13 Masahiro Kobayashi , Masakiyo Miyazawa , Yutaka Sakuma

The asymptotic behaviour of a closed BCMP network, with $n$ queues and $m_n$ clients, is analyzed when $n$ and $m_n$ become simultaneously large. Our method relies on Berry-Esseen type approximations coming in the Central Limit Theorem. We…

Probability · Mathematics 2012-07-16 Guy Fayolle , Jean-Marc Lasgouttes

In this study, we consider multi-class multi-server asymmetric queueing systems consisting of $N$ queues on one side and $K$ servers on the other side, where jobs randomly arrive in queues at each time. The service rate of each job-server…

Machine Learning · Statistics 2025-05-07 Jung-hun Kim , Min-hwan Oh