Skip to main content
SpringerLink
Log in

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

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

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

References

  1. M.L. Fontenot, Software congestion, mobile servers, and the hyperbolic model, IEEE Transactions on Software Engineering 15 (1989) 947–962.

    Google Scholar 

  2. S.S. Lavenberg and M. Reiser, Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers, Journal of Applied Probability 17 (1980) 1048–1061.

    Google Scholar 

  3. S.S. Lavenberg, Computer Performance Modelling Handbook (Academic Press, 1983).

  4. M.F. Neuts, Matrix-geometric Solutions in Stochastic Models-An Algorithmic Approach (Johns Hopkins University Press, 1981).

  5. H.G. Perros, Queueing Networks with Blocking: Exact and Approximate Solutions (Oxford University Press, 1994).

  6. J.A. Rolia and K.C. Sevcik, The method of layers, IEEE Transactions on Software Engineering 21 (1995) 689–700.

    Google Scholar 

  7. C.M. Woodside, Throughput calculation for basic stochastic rendezvous networks, Performance Evaluation 9 (1989) 143–160.

    Google Scholar 

  8. C.M. Woodside, J.E. Neilson, D.C. Petriu and S. Majumdar, Stochastic rendezvous network model for performance of synchronous client-server-like distributed software, IEEE Transactions on Computers 44 (1995) 20–34.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Center for Advanced Computing and Communication, North Carolina State University, Raleigh, NC, 27607, USA

    S. Ramesh & H.G. Perros

Authors
  1. S. Ramesh
    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

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ramesh, S., Perros, H. A two‐level queueing network model with blocking and non‐blocking messages. Annals of Operations Research 93, 357–372 (2000). https://doi.org/10.1023/A:1018932108865

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018932108865

Search

Navigation