Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Detecting Block GI/M/1 and Block M/G/1 Matrices from Model Specifications Read chapter Read first chapter

1995 | OriginalPaper | Chapter

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

Authors : Khaled M. Elsayed, Harry G. Perros

Published in: Computations with Markov Chains

Publisher: Springer US

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

previous chapter On the Utility of the Multi-Level Algorithm for the Solution of Nearly Completely Decomposable Markov Chains
next chapter Generalized Folding Algorithm for Transient Analysis of Finite QBD Processes and Its Queueing Applications
Metadata
Title
A Computationally Efficient Algorithm for Characterizing the Superposition of Multiple Heterogeneous interrupted Bernoulli Processes
Authors
Khaled M. Elsayed
Harry G. Perros
Copyright Year
1995
Publisher
Springer US
Book
Computations with Markov Chains

Print ISBN: 978-1-4613-5943-2

Electronic ISBN: 978-1-4615-2241-6

Copyright Year: 1995

DOI
https://doi.org/10.1007/978-1-4615-2241-6_25

Premium Partner

    Image Credits