具有有限延迟的自适应Advertising随机缓冲区管理
Randomised Buffer Management with Bounded Delay against Adaptive Adversary
摘要：
我们给出了一个新的分析的RMix算法由Chin等人。缓冲区管理有限延迟问题（或在线调度的单位作业，以最大限度地提高加权吞吐量）。与原e/（e-1）-竞争性证明不同，新的证明即使在自适应在线对手模型中也成立。事实上，证明工程也为一个稍微更一般的问题，研究了别科夫斯基等人。
英文摘要：
We give a new analysis of the RMix algorithm by Chin et al. for the Buffer Management with Bounded Delay problem (or online scheduling of unit jobs to maximise weighted throughput). Unlike the original proof of e/(e-1)-competitiveness, the new one holds even in adaptive-online adversary model. In fact, the proof works also for a slightly more general problem studied by Bie{ń}kowski et al.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
