Improved combination of online algorithms for acceptance and rejection

Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)accept-competitive and O(cAcR)-reject-competitive. The combined algorithms make no reference to the offline optimal solution. In addition, one of the algorithms does not require knowing the value of either cA or cR. This improves on work of Azar, Blum, and Mansour, whose combined algorithm was O(c2 A)-accept-competitive, involved computing offline optimal solutions, and required knowing the values of both cA and cR. Categories and Subject Descriptors C.2.2 [Computer-Communication Networks]: Network Protocols—Routing protocols; F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems General Terms Algorithms, Theory. Keywords On-line, Competitive, QoS, Admission control.

• Type: Conference
• Year: 2004
• Where: SPAA
• Authors: David P. Bunde, Yishay Mansour
• Keywords: Admission Control Algorithms, Algorithms, Distributed And Parallel Computing, Offline Optimal Solutions, SPAA 2004