Maxima of sojourn times in acyclic Jackson queueing networks

DOI10.1016/S0305-0548(97)81037-4zbMath0889.90070MaRDI QIDQ1374039

Richard F. Serfozo, Sung Yeol Kang

Publication date: 2 December 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

asymptotic behaviorErlang distributionsacyclic Jackson queueing networkssequence of sojourn times

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markovian network processes: Congestion-dependent routing and processing
• Extremes and related properties of random sequences and processes
• Extreme values of birth and death processes and queues
• Analysis of a three node queueing network
• The amount of overtaking in a network of queues
• Extreme Values of Queue Lengths in M/G/1 and GI/M/1 Systems
• Positive correlations in a three-node Jackson queueing network
• Sojourn times and the overtaking condition in Jacksonian networks
• Note—Some Results on Sojourn Times in Acyclic Jackson Networks
• Sojourn Times in Queueing Networks
• Proof of a Conjecture on the Interarrival-Time Distribution in an M/M/1 Queue with Feedback
• Sample extremes: an elementary introduction
• Sufficient Conditions for a Mixture of Exponentials to be a Probability Density Function
• Products of distribution functions attracted to extreme value laws
• Extreme Values in the GI/G/1 Queue
• Note on Queues in Tandem

This page was built for publication: Maxima of sojourn times in acyclic Jackson queueing networks