Fairness Analysis in Competitive FIFO Buffer Management

Motivated by providing differentiated services on the Internet, we consider efficient algorithms for buffer management in quality-of-service (QoS) routers. We study a FIFO buffering model with fairness constraint, in which packets have values to represent their priorities. The order of packets being sent complies with the order of their arriving time. Fairness is enforced such that the dropping rate of a higher- priority traffic class should not be much higher than that of a lower-priority traffic class by a factor of their values' ratio. Our objective is to maximize the total value of the packets sent. In this paper, we design both offline and online fair FIFO buffering algorithms. We first give a polynomial- time optimal offline algorithm. Then we discuss the fairness of a family of online algorithms and prove that all previously developed FIFO buffering algorithms do not guarantee fairness. For online algorithms, we use competitiveness to measure their performance against the worst-case scenarios. At last, we provide a fair online algorithm with a constant competitive ratio for the two traffic classes model. Our online algorithm is the first attempt to address the fairness concern in a competitive FIFO queue. It safeguards QoS guarantees and makes no stochastic assumptions on the input packet sequences.

[1]  Parameswaran Ramanathan,et al.  Proportional differentiated services: delay differentiation and packet scheduling , 2002, TNET.

[2]  Yishay Mansour,et al.  Competitive queueing policies for QoS switches , 2003, SODA '03.

[3]  Matthias Englert,et al.  Lower and Upper Bounds on FIFO Buffer Management in QoS Switches , 2006, ESA.

[4]  Murad S. Taqqu,et al.  On the Self-Similar Nature of Ethernet Traffic , 1993, SIGCOMM.

[5]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[6]  Donald F. Towsley,et al.  On achievable service differentiation with token bucket marking for TCP , 2000, SIGMETRICS '00.

[7]  Fei Li,et al.  Better online buffer management , 2007, SODA '07.

[8]  Fei Li,et al.  An optimal online algorithm for packet scheduling with agreeable deadlines , 2005, SODA '05.

[9]  Boaz Patt-Shamir,et al.  Nearly optimal FIFO buffer management for DiffServ , 2002, PODC '02.

[10]  Baruch Schieber,et al.  Further Improvements in Competitive Guarantees for QoS Buffering , 2004, ICALP.

[11]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[12]  Yishay Mansour,et al.  Improved Competitive Guarantees for QoS Buffering , 2003, Algorithmica.

[13]  Boaz Patt-Shamir,et al.  Optimal smoothing schedules for real-time streams , 2004, PODC '00.

[14]  Yishay Mansour,et al.  Competitive queue policies for differentiated services , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[15]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[16]  Nicolas Christin,et al.  A QoS architecture for quantitative service differentiation , 2003, IEEE Commun. Mag..

[17]  Vasilios A. Siris,et al.  Adaptive packet marking for achieving fairness in DiffServ networks , 2005, Comput. Commun..

[18]  Roch Guérin,et al.  A simple FIFO-based scheme for differentiated loss guarantees , 2007, Comput. Networks.

[19]  Boaz Patt-Shamir,et al.  Buffer Overflow Management in QoS Switches , 2004, SIAM J. Comput..

[20]  Konstantinos Psounis,et al.  CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[21]  V. Paxson,et al.  WHERE MATHEMATICS MEETS THE INTERNET , 1998 .

[22]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.