An adversarial queueing model for online server routing

DOI10.1016/J.TCS.2007.05.034zbMATH Open1188.68081OpenAlexW2059852219MaRDI QIDQ995586FDOQ995586

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1256755
• The chilean highway problem
• Adversarial queuing theory
• Effective routing and scheduling in adversarial queueing networks
• Stability of networks and protocols in the adversarial queueing model for packet routing

zbMATH Keywords

online algorithmsadversarial queueing theoryserver routing

Mathematics Subject Classification ID

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

Cites Work

• An adversarial queueing model for online server routing
• On-line algorithms for the dynamic traveling repair problem
• Adversarial queuing theory
• New algorithms for disk scheduling
• The \(k\)-client problem
• A comparative analysis of disk scheduling policies
• Universal-stability results and performance bounds for greedy contention-resolution protocols
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995586)