Maxima of sojourn times in acyclic Jackson queueing networks

DOI10.1016/S0305-0548(97)81037-4zbMATH Open0889.90070MaRDI QIDQ1374039FDOQ1374039

Authors: Richard F. Serfozo, Sung Yeol Kang 

Publication date: 2 December 1997

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

Recommendations

• Heavy-traffic extreme-value limits for queues
• Extreme and high-level sojourns of the single server queue in heavy traffic
• Extreme values of phase-type and mixed random variables with parallel-processing examples
• Extreme Values of Queue Lengths in M/G/1 and GI/M/1 Systems

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

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

Cited In (1)

• Title not available (Why is that?)

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

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