Heavy-traffic analysis of the sojourn time in a three node Jackson network with overtaking

DOI10.1007/BF02412248zbMath0729.60088MaRDI QIDQ806196

John A. Morrison, Charles Knessl

Publication date: 1991

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

Jackson networkeffect of overtakingheavy traffic asymptotic approximation

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (2)

A law of the iterated logarithm for the sojourn time process in queues in series ⋮ Travel times in queueing networks and network sojourns

Cites Work

• Analysis of a three node queueing network
• The amount of overtaking in a network of queues
• Response-Time Distribution for a Processor-Sharing System
• Approximations to the moments of the sojourn time in a tandem queue with overtaking
• Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem
• Asymptotic Analysis of the Waiting-Time Distribution for a Large Closed Processor-Sharing System
• Light Traffic Limits of Sojourn Time Distributions in Markovian Queueing Networks
• Positive correlations in a three-node Jackson queueing network
• Note—Some Results on Sojourn Times in Acyclic Jackson Networks
• Heavy Traffic Analysis of the Sojourn Time in Tandem Queues with Overtaking

This page was built for publication: Heavy-traffic analysis of the sojourn time in a three node Jackson network with overtaking