Solution of Queuing Problems by a Recursive Technique

Ulrich Herzog · L. S. Woo · K. Mani Chandy

99 citations0/0 files storedIBM Journal of Research and Development

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 Probability and Statistical Research Petri Nets in System Modeling

Abstract

A recursive method for efficient computational analysis of a wide class of queuing problems is presented. Interarrival and service times are described by multidimensional Markovian processes while arrival and service rates are allowed to be state dependent.

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 — 99 citations exist upstream.

References

1953Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain 1952The theory of queues with a single server

Cited by

1975Approximate Analysis of Central Server Models 1990Modeling and analysis of communication systems based on computational methods for Markov chains 1985Queueing models for a flexible machining station Part II: The method of Coxian phases 1981Approximate Solution of Queueing Networks with Simultaneous Resource Possession 1977Memory management and response time 1987Matrix-geometric and Recursive Algorithm Solution of a Two-stage Unreliable How Line 1987An approximate analysis for a class of assembly-like queues 1979Queueing network software for systems modelling

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.