Advertisement

Queueing Systems

, Volume 20, Issue 3–4, pp 409–431 | Cite as

Deadlock properties of queueing networks with finite capacities and multiple routing chains

  • Jörg Liebeherr
  • Ian F. Akyildiz
Article

Abstract

Blocking in queueing network models with finite capacities can lead to deadlock situations. In this paper, deadlock properties are investigated in queueing networks with multiple routing chains. The necessary and sufficient conditions for deadlockfree queueing networks with blocking are provided. An optimization algorithm is presented for finding deadlock-free capacity assignments with the least total capacity. The optimization algorithm maps the queueing network into a directed graph and obtains the deadlock freedom conditions from a specified subset of cycles in the directed graph. In certain network topologies, the number of deadlock freedom conditions can be large, thus, making any optimization computationally expensive. For a special class of topologies, so-calledtandem networks, it is shown that a minimal capacity assignment can be directly obtained without running an optimization algorithm. Here, the solution to the minimal capacity assignment takes advantage of the regular topology of tandem networks.

Keywords

Queueing networks blocking networks deadlocks deadlock prevention 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    I.F. Akyildiz and H.G. Perros (eds.), Queueing networks with finite capacity queues, Special Issue of Perf. Eval. 10(4) (1989).Google Scholar
  2. [2]
    B. Johnson, Finding all the elementary circuits in a directed graph, SIAM J. Comp. 4 (1975) 77–84.Google Scholar
  3. [3]
    S. Kundu and I.F. Akyildiz, Deadlock free buffer allocation in closed queueing networks, Queueing Systems 4 (1989) 47–56.Google Scholar
  4. [4]
    J. Liebeherr, Performance evaluation of synchronized systems, Georgia Institute of Technology, College of Computing (1991).Google Scholar
  5. [5]
    J. Liebeherr and I.F. Akyildiz, Deadlock properties of queueing networks with finite capacities and multiple routing chains, Technical Report CS-94-65, University of Virginia, Department of Computer Science (1993).Google Scholar
  6. [6]
    L. Schrage,Linear, Integer, and Quadratic Programming with LINDO, 3rd Ed. (The Scientific Press, 1986).Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1995

Authors and Affiliations

  • Jörg Liebeherr
    • 1
  • Ian F. Akyildiz
    • 2
  1. 1.Department of Computer ScienceUniversity of VirginiaCharlottesvilleUSA
  2. 2.School of Electrical and Computer EngineeringGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations