The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks

DOI10.1145/2157.322409zbMath0627.68035OpenAlexW1973482172MaRDI QIDQ3763586

Bruce Hajek

Publication date: 1983

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2157.322409

zbMATH Keywords

packet communicationsrouting in queueing networks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (11)

Improving routing decisions in parallel non-observable queues ⋮ Scheduling arrivals to a queue ⋮ Asymptotic Optimality of Constant-Order Policies for Lost Sales Inventory Models with Large Lead Times ⋮ Scheduling arrivals to queues for minimum average blocking: The \(S(n)/M/C/C\) system ⋮ Optimality Gap of Constant-Order Policies Decays Exponentially in the Lead Time for Lost Sales Models ⋮ Mathematical theory of queueing networks ⋮ Time-bounded termination analysis for probabilistic programs with delays ⋮ Algorithms for generalized round robin routing ⋮ Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies ⋮ Dynamic Scheduling of a Four-Station Queueing Network ⋮ Bayesian analysis of \(Er/M/1\) and \(Er/M/c\) queues

This page was built for publication: The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks