THE TIME-TO-EMPTY FOR TANDEM JACKSON NETWORKS

DOI10.1017/S0269964804184052MaRDI QIDQ4673892zbMATH OpenOpenAlexFDO

Authors Michael A. Zazanis

Publication date 9 May 2005

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0269964804184052

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Queues and service in operations research (90B22)

Recommendations

• Asymptotic properties of first passage times for two tandem queues:time to empty the system
• Asymptotic properties of first passage times for tandem jackson networks I: buildup of large queue lengths
• The cyclic queue and the tandem queue
• scientific article; zbMATH DE number 4025139
• Heavy Traffic Analysis of the Sojourn Time in Tandem Queues with Overtaking

Cites work

• A distributional form of Little's law
• A Palm calculus approach to functional versions of Little's law
• A relation between stationary queue and waiting time distributions
• Cycle times in single server cyclic Jackson networks.
• Event and time averages: a review
• Formulas and representations for cyclic Markovian networks via Palm calculus
• Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers
• The Distribution of Queuing Network States at Input and Output Instants

Cited in

(1)

• Asymptotic properties of first passage times for two tandem queues:time to empty the system

This page was built for publication: THE TIME-TO-EMPTY FOR TANDEM JACKSON NETWORKS

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