Sojourn Times in Queueing Networks

DOI10.1287/moor.7.2.223zbMath0502.90029OpenAlexW1964676350MaRDI QIDQ3968730

Benjamin Melamed

Publication date: 1982

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.7.2.223

zbMATH Keywords

queueing networksPoisson arrivalssojourn timesovertake-free pathsseveral types of customerslimiting state distributionsstate dependent servicetype dependent routing

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (12)

An invariance property of sojourn times in cyclic networks ⋮ Analysis of a three node queueing network ⋮ Further remarks on queueing network theory ⋮ Maxima of sojourn times in acyclic Jackson queueing networks ⋮ Design of fork-join networks of First-In-First-out and infinite-server queues applied to clinical chemistry laboratories ⋮ Dependence structure of sojourn times via partition separated ordering ⋮ Mathematical theory of queueing networks ⋮ Networks of queues in discrete time ⋮ On passage times in Jackson networks: Two-stations walk and overtake-free paths ⋮ Availability Formulas and Performance Measures for Separable Degradable Networks ⋮ Theory of queuing networks and its applications to the analysis of information-computing systems ⋮ Travel times in queueing networks and network sojourns

This page was built for publication: Sojourn Times in Queueing Networks