A survey and measurement-based comparison of bandwidth management techniques

This article gives a brief tutorial for bandwidth management systems; a survey of the techniques used by eight real-world systems, such as class-based queuing (CBQ), per-flow queuing (PFQ), random early detection (RED), and TCP rate control (TCR); a compact testbed with a set of methodologies to differentiate the employed techniques; and a detailed black-box evaluation. The tutorial describes the needs for the three types of policy rules: class-based bandwidth limitation, session-bandwidth guarantee, and inter/intra-class bandwidth borrowing. The survey portion investigates how the eight chosen commercial/open-source real systems enforce the three policy types. To evaluate the techniques, the designed testbed emulates real-life Internet conditions, such as many simultaneous sessions from different IPs/ports, controllable wide area network (WAN) delay and packet loss rate for each session, and different TCP source implementations. The performance metrics include accuracy of bandwidth management, fairness among sessions, robustness under Internet packet losses and different operating systems, inter/intra-class bandwidth borrowing, and voice over IP (VoIP) quality. The black-box test results demonstrate that (1) only the combination of CBQ+PFQ+TCR can solve the most difficult scenario (multiple sessions competing for the narrow 20kb/s class); (2) the TCR approach may degrade the goodput, fairness, and compatibility even under slight packet loss rates (0.5 percent); (3) without PFQ, TCR and RED have limited ability to isolate the sessions (especially for RED); (4) the G.729 VoIP quality over a 125kb/s access link becomes good only after exercising MSS-clamping to shrink the packet size of the background traffic down to 256 byte.

[1]  Ying-Dar Lin,et al.  Open Source Software Development: An Overview , 2001, Computer.

[2]  Vern Paxson,et al.  TCP Congestion Control , 1999, RFC.

[3]  Scott O. Bradner,et al.  Benchmarking Methodology for Network Interconnect Devices , 1999, RFC.

[4]  David Newman,et al.  Benchmarking Terminology for Firewall Performance , 1999, RFC.

[5]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[6]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

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

[8]  Shivkumar Kalyanaraman,et al.  TCP rate control , 2000, CCRV.

[9]  Bruce S. Davie,et al.  Computer Networks: A System Approach , 1998, IEEE Communications Magazine.

[10]  Anujan Varma,et al.  Hardware implementation of fair queuing algorithms for asynchronous transfer mode networks , 1997 .

[11]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[12]  Scott O. Bradner,et al.  Benchmarking Terminology for Network Interconnection Devices , 1991, RFC.

[13]  Deborah Estrin,et al.  Recommendations on Queue Management and Congestion Avoidance in the Internet , 1998, RFC.

[14]  W. Richard Stevens,et al.  TCP/IP Illustrated, Volume 1: The Protocols , 1994 .

[15]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[16]  I. Damgård,et al.  The protocols. , 1989, The New Zealand nursing journal. Kai tiaki.