An adversarial queueing model for online server routing

DOI10.1016/J.TCS.2007.05.034MaRDI QIDQ995586zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

online algorithmsadversarial queueing theoryserver routing

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1629851 (Why is no real title available?)
• scientific article; zbMATH DE number 1947058 (Why is no real title available?)
• A comparative analysis of disk scheduling policies
• Adversarial queuing theory
• An adversarial queueing model for online server routing
• New algorithms for disk scheduling
• On-line algorithms for the dynamic traveling repair problem
• The \(k\)-client problem
• Universal-stability results and performance bounds for greedy contention-resolution protocols

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
• An adversarial queueing model for online server routing
• On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis

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)