Title :
A generalized non-preemptive priority queue
Author_Institution :
C&C Res. Lab., NEC Res. Inst., Princeton, NJ, USA
Abstract :
In this paper, we analyze a generalized non-preemptive queue with two priority classes. When the server serves the low priority queue, up to l customers are served before the server returns to the high priority queue. We study the embedded Markov chain at departure epochs and obtain the transforms of the queue-length and sojourn-time distributions. From these transforms, it is easy to find the moments
Keywords :
Markov processes; queueing theory; telecommunication traffic; transforms; departure epochs; embedded Markov chain; generalized non-preemptive priority queue; high priority queue; low priority queue; queue length distribution; sojourn time distribution; transforms; Asynchronous transfer mode; B-ISDN; Laboratories; National electric code; Quality of service; Queueing analysis; Switches; Telecommunication traffic; Terminology; Traffic control;
Conference_Titel :
INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Bringing Information to People. Proceedings. IEEE
Conference_Location :
Boston, MA
Print_ISBN :
0-8186-6990-X
DOI :
10.1109/INFCOM.1995.515895
