Effect of Higher Priority EF Traffic and TCP Throughput and Fairness

In this paper, we study the effect on TCP of assigning higher-priority to traffice requesting Expedited Forwarding (EF) service in a Differentiated Services network. We analyze networks in which (1) EF traffice occupies different fractions of link bandwidth and is bursty at different time-scales; and (2) multiple TCP flows with heterogeneous round trip times share the network with the EF traffic. We find that even in the presence of bursty EF traffic, statistical multiplexing gains allow TCP to utilize most of the available bandwidth. Further, the presence of bursty EF traffic improves the fairness of bandwidth allocation among TCP flows; smaller more frequent bursts yield larger improvements in TCP fairness.

[1]  Scott Shenker,et al.  Some observations on the dynamics of a congestion control algorithm , 1990, CCRV.

[2]  T. V. Lakshman,et al.  The performance of TCP/IP for networks with high bandwidth-delay products and random loss , 1997, TNET.

[3]  ZhangLixia,et al.  Some observations on the dynamics of a congestion control algorithm , 1990 .

[4]  Antonio DeSimone,et al.  Generating burstiness in networks: a simulation study of correlation effects in networks of queues , 1991, CCRV.

[5]  Van Jacobson,et al.  An Expedited Forwarding PHB , 1999, RFC.

[6]  Matthew Mathis,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

[7]  Van Jacobson,et al.  Traffic phase effects in packet-switched gateways , 1991, CCRV.

[8]  S. Floyd,et al.  Tcp-friendly unicast rate-based flow control , 1997 .

[9]  Van Jacobson,et al.  A Two-bit Differentiated Services Architecture for the Internet , 1999, RFC.

[10]  Srinivasan Keshav,et al.  On CBR service , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[11]  David L. Black,et al.  Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers , 1998, RFC.

[12]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[13]  kc claffy.  Internet measurement and data analysis: topology, workload, performance and routing statistics , 1999 .

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

[15]  T. V. Lakshman,et al.  TCP over wireless with link level error control: analysis and design methodology , 1999, TNET.

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

[17]  Jorma T. Virtamo,et al.  The superposition of periodic cell arrival streams in an ATM multiplexer , 1991, IEEE Trans. Commun..

[18]  Sally Floyd,et al.  Simulation-based comparisons of Tahoe, Reno and SACK TCP , 1996, CCRV.

[19]  Scott Shenker,et al.  Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM '91.

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

[21]  FloydSally,et al.  Simulation-based comparisons of Tahoe, Reno and SACK TCP , 1996 .

[22]  SemkeJeffrey,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997 .

[23]  Sally Floyd,et al.  TCP Selective Acknowledgement Options , 1996 .

[24]  Larry L. Peterson,et al.  TCP Vegas: new techniques for congestion detection and avoidance , 1994 .