Revisiting the fair queuing paradigm for end-to-end congestion control
Tóm tắt
Today, the dominant paradigm for congestion control in the Internet is based on the notion of TCP friendliness. To be TCP-friendly, a source must behave in such a way as to achieve a bandwidth that is similar to the bandwidth obtained by a TCP flow that would observe the same round-trip time (RTT) and the same loss rate. However, with the success of the Internet comes the deployment of an increasing number of applications that do not use TCP as a transport protocol. These applications can often improve their own performance by not being TCP-friendly, which severely penalizes TCP flows. To design new applications to be TCP-friendly is often a difficult task. The idea of the fair queuing (FQ) paradigm as a means to improve congestion control was first introduced by Keshav (1991). While Keshav made a fundamental step toward a new paradigm for the design of congestion control protocols, he did not formalize his results so that his findings could be extended for the design of new congestion control protocols. We make this step and formally define the FQ paradigm as a paradigm for the design of new end-to-end congestion control protocols. This paradigm relies on FQ scheduling with per-flow scheduling and longest queue drop buffer management in each router. We assume only selfish and noncollaborative end users. Our main contribution is the formal statement of the congestion control problem as a whole, which enables us to demonstrate the validity of the FQ paradigm. We also demonstrate that the FQ paradigm does not adversely impact the throughput of TCP flows and explain how to apply the FQ paradigm for the design of new congestion control protocols. As a pragmatic validation of the FQ paradigm, we discuss a new multicast congestion control protocol called packet pair receiver-driven layered multicast (PLM).
Từ khóa
#Throughput #Internet #Bandwidth #Multicast protocols #Equations #Collaboration #Size control #Loss measurement #Transport protocols #Forward error correctionTài liệu tham khảo
10.1109/90.266050
servetto, 2000, video multicast over fair queuing networks, Proc ICIP 00
10.1109/65.484227
rhee, 1998, mtcp: scalable tcp-like congestion control for reliable multicast, Tech Rep
10.1109/INFCOM.1998.662909
10.1145/357401.357402
10.1109/65.690972
keshav, 1991, Congestion control in computer networks
bennett, 1996, wf2q: worst-case fair weighted fair queuing, Proc IEEE INFOCOM 96, 120, 10.1109/INFCOM.1996.497885
10.1109/INFCOM.1998.659666
10.1145/190314.190319
parekh, 1993, a generalized processor sharing approach to flow control in integrated services networks, IEEE Proc INFOCOM 93, 521, 10.1109/INFCOM.1993.253322
10.1038/sj.jors.2600523
10.1145/75246.75248
golestani, 1998, end-to-end congestion control for the internet: a global optimization framework, Proc 6th Int l Conf Net Protocols, 137, 10.1109/ICNP.1998.723734
stevens, 1997, tcp slowstart, congestion avoidance, fast retransmit, and fast recovery algorithms, IETF
legout, 2000, pathological behaviors for rlm and rlc, Proc NOSSDAV 00, 164
10.1145/52324.52356
10.1109/90.793002
10.1109/INFCOM.1999.752152
ott, 1996, the stationay distribution of ideal tcp congestion avoidance, Tech Rep
bolot, 1999, adaptive fec-based error control for internet telephony, Proc IEEE INFOCOM 99, 1453, 10.1109/INFCOM.1999.752166
10.1145/285243.285291
10.1109/TCOM.1987.1096782
10.1109/49.611154
10.1145/1024908.1024910
10.1109/90.649568
10.1109/35.668286
10.1109/49.103550
ns, 0, UCB/LBNL/VINT Network Simulator — ns, 2
10.1109/GLOCOM.1996.586131
10.1145/339331.339340
rodriguez, 1998, distributing frequently-changing documents in the web: multicasting or hierarchical caching, Comp Nets and ISDN Sys, 2223, 10.1016/S0169-7552(98)00237-2