A Simple Proof of the Equivalence of Input and Output Intervals in Jackson Networks of Single Server Nodes

DOI10.1287/OPRE.37.4.645MaRDI QIDQ3833397zbMATH OpenOpenAlexFDO

Authors Peter C. Kiessler

Publication date 1989

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.37.4.645

zbMATH Keywords

stationary Jackson network of single server nodesstationary queue length process

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Recommendations

• scientific article; zbMATH DE number 4199218
• On the Jackson networks
• scientific article; zbMATH DE number 1366691
• The output of a queuing system
• Invariance of the stationary distribution of the states of modified Jackson and Gordon-Newall networks

This page was built for publication: A Simple Proof of the Equivalence of Input and Output Intervals in Jackson Networks of Single Server Nodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833397)