Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Proportional differentiated services: delay differentiation and packet scheduling
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Loss-bounded analysis for differentiated services
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A survey of buffer management policies for packet switches
ACM SIGACT News
One to rule them all: a general randomized algorithm for buffer management with bounded delay
ESA'11 Proceedings of the 19th European conference on Algorithms
An optimal lower bound for buffer management in multi-queue switches
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Optimal buffer management via resource augmentation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Bounded delay packet scheduling in a bounded buffer
Operations Research Letters
| Hi-index | 0.00 |
It is widely accepted that next-generation networks will provide guaranteed services, in contrast to the "best effort" approach today. We study and analyze queueing policies for network switches that support the QoS (Quality of Service) feature. One realization of the QoS feature is that packets are not necessarily all equal, with some having higher priorities than the others. We model this situation by assigning an intrinsic value to each packet. In this paper we are concerned with three different queueing policies: the nonpreemptive model, the FIFO preemptive model, and the bounded delay model. We concentrate on the situation where the incoming traffic overloads the queue, resulting in packet loss. The objective is to maximize the total value of packets transmitted by the queueing policy. The difficulty lies in the unpredictable nature of the future packet arrivals. We analyze the performance of the online queueing policies via competitive analysis, providing upper and lower bounds for the competitive ratios. We develop practical yet sophisticated online algorithms (queueing policies) for the three queueing models. The algorithms in many cases have provably optimal worst- case bounds. For the nonpreemptive model, we devise an optimal online algorithm for the common 2-value model. We provide a tight logarithmic bound for the general nonpreemptive model. For the FIFO preemptive model, we improve the general lower bound to 1.414, while showing a tight bound of 1.434 for the special case of queue size 2. We prove that the bounded delay model with uniform delay 2 is equivalent to a modified FIFO preemptive model with queue size 2. We then give improved upper and lower bounds on the 2-uniform bounded delay model. We also show an improved lower bound of 1.618 for the 2-variable bounded delay model, matching the previously known upper bound.