We give a memoryless scale-invariant randomized algorithm Mix-R for buffer management with bounded delay that is e/(e − 1)-competitive against an adaptive adversary, together with better performance guarantees for many restricted variants, including the s-bounded instances. In particular, Mix-R attains the optimum competitive ratio of 4/3 on 2-bounded instances. Both Mix-R and its analysis are ...