Buffer scalability of wireless networks
Predrag R. Jelenković, Petar Momčilović, et al.
INFOCOM 2006
This paper introduces a generalization of the classical parallel-server fork-join queueing system in which arriving customers fork into multiple tasks, every task is uniquely assigned to one of the set of single-server queues, and each task consists of multiple iterations of different stages of execution, including task vacations and communication among sibling tasks. Several classes of dynamic polices are considered for scheduling multiple tasks at each of the single-server queues to maintain effective server utilization. The paper presents an exact matrix-analytic analysis of generalized parallel-server fork-join queueing systems, for small instances of the stochastic model, and presents an approximate matrix-analytic analysis and fixed-point solution, for larger instances of the model. © 2008 Springer Science+Business Media, LLC.
Predrag R. Jelenković, Petar Momčilović, et al.
INFOCOM 2006
Soumyadip Ghosh, Aliza R. Heching, et al.
WSC 2013
Jianying Hu, Yingdong Lu, et al.
Performance Evaluation Review
Songtao Lu, Siliang Zeng, et al.
NeurIPS 2022