Marco Conti, Sajal K. Das, et al.
Pervasive and Mobile Computing
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.
Marco Conti, Sajal K. Das, et al.
Pervasive and Mobile Computing
Bikram Sengupta, Nilanjan Banerjee, et al.
NOMS 2008
Chi Harold Liu, Chatschik Bisdikian, et al.
IEEE-SECON 2010
Chatschik Bisdikian, Wassim Matragi, et al.
Performance Evaluation