Off-line admission control for advance reservations in star networks

  • Authors:

  • Udo Adamy;Thomas Erlebach;Dieter Mitsche;Ingo Schurr;Bettina Speckmann;Emo Welzl

  • Affiliations:

  • Institute for Theoretical Computer Science, ETH Zürich, Zürich, Switzerland;Department of Computer Science, University of Leicester, Leicester, UK;Institute for Theoretical Computer Science, ETH Zürich, Zürich, Switzerland;Institute for Theoretical Computer Science, ETH Zürich, Zürich, Switzerland;Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands;Institute for Theoretical Computer Science, ETH Zürich, Zürich, Switzerland

  • Venue:
  • WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a network together with a set of connection requests, call admission control is the problem of deciding which calls to accept and which ones to reject in order to maximize the total profit of the accepted requests. We consider call admission control problems with advance reservations in star networks. For the most general variant we present a constant-factor approximation algorithm resolving an open problem due to Erlebach. Our method is randomized and achieves an approximation ratio of 1/18. It can be generalized to accommodate call alternatives, in which case the approximation ratio is 1/24. We show how our method can be derandomized. In addition we prove that call admission control in star networks is ${\mathcal APX}$-hard even for very restricted variants of the problem.