Chatschik Bisdikian
Computer Networks and ISDN Systems
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
Computer Networks and ISDN Systems
Taekyoung Kvron, Yanghee Choi, et al.
WOWMOM 1998
Yanfeng Zhu, Qian Ma, et al.
IEEE TNSM
Chi Harold Liu, Pan Hui, et al.
IEEE-SECON 2011