A Novel Approximate Algorithm for Admission Control

  • Authors:

  • Jinghui Zhang;Junzhou Luo;Zhiang Wu

  • Affiliations:

  • School of Computer Science and Engineering, Southeast University, Nanjing, China 210096;School of Computer Science and Engineering, Southeast University, Nanjing, China 210096;School of Computer Science and Engineering, Southeast University, Nanjing, China 210096

  • Venue:
  • FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Admission control is the problem of deciding for a given set of requests which of them to accept and which to reject, with the goal of maximizing the profit obtained from the accepted requests. The problem is considered in a scenario with advance reservations where multiple resources exist and users can specify several resource request alternatives. Each alternative is associated with a resource capacity requirement for a time interval on one of the multiple resources and a utility. We give a novel (1 + *** )-approximation admission control algorithm with respect to the maximal utility and derive the approximation ratio for different request scenarios. We also design non-guaranteed greedy heuristics. We compare the performance of our approximation algorithm and greedy heuristics in aspect of utility optimality and timing in finding solutions. Simulation results show that on average our approximation algorithm appears to offer the best trade-off between quality of solution and computation cost. And our (1 + *** )-approximation algorithm shows its intrinsic stability in performance for different utility functions.