The Periodic BMAP/PH/C Queue

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

Chapter Chapter 4 in From Markov Jump Processes to Spatial Queues, 2003, pp 53-60 from Springer

Abstract: Abstract In queueing theory, most models are based on time-homogeneous arrival processes and service time distributions. One of the most important features to be exploited is the Markov property which often appears after the construction of embedded Markov chains. The search for Markovian but versatile arrival processes has led to the concept of batch Markovian arrival processes (BMAPs) which allow for a phase process controlling the arrival rates. This arrival process is often used for modelling communication networks.

Keywords: Arrival Rate; Asymptotic Distribution; Arrival Process; Service Time Distribution; Embed Markov Chain (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_4

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

DOI: 10.1007/978-94-010-0239-4_4

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 ().