An Overview of PANACEA, a Software Package for Analyzing Markovian Queueing Networks

K. G. Ramakrishnan · Debasis Mitra

49 citations0/0 files storedBell System Technical Journal

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Network Traffic and Congestion Control Petri Nets in System Modeling

Abstract

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 49 citations exist upstream.

References

1975Open, Closed, and Mixed Networks of Queues with Different Classes of Customers 1980Mean-Value Analysis of Closed Multichain Queuing Networks 1973Computational algorithms for closed queueing networks with exponential servers 1979A Queueing Network Analysis of Computer Communication Networks with Window Flow Control 1975Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms 1980Computational algorithms for closed queueing networks 1977Queueing Systems. Vol. II -- Computer Applications 1980Queueing network models of multiprogramming

Cited by

1983Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes 1994Monte Carlo summation and integration applied to multiclass queuing networks 1995Calculating normalization constants of closed queueing networks by numerically inverting their generating functions 1991Steady-state analysis of reflected Brownian motions: characterization, numerical methods and queueing applications 1992Monte Carlo Summation Applied to Product-Form Loss Networks

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.