PANACEA is a software package that significantly extends the range of Markovian queueing networks that are computationally tractable. It solves multi-class closed, open, and mixed queueing networks. Based on an underlying theory of integral representations and asymptotic expansions, PANACEA solves queueing networks that are orders of magnitude larger than can be solved by other established algorithms. The package is finding widespread use in Bell Laboratories. It also has important software innovations. A flexible programming-language-like interface facilitates compact representation of large queueing networks. An out-of-core implemental strategy enables PANACEA to be ported to processors with modest memory. The modular structure of this software package, along with the automatic machine-generated parser, makes it easily extendable. This paper provides an overview of two basic versions of PANACEA, versions 1.0 and 1.1, which solve ”closed” networks only. A description of its model language is given from the point of view of its capability to describe queueing networks in a compact, natural manner. The paper discusses the algorithms, together with their time and storage requirements, that are used in the implementation. Several numerical examples are given.

References in zbMATH (referenced in 16 articles )

Showing results 1 to 16 of 16.
Sorted by year (citations)

  1. Kim, Sunkyo; Muralidharan, Ravi; O’Cinneide, Colm A.: Taking account of correlations between streams in queueing network approximations (2005)
  2. Chen, Wu-Lin; O’Cinneide, Colm Art: Towards a polynomial-time randomized algorithm for closed product-form networks (1998)
  3. Ross, Keith W.; Tsang, Danny H. K.; Wang, Jie: Monte Carlo summation and integration applied to multiclass queuing networks (1994)
  4. Wang, Jie; Ross, Keith W.: Asymptotic analysis for closed multiclass queueing networks in critical usage (1994)
  5. Ross, Keith W.; Wang, Jie: Asymptotically optimal importance sampling for product-form queuing networks (1993)
  6. Ross, Keith W.; Wang, Jie: Monte Carlo summation applied to product-form loss networks (1992)
  7. Cook, Grant O. jun.; Painter, Jeffrey F.; Brown, Stewart A.: How symbolic computation boosts productivity in the simulation of partial differential equations (1991)
  8. Dai, J. G.; Harrison, J. M.: Steady-state analysis of RBM in a rectangle: Numerical methods and a queueing application (1991)
  9. Mitra, D.; Mitrani, I.; Ramakrishnan, K. G.; Seery, J. B.; Weiss, A.: A unified set of proposals for control and design of high speed data networks (1991)
  10. Mitra, Debasis; Cieslak, Randall A.: Randomized parallel communications on an extension of the omega network (1987)
  11. Mitra, Debasis; McKenna, J.: Asymptotic expansions for closed Markovian networks with state-dependent service rates (1986)
  12. Suri, Rajan; Diehl, Gregory W.: A variable buffer-size model and its use in analyzing closed queueing networks with blocking (1986)
  13. Disney, Ralph L.; König, Dieter: Queueing networks: A survey of their random processes (1985)
  14. McKenna, J.; Mitra, Debasis: Asymptotic expansions and integral representations of moments of queue lengths in closed Markovian networks (1984)
  15. Mitra, Debasis; Morrison, J. A.: Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes (1983)
  16. Ramakrishnan, K. G.; Mitra, D.: An overview of PANACEA, a software package for analyzing Markovian queueing networks (1982)