Travel times in queueing networks and network sojourns
type: Item
instance of: scholarly article
title: Travel times in queueing networks and network sojourns
zbMATH Open document ID: 0795.90025
DOI: 10.1007/BF02023093
author: Richard F. Serfozo
published in: Annals of Operations Research
publication date: 1994-09-14T00:00:00Z
Mathematics Subject Classification ID: 90B15
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K20
zbMATH DE Number: 513129
zbMATH Keywords: queueing
zbMATH Keywords: travel time
zbMATH Keywords: Palm probability
zbMATH Keywords: strong law of large numbers
zbMATH Keywords: Little's law
zbMATH Keywords: expected values of sojourn times
zbMATH Keywords: Jackson networks
zbMATH Keywords: Markov network processes
MaRDI profile type: Publication
cites work: Palm probabilities and stationary queues
cites work: Insensitive average residence times in generalized semi-Markov processes
cites work: Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
cites work: The Output Process of a Stationary $M/M/s$ Queueing System
cites work: Passage times for overtake-free paths in Gordon–Newell networks
cites work: Cycle Times in Two-Stage Closed Queueing Networks: Applications to Multiprogrammed Computer Systems with Virtual Memory
cites work: Simultaneous busy periods for nodes in a stochastic network
cites work: Q4742085
cites work: Cyclic Queuing Systems with Restricted Length Queues
cites work: A note on sojourn times in queuing networks with multiserver nodes
cites work: Q3734820
cites work: Sojourn times in closed queueing networks
cites work: Heavy-traffic analysis of the sojourn time in a three node Jackson network with overtaking
cites work: Travel and sojourn times in stochastic networks
cites work: Approximate Analysis of General Queuing Networks by Decomposition
cites work: On sojourn time in Jackson networks of queues
cites work: A generalization of little's law to moments of queue lengths and waiting times in closed, product-form queueing networks
cites work: Sojourn Times in Queueing Networks
cites work: Waiting Times When Queues are in Tandem
cites work: The Time for a Round Trip in a Cycle of Exponential Queues
cites work: Sojourn times in queuing networks with multiserver modes
cites work: Semi-stationary processes
cites work: Markovian network processes: Congestion-dependent routing and processing
cites work: Applications of the key renewal theorem: crudely regenerative processes
cites work: Queueing networks with dependent nodes and concurrent movements
cites work: Sample-path analysis of processes with imbedded point processes
cites work: Q4714399
cites work: Sojourn times and the overtaking condition in Jacksonian networks
cites work: A review of \(L=\lambda W\) and extensions
cites work: H = λG and the Palm transformation
cites work: Q3816817
description: scientific article; zbMATH DE number 513129