Heavy traffic approximations for busy period in an M/G/[infinity] queue

Peter Hall

Stochastic Processes and their Applications, 1985, vol. 19, issue 2, 259-269

Abstract: A necessary and sufficient condition is given for busy period in an M/G/[infinity] queue to be asymptotically exponential with mean equal to expected busy period, as traffic intensity increases. The case where this condition fails is also investigated, and the results applied.

Keywords: busy; period; exponential; approximation; heavy; traffic; limit; theorem; M/G/[infinity]; queue (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0304-4149(85)90028-6
Full text for ScienceDirect subscribers only

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:eee:spapps:v:19:y:1985:i:2:p:259-269

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().