Open finite queueing networks with M/M/C/K parallel servers

https://doi.org/10.1016/0305-0548(94)90092-2Get rights and content

Abstract

The modelling and design of facility, telecommunication, service and manufacturing systems as open, finite queueing networks are extended to include multi-server M/M/C/K servers. An analytical approximation technique is utilized to calculate system performance measures of each M/M/C/K queue. Series, merge, and splitting topologies are analyzed and it is shown that the analytical technique applies to arbitrarily configured series-parallel network topologies. In addition, we explore the optimal order of these M/M/C/K servers in these systems.

References (68)

  • T. Altiok

    Approximate analysis of exponential tandem queues with blocking

    Europ. J. Ops Res.

    (1982)
  • L. Kerbache et al.

    Asymptotic behaviour of the expansion method for open finite queueing networks

    Computers Ops Res.

    (1988)
  • R. Onvural et al.

    Some equivalencies on closed queueing networks with blocking

    Perform. Eval.

    (1989)
  • I.F. Akyilidiz

    Exact product form solutions for queueing networks with blocking

    IEEE Trans. Computers

    (1987)
  • I.F. Akyildiz

    On the exact and approximate throughput analysis of closed queueing networks with blocking

    IEEE Trans. Softw. Engng

    (1988)
  • I.F. Akyildiz

    Exact analysis of queueing networks with rejection blocking

  • A.O. Alien

    Probability, Statistics, and Queueing Theory with Computer Applications

    (1978)
  • T. Altiok et al.

    Open networks of queues with blocking: split and merge configurations

    IIE Trans.

    (1986)
  • F. Baskett et al.

    Open, closed, and mixed networks of queues with different classes of customers

    J. ACM

    (1975)
  • O. Boxma et al.

    Approximate analysis of exponential queuing systems with blocking

    Acta Inform.

    (1981)
  • A. Brandwajn et al.

    An approximation method for tandem queues with blocking

    Ops Res.

    (1988)
  • J. Buzacott et al.

    Approximate queueing models of dynamic job shops

    Mgmt Sci.

    (1985)
  • P. Caseau et al.

    Throughput capacity of a sequence of queues with blocking due to finite waiting room

    IEEE Trans. Soft. Engng

    (1979)
  • K.M. Chandy et al.

    Approximate methods for analyzing queueing network models of computing systems

    Computer Surv.

    (1978)
  • Nikhil Chikhale et al.

    Sensitivity analysis in open finite queueing networks

  • J. Cheah

    State dependent queueing models

  • J. Cheah and J. MacGregor Smith, Generalized state dependent queueing models and pedestrian traffic flows. In...
  • Y. Dallery et al.

    A decomposition method for the approximate analysis of closed queueing networks with blocking

  • S. Daskalaki et al.

    Optimal routing and buffer space allocation in series-parallel queueing networks

  • S. Daskalaki et al.

    Real time routing in finite queueing networks

  • S. Daskalaki and J. MacGregor Smith, Static routing in open finite queueing networks. In...
  • R.L. Disney et al.

    Queueing networks: a survey of their random processes

    SIAM Rev.

    (1985)
  • A.A. Fredericks et al.

    Approximations to stochastic service systems with an application to a retrial model

    Bell Sys. Tech. J.

    (1979)
  • A.A. Fredericks

    Congestion in blocking systems — a simple approximation technique

    Bell Sys. Tech. J.

    (1980)
  • E. Gelenbe et al.

    The behavior of a single queue in a general queueing network

    ACTA INF

    (1976)
  • W.J. Gordan et al.

    Closed queueing systems with exponential servers

    Ops Res.

    (1967)
  • W.J. Gordan et al.

    Cyclic queueing systems with restricted length queues

    Ops Res.

    (1967)
  • Hemant Gosavi et al.

    Heavy traffice multi-commodity routing in open finite queueing networks

  • G.S. Graham

    Queueing network models of computer systems

    ACM Comput. Surv.

    (1978)
  • D. Gross et al.

    Fundamentals of Queueing Theory

    (1985)
  • L. Gun

    Annotated bibliography of blocking systems

  • L. Gun et al.

    An approximation method for general tandem queueing systems subject to blocking

  • B. Nalachimi et al.

    A diffusion approximation solution to the G/G/k queueing system

    Computers Ops Res.

    (1977)
  • Y. Han et al.

    Approximate analysis of M/M/C/K queueing networks

  • Cited by (39)

    • Approximation of throughput in tandem queues with multiple servers and blocking

      2014, Applied Mathematical Modelling
      Citation Excerpt :

      The literature on the analysis of tandem queues with multiple servers and finite buffer is more scarce than the single server system. Maximum entropy method [20] and expansion method [21] are presented for approximation of the subsystem in multi-server queueing networks with finite buffers and exponential distribution of service time. van Vuuren et al. [22] decomposed the tandem queue with parallel reliable servers and general distribution of service time into subsystems with two service stations and one buffer space, and then approximate each multi-server subsystem by an aggregated single (super) server queue with state-dependent inter-arrival and service times.

    • Near optimal buffer allocation in remanufacturing systems with N-policy

      2010, Computers and Industrial Engineering
      Citation Excerpt :

      After decomposing the network, we use the expansion methodology to analyze each node individually. The expansion methodology is an efficient tool for the analysis of nodes with finite buffers (Jain & Smith, 1994; Kerbache & Smith, 1987; Kerbache & Smith, 1988; Singh & Smith, 1997; Smith & Daskalaki, 1988). In this methodology, we expand the network by adding an extra node in front of each finite buffer node.

    • Performance optimization of open zero-buffer multi-server queueing networks

      2010, Computers and Operations Research
      Citation Excerpt :

      We compare our results with simulation, and show that the generalized expansion method (GEM) proposed by Kerbache and Smith [9] gives an excellent approximation for the performance measures of the zero-buffer systems studied. We show that the GEM delivers results with an accuracy mostly less than 5% (with maxima up to 16% for heavy congested systems, similar as in [8]), for basic series, merge, and split topologies, both symmetrical and asymmetrical. We present a multi-objective optimization methodology for zero-buffer systems, which provides particularly insightful results.

    • Buffer allocation plan for a remanufacturing cell

      2005, Computers and Industrial Engineering
    View all citing articles on Scopus

    Research supported by Grants from the National Science Foundation #MSM-8715152, MSS-9116666.

    S. Jain is a consultant with American Airlines Decision Technologies. He is interested in mathematical programming applications especially in the areas of transportation and logistics. He graduated from the University of Massachusetts with an M.Sci. degree in Industrial Engineering and Operations Research. His thesis was the basis for the article published here.

    §

    J. MacGregor Smith received his Bachelors and Masters of Architecture from the University of California at Berkeley and his Ph.D. in Mechanical and Industrial Engineering from the University of Illinois at Chapaign-Urbana. He is also a registered architect. His academic and professional interests include the design of algorithms for combinatorial optimization and stochastic network problems, the optimal design of facilities, networks, and the design and analysis of manufacturing systems.

    View full text