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

limiting state distributionsovertake-free pathsPoisson arrivalsqueueing networksseveral types of customerssojourn timesstate 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)

Cited in

(12)

• Theory of queuing networks and its applications to the analysis of information-computing systems
• Analysis of a three node queueing network
• Further remarks on queueing network theory
• Travel times in queueing networks and network sojourns
• Maxima of sojourn times in acyclic Jackson queueing networks
• Dependence structure of sojourn times via partition separated ordering
• An invariance property of sojourn times in cyclic 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
• Design of fork-join networks of First-In-First-out and infinite-server queues applied to clinical chemistry laboratories
• Mathematical theory of queueing networks

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)