Supriyo Chakraborty, Kasturi Rangan Raghavan, et al.
FUSION 2012
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.
Supriyo Chakraborty, Kasturi Rangan Raghavan, et al.
FUSION 2012
Pravin Bhagwat, Ibrahim Korpeoglu, et al.
MobiCom 1999
Joel W. Branch, John S. Davis II, et al.
PerCom Workshops 2005
Murat Sensoy, Chatschik Bisdikian, et al.
SPIE Defense + Security 2012