Non-Markovian Queueing Systems

László Lakatos, László Szeidl and Miklós Telek
Additional contact information
László Lakatos: Eötvös Loránd University
László Szeidl: Óbuda University
Miklós Telek: Budapest University of Technology and Economics

Chapter Chapter 8 in Introduction to Queueing Systems with Telecommunication Applications, 2013, pp 225-265 from Springer

Abstract: Abstract The M ∕ G ∕ 1 queueing system (Fig.8.1) is similar to the M ∕ M ∕ 1 queueing system and the only difference is that the service time distribution is no exponential. First we mention some idea, most of which were described in the previous chapter in connection with an M ∕ M ∕ 1 system.

Keywords: Queueing System; Service Time; Pollaczek-Khinchin Mean-value Formula; Busy Period; Virtual Waiting Time (search for similar items in EconPapers)
Date: 2013
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:sprchp:978-1-4614-5317-8_8

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

DOI: 10.1007/978-1-4614-5317-8_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().