Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach

DOI10.1109/12.477243zbMath1068.68623OpenAlexW2136694925MaRDI QIDQ4421128

Richard R. Muntz, John C. S. Lui, Don Towsley

Publication date: 10 November 2003

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2bbf2bb8dff04559e0c7e33deda934def3cf8e67

Mathematics Subject Classification ID

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

Related Items (4)

Allocation of flows in closed bipartite queueing networks ⋮ Sub-stochastic matrix analysis for bounds computation -- theoretical results ⋮ Unnamed Item ⋮ Algorithms of distributed task allocation for cooperative agents

This page was built for publication: Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach