Chatschik Bisdikian, Ahmed N. Tantawy
IEEE Transactions on Communications
Conservation laws for work-conserving, multipriority, single-server queues have long been established and their significance has been well demonstrated. In this paper, we present a straightforward method for obtaining the conservation law formula for continuous- or discrete-time queues with batch arrivals. The method relies on the analysis of a first-in first-out multiclass queue and on the properties of Arrivals See Time Averages processes. © 1993 IEEE.
Chatschik Bisdikian, Ahmed N. Tantawy
IEEE Transactions on Communications
Yanfeng Zhu, Qian Ma, et al.
IM 2009
S. Yousaf Shah, Boleslaw Szymanski, et al.
PerCom Workshops 2013
Taekyoung Kwon, Yanghee Choi, et al.
WCNC 1999