Arup Acharya, Chatschik Bisdikian, et al.
ICC 2003
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.
Arup Acharya, Chatschik Bisdikian, et al.
ICC 2003
George Tychogiorgos, Chatschik Bisdikian
MDM 2011
Zainul Charbiwala, Supriyo Chakraborty, et al.
INFOCOM 2010
Zhanwei Sun, Chi Harold Liu, et al.
IEEE-SECON 2012