A Computationally Efficient Algorithm for Characterizing the Superposition of Multiple Heterogeneous interrupted Bernoulli Processes

Khaled M. Elsayed and Harry G. Perros
Additional contact information
Khaled M. Elsayed: North Carolina State University, Department of Computer Science
Harry G. Perros: North Carolina State University, Department of Computer Science

Chapter 25 in Computations with Markov Chains, 1995, pp 443-462 from Springer

Abstract: Abstract A computationally efficient algorithm for characterizing the superposition process of N heterogeneous and independent Interrupted Bernoulli Processes is introduced. The algorithm is then used to analyze a statistical multiplexer with finite buffer.Finally, numerical examples highlighting the algorithm accuracy are given.

Keywords: Approximation Algorithm; Queue Length; Buffer Size; Arrival Process; Probability Transition Matrix (search for similar items in EconPapers)
Date: 1995
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-4615-2241-6_25

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

DOI: 10.1007/978-1-4615-2241-6_25

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