Sojourn Times in Queueing Networks

DOI10.1287/MOOR.7.2.223MaRDI QIDQ3968730zbMATH OpenOpenAlexFDO

Authors 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

sojourn timesqueueing networksPoisson arrivalsovertake-free pathsseveral types of customerslimiting state distributionsstate dependent servicetype dependent routing

Mathematics Subject Classification ID

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

Cited in

(12)

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

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

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