Skip to main content
SpringerLink
Log in

Hierarchical Queue Networks with Partially Shared Servicing

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

The queue network studied consists of n infinite queues in parallel served by independent servers and by other servers all linked to form a hierarchical structure. The total service a unit receives depends partially on other units in service. We call this type of servicing partially shared servicing. All interarrival times as well as service times are assumed exponentially distributed. The characteristic of interest is the traffic intensity of the infinite queues. Some simple formulae are obtained. An application to modelling a disc I/O system is described. The model turns out to be useful and accurate with wide applicability.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Statistics, Trinity College Dublin, Ireland

    F. G. Foster & H. G. Perros

Authors
  1. F. G. Foster
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. G. Perros
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

*Current address: Department of Quantitative Methods, University of Illinois at Chicago Circle, Chicago, IL, USA.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Foster, F., Perros, H. Hierarchical Queue Networks with Partially Shared Servicing. J Oper Res Soc 30, 157–166 (1979). https://doi.org/10.1057/jors.1979.29

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1979.29

Search

Navigation