A Markovian Model for TCP Analysis in a Differentiated Services Network

In a Differentiated Services network, the use of TCP by an application impacts the service it gets from the network. TCP congestion control algorithms are designed to provide a fair sharing of resources in a best effort network as the current Internet. TCP is not conscious of the new services proposed by DiffServ, namely the different priorities packets are injected with into the network. Many schemes have been proposed to support TCP traffic in a DiffServ network. These schemes have been often validated with simulations. In this paper we propose an analytical model to study the performance of TCP in a DiffServ network under the different proposed schemes. The model is based on a Markovian fluid approach. We present first a general version of the model, then we specify it to the different proposed schemes. For each scheme, we compute the throughput achieved by a TCP connection. We compare then the service differentiation provided by the proposed schemesunder different subscription levels, different reservations, and different round-trip times. Our model forms a good tool for the evaluation of new solutions to support TCP traffic in a DiffServ network.

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

[2]  Eitan Altman,et al.  TCP in presence of bursty losses , 2000, SIGMETRICS '00.

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

[4]  Zheng Wang,et al.  A Comparative Study of Schemes for Differentiated Services , 1998 .

[5]  W. Stevens,et al.  Congestion Avoidance, Fast Retransmit and Fast Recovery Algorithm , 1997 .

[6]  Kang G. Shin,et al.  Adaptive packet marking for providing differentiated services in the Internet , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).

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

[8]  Chadi Barakat,et al.  A stochastic model of TCP/IP with stationary random losses , 2000, TNET.

[9]  Eitan Altman,et al.  A stochastic model of TCP/IP with stationary random losses , 2000, SIGCOMM.

[10]  A. L. Narasimha Reddy,et al.  Modeling TCP behavior in a differentiated services network , 2001, TNET.

[11]  W. Richard Stevens,et al.  TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms , 1997, RFC.

[12]  C. Barakat.  TCP/IP modeling and validation , 2001 .

[13]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[14]  Fred Baker,et al.  Assured Forwarding PHB Group , 1999, RFC.

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

[16]  Roch Guérin,et al.  A Two Rate Three Color Marker , 1999, RFC.

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

[18]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

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

[20]  A. L. Narasimha Reddy,et al.  Realizing throughput guarantees in a differentiated services network , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[21]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[22]  Dilip D. Kandlur,et al.  Adaptive packet marking for maintaining end-to-end throughput in a differentiated-services internet , 1999, TNET.

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

[24]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[25]  K. Shin,et al.  Understanding TCP dynamics in a di erentiated services internet , 1999 .

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