Analysis of Open Discrete Time Queueing Networks: A Refined Decomposition Approach

DOI10.1057/JORS.1996.76zbMath0863.90066OpenAlexW2030125856MaRDI QIDQ4717122

Erik S. Rieger, Gerhard Hasslinger

Publication date: 16 June 1997

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1996.76

zbMATH Keywords

open queueing networksqueue sizeinterdeparture timesdiscrete time algorithmsapproximate analysis methodsstationary distributions of the waiting time

Mathematics Subject Classification ID

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

Related Items (2)

A numerical method to determine the waiting time and the idle time distributions of a GI/G/1 queue when inter-arrival times and/or service times have geometric tails ⋮ A unified framework for approximation of general telecommunication networks

This page was built for publication: Analysis of Open Discrete Time Queueing Networks: A Refined Decomposition Approach