Buffer management of multi-queue QoS switches with class segregation
We focus on buffer management of multi-queue QoS switches with class segregation. Our model consists of m queues and m  packet values 0<v1<v2<<vm 0 < v 1 < v 2 <  < v m . We analyze the competitive ratio of Greedy for general case. We show that the competitive ratio of Greedy is (1+r) ( 1 + r ) , where r=maxi?vi/vi+1 r = max i ? v i / v i + 1 .
buffer management competitive ratio online algorithms quality of service (qos)