Generalized TCP congestion avoidance and its effect on bandwidth sharing and variability

To model possible suggested changes in TCP window adaptation in response to randomized feedback, such as ECN (explicit congestion notification), we formulate a generalized version of the TCP congestion avoidance algorithm. We first consider multiple such generalized TCP flows sharing a bottleneck buffer under the assured service model and use a fixed point technique to obtain the mean window sizes and throughputs for the TCP flows, To further study how changes in the adaptation algorithm affect the variability in the throughput, we use an analytical-cum-numerical technique to derive the window distribution (and related statistics) of a single generalized flow under state-dependent randomized congestion feedback.

[1]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[2]  Sally Floyd,et al.  Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic , 1991, CCRV.

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

[4]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[5]  V. Jacobson.  Congestion avoidance and control , 1988, CCRV.

[6]  Mischa Schwartz,et al.  Broadband integrated networks , 1996 .

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

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

[9]  David D. Clark,et al.  Explicit allocation of best-effort packet delivery service , 1998, TNET.

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

[11]  Zheng Wang.  USD: Scalable Bandwidth Allocation for the Internet , 1998, HPN.

[12]  K. K. Ramakrishnan,et al.  A Proposal to add Explicit Congestion Notification (ECN) to IP , 1999, RFC.

[13]  Archan Misra,et al.  The window distribution of multiple TCPs with random loss queues , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[14]  Archan Misra,et al.  The window distribution of idealized TCP congestion avoidance with variable packet loss , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).