On passage times in Jackson networks: Two-stations walk and overtake-free paths

DOI10.1007/BF01916920zbMath0526.60088OpenAlexW1992238812MaRDI QIDQ3040279

Hans Daduna

Publication date: 1983

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01916920

zbMATH Keywords

Jackson networkspassage timeproduct-form solutionovertake-free paths

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Mathematical theory of queueing networks

Cites Work

• Waiting Times When Queues are in Tandem
• Sojourn times and the overtaking condition in Jacksonian networks
• The Distribution of Queuing Network States at Input and Output Instants
• Passage times for overtake-free paths in Gordon–Newell networks
• On Markov Jump Processes Imbedded at Jump Epochs and Their Queueing-Theoretic Applications
• Sojourn Times in Queueing Networks
• Note on Queues in Tandem
• Unnamed Item

This page was built for publication: On passage times in Jackson networks: Two-stations walk and overtake-free paths