Recommendations
A generalized non-preemptive priority queue
INFOCOM '95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1In 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 ...
An algorithmic analysis of the BMAP/MSP/1 generalized processor-sharing queue
This paper deals with the analysis of the BMAP/MSP/1 generalized processor-sharing queue. The analysis is based on RG-factorization technique applied to the Markov chain of the associated quasi-birth and death process. The stationary system-length ...
Age Process, Workload Process, Sojourn Times, and Waiting Times in a Discrete Time SM[K]/PH[K]/1/FCFS Queue
In this paper, we study a discrete time queueing system with multiple types of customers and a first-come-first-served (FCFS) service discipline. Customers arrive according to a semi-Markov arrival process and the service times of individual customers ...
Comments