Transient Queueing Analysis

John H. Drew, Diane L. Evans, Andrew G. Glen and Lawrence M. Leemis
Additional contact information
John H. Drew: The College of William and Mary
Diane L. Evans: Rose-Hulman Institute of Technology
Andrew G. Glen: Colorado College
Lawrence M. Leemis: The College of William and Mary

Chapter 13 in Computational Probability, 2017, pp 241-275 from Springer

Abstract: Abstract An APPL extension that computes the exact distribution of the nth customer’s sojourn time in an M∕M∕s queue with k customers initially present is derived in this chapter. Algorithms for computing the covariance between sojourn times for an M∕M∕1 queue with k customers present at time zero are also developed. Maple computer code is developed to implement the transient queue analysis for many system measures of performance without regard to traffic intensity (i.e., the system may be unstable with traffic intensity greater than one).

Keywords: Service Time; Traffic Intensity; Sojourn Time; Interarrival Time; Covariance Calculation (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-319-43323-3_13

Ordering information: This item can be ordered from
http://www.springer.com/9783319433233

DOI: 10.1007/978-3-319-43323-3_13

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().