## Abstract

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 C_{A} competitive w.r.t. the number of accepted calls and an algorithm R which is C_{R} competitive w.r.t. the number of rejected calls. We derive a combined algorithm whose competitive ratio is O(C_{R}C_{A}) for rejection and O(c_{A}^{2}) 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.

Original language | English |
---|---|

Pages | 159-163 |

Number of pages | 5 |

DOIs | |

State | Published - 2003 |

Event | Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures - San Diego, SA, United States Duration: 7 Jun 2003 → 9 Jun 2003 |

### Conference

Conference | Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures |
---|---|

Country/Territory | United States |

City | San Diego, SA |

Period | 7/06/03 → 9/06/03 |

## Keywords

- Admission control
- Competitive
- On-line
- QoS