Improved combination of online algorithms for acceptance and rejection

David P. Bunde; Yishay Mansour

doi:10.1145/1007912.1007952

Improved combination of online algorithms for acceptance and rejection

David P. Bunde^*, Yishay Mansour

^*Corresponding author for this work

School of Computer Science

University of Illinois

Research output: Contribution to conference › Paper › peer-review

2 Scopus citations

Abstract

Given two admission control algorithms that are c_A-accept- competitive and c_R-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(C_A)-accept-competitive and O(c_AC_R)-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(c _A²)-accept-competitive, involved computing offline optimal solutions, and required knowing the values of both C_A and C _R.

Original language	English
Pages	265-266
Number of pages	2
DOIs	https://doi.org/10.1145/1007912.1007952
State	Published - 2004
Event	SPAA 2004 - Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures - Barcelona, Spain Duration: 27 Jun 2004 → 30 Jun 2004

Conference

Conference	SPAA 2004 - Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures
Country/Territory	Spain
City	Barcelona
Period	27/06/04 → 30/06/04

Keywords

Admission control
Competitive
On-line
QoS

Access to Document

10.1145/1007912.1007952

Cite this

@conference{30043edbf50840b9843ce57005229cdb,

title = "Improved combination of online algorithms for acceptance and rejection",

abstract = "Given two admission control algorithms that are cA-accept- competitive 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(c A2)-accept-competitive, involved computing offline optimal solutions, and required knowing the values of both CA and C R.",

keywords = "Admission control, Competitive, On-line, QoS",

author = "Bunde, {David P.} and Yishay Mansour",

year = "2004",

doi = "10.1145/1007912.1007952",

language = "אנגלית",

pages = "265--266",

note = "SPAA 2004 - Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures ; Conference date: 27-06-2004 Through 30-06-2004",

}

TY - CONF

T1 - Improved combination of online algorithms for acceptance and rejection

AU - Bunde, David P.

AU - Mansour, Yishay

PY - 2004

Y1 - 2004

N2 - Given two admission control algorithms that are cA-accept- competitive 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(c A2)-accept-competitive, involved computing offline optimal solutions, and required knowing the values of both CA and C R.

AB - Given two admission control algorithms that are cA-accept- competitive 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(c A2)-accept-competitive, involved computing offline optimal solutions, and required knowing the values of both CA and C R.

KW - Admission control

KW - Competitive

KW - On-line

KW - QoS

UR - http://www.scopus.com/inward/record.url?scp=8344263812&partnerID=8YFLogxK

U2 - 10.1145/1007912.1007952

DO - 10.1145/1007912.1007952

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:8344263812

SP - 265

EP - 266

T2 - SPAA 2004 - Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures

Y2 - 27 June 2004 through 30 June 2004

ER -

Improved combination of online algorithms for acceptance and rejection

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this