Applications of Combinatorics to the Busy Period in Several Queueing Models.
Abstract
Combinatorial methods are used to derive the distribution of the busy period in a Markovian tandem queue and queues with finite capacity in five models each involving batches. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 05, 1984
- Accession Number
- ADA142492
Entities
People
- J. L. Jain
- S. G. Mohanty
Organizations
- Stanford University