Approximate Analysis of a Hierarchical Queuing Network

Thomas Reed Willemain
Additional contact information
Thomas Reed Willemain: Massachusetts Institute of Technology, Cambridge, Massachusetts

Operations Research, 1974, vol. 22, issue 3, 522-544

Abstract: A hierarchical queuing network is a layered network of queues in which all arrivals receive initial service from a primary server, and some customers receive additional service jointly from a primary and a secondary server. This paper considers the simplest such network, involving two levels and a single secondary server who functions as a consultant to several primary servers and always works in conjunction with the primary server who refers the customer to him. An approximate analysis of this hierarchical queuing network is carried out for three operating disciplines governing the consultation process. The analytical results compare favorably with the results of computer simulations and are therefore used to explore several important issues in the design of such networks. Hierarchical queues are common in public-service systems, including new medical-care systems known as “telemedicine.”

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.3.522 (application/pdf)

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:inm:oropre:v:22:y:1974:i:3:p:522-544

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().