The N/G/1 Queue and Its Detailed Analysis.
Abstract
A single server queue is discussed whose input is the versatile Markovian point process, herein to be called the N-Process. Special cases of the N-Process include a number of complex models such as the Markov-modulated Poisson Process, the superposition of a Poisson Process and a Phase Type Renewal Process etc. This queueing model has great appeal in its applicability to real world situations especially such as those involving inhibition or stimulation of arrivals by certain renewals. The paper presents formulas in forms which are computationally tractable and provides a unified treatment of many models which turn out to be special cases. Among the topics discussed are busy period characteristics, queue length distributions, moments of the queue length and virtual waiting time. The analysis presented here serves as an example of the power of Markov Renewal Theory.
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1978
- Accession Number
- ADA054883
Entities
People
- V. Ramaswami
Organizations
- University of Delaware