Chatschik Bisdikian, Christopher Gibson, 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.
Chatschik Bisdikian, Christopher Gibson, et al.
Pervasive and Mobile Computing
Zainul Charbiwala, Supriyo Chakraborty, et al.
INFOCOM 2010
Chatschik Bisdikian, Pravin Bhagwat, et al.
IEEE Personal Communications
Murat Sensoy, Chatschik Bisdikian, et al.
SPIE Defense + Security 2012