2009/07/12 by Łukasz Jeż, Jeż, Łukasz
Computer Science · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.DS
paper · pdf · doi:10.48550/arxiv.0907.2050
Obsolete; improved upon by arXiv:1102.1273 [cs.DS]. This comment is the only difference from previous version
arxiv created 2011/02/08 · arxiv updated 2011/02/09
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.