Yanfeng Zhu, Qian Ma, et al.
IEEE TNSM
A generalization of the D[X]/D/1 queue is investigated, where independent and identically distributed (i.i.d) batches of customers arrive at a single-server queue periodically. The service requirement of a customer is a fixed constant equal for all the customers. In the time between two successive arrivals, the server can accommodate exactly K ≥ 1 customers. The queue size and the waiting time distributions for the infinite buffer queue are derived. Important numerical aspects are addressed and simple approximations for light and heavy traffic for various values of K and Poisson distributed batches are proposed. Finally, the analysis for the finite queue is highlighted and its blocking probability derived. © J.C. Baltzer AG, Science Publishers.
Yanfeng Zhu, Qian Ma, et al.
IEEE TNSM
Chi Harold Liu, Kin K. Leung, et al.
SPIE Defense, Security, and Sensing 2009
Chatschik Bisdikian, Baiju V. Patel, et al.
IEEE Network
Ivan Wang-Hei Ho, Bong Jun Ko, et al.
WCNC 2008