David F. Bantz, Chatschik Bisdikian, et al.
IBM Systems Journal
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.
David F. Bantz, Chatschik Bisdikian, et al.
IBM Systems Journal
Chatschik Bisdikian
Pervasive and Mobile Computing
Lance M. Kaplan, Murat Sensoy, et al.
FUSION 2013
Yanfeng Zhu, Qian Ma, et al.
IM 2009