Zobrazeno 1 - 10
of 132 135
pro vyhledávání: '"Heavy traffic"'
Autor:
Wu, Linjia1 (AUTHOR) linjiawu@stanford.edu, Han, Kevin2 (AUTHOR) kevinwh@stanford.edu, Wu, Han2 (AUTHOR) hanwu71@stanford.edu, Shi, Yu3 (AUTHOR) yu.shi@aya.yale.edu, Liu, Canyao3 (AUTHOR) canyao.liu@aya.yale.edu
Publikováno v:
Mathematics (2227-7390). Aug2024, Vol. 12 Issue 15, p2399. 19p.
This paper examines a continuous-time routing system with general interarrival and service time distributions, operating under the join-the-shortest-queue and power-of-two-choices policies. Under a weaker set of assumptions than those commonly found
Externí odkaz:
http://arxiv.org/abs/2405.10876
In Braverman et al. (2024), the authors prove that the stationary distribution of a multiclass queueing network converges to the stationary distribution of a semimartingale reflecting Brownian motion (SRBM) in heavy traffic. Among the sufficient cond
Externí odkaz:
http://arxiv.org/abs/2404.13651
Autor:
Dai, J. G., Huo, Dongyan
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 traffic cond
Externí odkaz:
http://arxiv.org/abs/2403.04090
We establish uniform moment bounds for steady-state queue lengths of generalized Jackson networks (GJNs) in multi-scale heavy traffic as recently proposed by Dai et al. [2023]. Uniform moment bounds lay the foundation for further analysis of the limi
Externí odkaz:
http://arxiv.org/abs/2401.14647
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Dispatching systems, where arriving jobs are immediately assigned to one of multiple queues, are ubiquitous in computer systems and service systems. A natural and practically relevant model is one in which each queue serves jobs in FCFS (First-Come F
Externí odkaz:
http://arxiv.org/abs/2312.16377
Autor:
Atar, Rami, Wolansky, Gershon
We consider a load balancing model where a Poisson stream of jobs arrive at a system of many servers whose service time distribution possesses a finite second moment. A small fraction of arrivals pass through the so called power-of-choice algorithm,
Externí odkaz:
http://arxiv.org/abs/2402.18143