The SMAP/M T /C/C Queue

Lothar Breuer
Additional contact information
Lothar Breuer: University of Trier, Department of Computer Science

Chapter Chapter 8 in From Markov Jump Processes to Spatial Queues, 2003, pp 107-117 from Springer

Abstract: Abstract In most textbooks on queueing theory, Markovian queues are the first ones that are analyzed. This clearly is a result of the simple structure of Markovian queues, which can be analyzed as a Markov jump process in a straightforward manner. For the same reason, we shall first examine the Markovian spatial queues. However, this will be done on a more general level, covering the important case of periodic Markovian queues.

Keywords: Loss Probability; Period Length; Service Time Distribution; Markovian Arrival Process; Markov Jump Process (search for similar items in EconPapers)
Date: 2003
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-94-010-0239-4_8

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

DOI: 10.1007/978-94-010-0239-4_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 ().