Stop the war!
Остановите войну!
for scientists:
default search action
Queueing Systems - Theory and Applications, Volume 95
Volume 95, Number 1, June 2020
- Florian Simatos, Alain Simonian:
Mobility can drastically improve the heavy traffic performance from $\frac{1}{1-\varrho }$ to log (1/(1-ρ )). 1-28 - Brian H. Fralix:
On classes of Bitcoin-inspired infinite-server queueing systems. 29-52 - Ward Whitt, Wei You:
Heavy-traffic limits for stationary network flows. 53-68 - Gábor Horváth:
Waiting time and queue length analysis of Markov-modulated fluid priority queues. 69-95 - Yael Deutsch, Israel David:
Benchmark policies for utility-carrying queues with impatience. 97-120 - Gianmarco Bet:
An alternative approach to heavy-traffic limits for finite-pool queues. 121-144 - Gabi Hanukov, Shoshana Anily, Uri Yechiali:
Ticket queues with regular and strategic customers. 145-171
Volume 95, Number 3, August 2020
- Eustache Besançon, Laurent Decreusefond, Pascal Moyal:
Stein's method for diffusive limits of queueing processes. 173-201 - George Kesidis, Takis Konstantopoulos, Michael A. Zazanis:
The distribution of age-of-information performance measures for message processing systems. 203-250 - Jan-Kees C. W. van Ommeren, Niek Baer, Nishant Mishra, Debjit Roy:
Batch service systems with heterogeneous servers. 251-269 - James R. Cruise, Matthieu Jonckheere, Seva Shneer:
Stability of JSQ in queues with general server-job class compatibilities. 271-279 - Sophia Novitzky, Jamol Pender, Richard H. Rand, Elizabeth Wesson:
Limiting the oscillations in queues with delayed information through a novel type of delay announcement. 281-330 - Anyue Chen, Xiaohan Wu, Jing Zhang:
Markovian bulk-arrival and bulk-service queues with general state-dependent control. 331-378
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.