Lance M. Kaplan, Murat Sensoy, et al.
FUSION 2013
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.
Lance M. Kaplan, Murat Sensoy, et al.
FUSION 2013
Anthony Etuk, Timothy J. Norman, et al.
PerCom Workshops 2013
Lance M. Kaplan, Supriyo Chakraborty, et al.
AERO 2012
Sadaf Zahedi, Mani B. Srivastava, et al.
RTSS 2010