Resource allocation and admission control are critical tasks in a communication network, that often must be performed online. Algorithms for these types of problems have been considered both under benefit models (e.g., with a goal of approximately maximizing the number of calls accepted) and under cost models (e.g., with a goal of approximately minimizing the number of calls rejected). Unfortunately, algorithms designed for these two measures can often be quite different, even polar opposites (e.g., [1, 8]). In this work we consider the problem of combining algorithms designed for each of these objectives in a way that simultaneously is good under both measures. More formally, we are given an algorithm A which is cA competitive w.r.t. the number of accepted calls and an algorithm R which is cR competitive w.r.t. the number of rejected calls. We derive a combined algorithm whose competitive ratio is O(cR cA) for rejection and O(cA2) for acceptance. We also show building on known techniques that given a collection of k algorithms, we can construct one master algorithm which performs similar to the best algorithm among the k for the acceptance problem and another master algorithm which performs similar to the best algorithm among the k for the rejection problem. Using our main result we can combine the two master algorithms to a single algorithm which guarantees both rejection and acceptance competitiveness.
[1]
Ricardo A. Baeza-Yates,et al.
Searching in the Plane
,
1993,
Inf. Comput..
[2]
Yossi Azar,et al.
On-line choice of on-line algorithms
,
1993,
SODA '93.
[3]
Yossi Azar,et al.
Throughput-competitive on-line routing
,
1993,
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[4]
Yuval Rabani,et al.
On-line admission control and circuit routing for high performance computing and communication
,
1994,
Proceedings 35th Annual Symposium on Foundations of Computer Science.
[5]
Amos Fiat,et al.
Competitive non-preemptive call control
,
1994,
SODA '94.
[6]
Amos Fiat,et al.
Making commitments in the face of uncertainty: how to pick a winner almost every time (extended abstract)
,
1996,
STOC '96.
[7]
Sundar Vishwanathan,et al.
Competitive Algorithms for Layered Graph Traversal
,
1998,
SIAM J. Comput..
[8]
Yossi Azar,et al.
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms
,
1999,
SODA '99.
[9]
Adam Tauman Kalai,et al.
Admission Control to Minimize Rejections
,
2003,
Internet Math..