Travel times in queueing networks and network sojourns

DOI10.1007/BF02023093zbMath0795.90025MaRDI QIDQ1315333

Richard F. Serfozo

Publication date: 14 September 1994

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

zbMATH Keywords

queueingstrong law of large numbersLittle's lawPalm probabilityJackson networkstravel timeexpected values of sojourn timesMarkov network processes

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (1)

Little laws for utility processes and waiting times in queues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Palm probabilities and stationary queues
• Markovian network processes: Congestion-dependent routing and processing
• A review of \(L=\lambda W\) and extensions
• Heavy-traffic analysis of the sojourn time in a three node Jackson network with overtaking
• Travel and sojourn times in stochastic networks
• Queueing networks with dependent nodes and concurrent movements
• Sample-path analysis of processes with imbedded point processes
• Waiting Times When Queues are in Tandem
• A note on sojourn times in queuing networks with multiserver nodes
• Sojourn times in closed queueing networks
• Cycle Times in Two-Stage Closed Queueing Networks: Applications to Multiprogrammed Computer Systems with Virtual Memory
• On sojourn time in Jackson networks of queues
• Sojourn times in queuing networks with multiserver modes
• Simultaneous busy periods for nodes in a stochastic network
• A generalization of little's law to moments of queue lengths and waiting times in closed, product-form queueing networks
• Sojourn times and the overtaking condition in Jacksonian networks
• Insensitive average residence times in generalized semi-Markov processes
• Passage times for overtake-free paths in Gordon–Newell networks
• Sojourn Times in Queueing Networks
• H = λG and the Palm transformation
• Applications of the key renewal theorem: crudely regenerative processes
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Approximate Analysis of General Queuing Networks by Decomposition
• The Time for a Round Trip in a Cycle of Exponential Queues
• Cyclic Queuing Systems with Restricted Length Queues
• The Output Process of a Stationary $M/M/s$ Queueing System
• Semi-stationary processes

This page was built for publication: Travel times in queueing networks and network sojourns