An adversarial queueing model for online server routing

DOI10.1016/j.tcs.2007.05.034zbMath1188.68081OpenAlexW2059852219MaRDI QIDQ995586

Vincenzo Bonifaci

Publication date: 3 September 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.05.034

zbMATH Keywords

online algorithmsadversarial queueing theoryserver routing

Mathematics Subject Classification ID

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

Related Items (6)

Optimal deterministic algorithms for some variants of online quota traveling salesman problem ⋮ Online \(k\)-server routing problems ⋮ On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis ⋮ Online graph exploration: New results on old and new algorithms ⋮ On the power of lookahead in on-line server routing problems ⋮ An adversarial queueing model for online server routing

Cites Work

• Unnamed Item
• Unnamed Item
• An adversarial queueing model for online server routing
• On-line algorithms for the dynamic traveling repair problem
• The k-Client Problem
• Adversarial queuing theory
• Universal-stability results and performance bounds for greedy contention-resolution protocols
• A comparative analysis of disk scheduling policies
• New algorithms for disk scheduling

This page was built for publication: An adversarial queueing model for online server routing