We focus on buffer management of multi-queue QoS switches with class segregation.Our model consists of m queues and m packet values 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 ) , where r = max i ? v i / v i + 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 < v 1 < v 2 < ? < v m . Recently, Al-Bawani and Souza (2013) 2] presented an online algorithm greedy for buffer management of multi-queue QoS switches with class segregation and showed that if m queues have the same size, then greedy is ( 1 + r ) -competitive, where r = max 1 ? i ? m - 1 ? v i v i + 1 . In this paper, we show that greedy is ( 1 + r ) -competitive for the case that m queues do not necessarily have the same size.
['Toshiya Itoh', 'Seiji Yoshimoto']
Buffer management of multi-queue QoS switches with class segregation