THE TIME-TO-EMPTY FOR TANDEM JACKSON NETWORKS

DOI10.1017/S0269964804184052zbMath1063.90013OpenAlexW2089907314MaRDI QIDQ4673892

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

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

Cites Work

• Cycle times in single server cyclic Jackson networks.
• A distributional form of Little's law
• Formulas and representations for cyclic Markovian networks via Palm calculus
• A Palm calculus approach to functional versions of Little's law
• 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
• Event and time averages: a review
• A relation between stationary queue and waiting time distributions

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