A two‐level queueing network model with blocking and non‐blocking messages

S. Ramesh and H.G. Perros

Annals of Operations Research, 2000, vol. 93, issue 1, 357-372

Abstract: We analyze a novel two‐level queueing network with blocking, consisting of N level‐1 parallel queues linked to M level‐2 parallel queues. The processing of a customer by a level‐1 server requires additional services that are exclusively offered by level‐2 servers. These level‐2 servers are accessed through blocking and non‐blocking messages issued by level‐1 servers. If a blocking message is issued, the level‐1 server gets blocked until the message is fully processed at the level‐2 server. The queueing network is analyzed approximately using a decomposition method, which can be viewed as a generalization of the well‐known two‐node decomposition algorithm used to analyze tandem queueing networks with blocking. Numerical tests show that the algorithm has a good accuracy. Copyright Kluwer Academic Publishers 2000

Keywords: queueing networks with blocking; decomposition algorithms; BCMP theorem (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018932108865 (text/html)
Access to full text is restricted to subscribers.

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:annopr:v:93:y:2000:i:1:p:357-372:10.1023/a:1018932108865

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018932108865

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().