Randomised Buffer Management with Bounded Delay against Adaptive Adversary

Details Randomised Buffer Management with Bounded Delay against Adaptive Adversary Randomised Buffer Management with Bounded Delay against Adaptive Adversary

2009-07-12

arxiv.org/abs/0907.2050v2

Computer Science

Data Structures and Algorithms

Obsolete; improved upon by arXiv:1102.1273 [cs.DS]. This comment is the only difference from previous version

Scientific paper

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{\'n}kowski et al.

Affiliated with

Also associated with

No associations

Rating

Randomised Buffer Management with Bounded Delay against Adaptive Adversary does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Randomised Buffer Management with Bounded Delay against Adaptive Adversary, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomised Buffer Management with Bounded Delay against Adaptive Adversary will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-593548