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• 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+1r=maxi⁡vi/vi+1.

In this paper, we focus on buffer management of multi-queue QoS switches in which packets of different values are segregated in different queues. Our model consists of m queues and m   packet values 0