Randomized two-valued bounded delay online buffer management

被引：0
|
作者：
Durr, Christoph [1 ]
Kamali, Shahin [2 ]
机构：
[1] Sorbonne Univ, CNRS, Lab Informat Paris 6, Paris, France
[2] Univ Manitoba, Dept Comp Sci, Winnipeg, MB, Canada
来源：
OPERATIONS RESEARCH LETTERS | 2021年 / 49卷 / 02期
基金：
英国工程与自然科学研究理事会; 加拿大自然科学与工程研究理事会;
关键词：
Competitive ratio; Oblivious adversary; Buffer management; Maximum throughput scheduling;
D O I：
10.1016/j.orl.2021.01.010
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In the bounded delay buffer management problem unit size packets arrive online to be sent over a network link. The objective is to maximize the total weight of packets sent before their deadline. In this paper we are interested in the two-valued variant of the problem, where every packet has either low (1) or high priority weight (alpha > 1). We show that the optimal randomized competitive ratio against an oblivious adversary is 1 + (alpha - 1)/(alpha(2) + alpha). (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页码：246 / 249
页数：4
相关论文
共 50 条
12345