Note: An adversarial queueing model for online server routing

Authors:
Vincenzo Bonifaci
Affiliations:
Dip. di Informatica e Sistemistica, Università di Roma La Sapienza, Rome, Italy and Department of Mathematics and Computer Science, Technical University Eindhoven, Eindhoven, The Netherlands
Venue:
Theoretical Computer Science
Year:
2007

Citing 6
Cited 4

A comparative analysis of disk scheduling policies

Communications of the ACM
Adversarial queuing theory

Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols

Journal of the ACM (JACM)
The k-client problem

Journal of Algorithms
Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On-Line Algorithms for the Dynamic Traveling Repair Problem

Journal of Scheduling

On the power of lookahead in on-line server routing problems

Theoretical Computer Science
On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Performance Evaluation of a Web-Based System to Exchange Electronic Health Records Using Queueing Model (M/M/1)

Journal of Medical Systems
Response Time Estimation of a Web-Based Electronic Health Record EHR System using Queuing Model

International Journal of E-Health and Medical Communications

Quantified Score

Hi-index	5.23

Visualization

Abstract

In an online server routing problem, a vehicle or server moves in a network in order to process incoming requests at the nodes. Online server routing problems have been thoroughly studied using competitive analysis. We propose a new model for online server routing, based on adversarial queueing theory. The model addresses questions such as whether a server routing algorithm is stable, that is, whether it is such that the number of unserved requests in the system remains bounded at all times, assuming a bound on the global rate of requests arrival. This captures a notion of throughput for which competitive analysis typically does not give any useful result. In this framework, we consider a number of natural algorithms and we analyze their stability and performance.