Protection Mechanisms for Well-behaved TCP Flows from Tampered-TCP at Edge Routers

In this paper, we propose a new mechanism which detects tampered-TCP connections at edge routers and protects well-behaved TCP connections from the tampered-TCP connections, resulting in maintaining the fairness amongst TCP connections. The proposed mechanism monitors the TCP packets at an edge router and estimates the window size or the throughput for each TCP connection. By using estimation results, the proposed mechanism assesses whether each TCP connection is tampered or not and drops packets intentionally if necessary to improve the fairness amongst TCP connections. From the results of simulation experiments, we exhibit that the proposed mechanism can accurately identify tampered-TCP connections. We also show that the proposed mechanism can regulate throughput ratio between tampered-TCP connections and competing TCP Reno connections to about 1.

[1]  Sally Floyd,et al.  Router Mechanisms to Support End-to-End Congestion Control , 2007 .

[2]  Terrance E. Boult,et al.  HPPD: A Hop-count Probabilistic Packet Dropper , 2006, 2006 IEEE International Conference on Communications.

[3]  Michèle Basseville,et al.  Detection of abrupt changes: theory and application , 1993 .

[4]  Sally Floyd,et al.  On inferring TCP behavior , 2001, SIGCOMM.

[5]  Peter Phaal,et al.  InMon Corporation's sFlow: A Method for Monitoring Traffic in Switched and Routed Networks , 2001, RFC.

[6]  Stefan Savage,et al.  TCP congestion control with a misbehaving receiver , 1999, CCRV.

[7]  Yang Richard Yang,et al.  General AIMD congestion control , 2000, Proceedings 2000 International Conference on Network Protocols.

[8]  Donald F. Towsley,et al.  Inferring TCP connection characteristics through passive measurements , 2004, IEEE INFOCOM 2004.

[9]  Sally Floyd,et al.  On inferring TCP behavior , 2001, SIGCOMM 2001.

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

[11]  Donald F. Towsley,et al.  Modeling TCP Reno performance: a simple model and its empirical validation , 2000, TNET.

[12]  Sven Jaap,et al.  TCP-friendly Rate Control (TFRC) , 2004 .

[13]  Lili Wang,et al.  A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP , 2003, RFC.

[14]  C. Dovrolis,et al.  Proportional differentiated services, part II: loss rate differentiation and packet dropping , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[15]  Hao Jiang,et al.  Passive estimation of TCP round-trip times , 2002, CCRV.

[16]  Kostas Pentikousis,et al.  Quantifying the deployment of TCP options - a comparative study , 2004, IEEE Communications Letters.

[18]  Xiaoyuan Gu.  Tcp-friendly Rate Control (tfrc) , 2004 .

[19]  Xing Li,et al.  On the correspondency between TCP acknowledgment packet and data packet , 2003, IMC '03.

[20]  Marco Mellia,et al.  Measuring IP and TCP behavior on edge nodes with Tstat , 2005, Comput. Networks.

[21]  Marshall T. Rose,et al.  Management Information Base for network management of TCP/IP-based internets , 1990, RFC.

[22]  Moti Yung,et al.  Idiosyncratic Signatures for Authenticated Execution of Management Code , 2003, DSOM.

[23]  Kang Li,et al.  New Methods for Passive Estimation of TCP Round-Trip Times , 2005, PAM.

[24]  Jörg Widmer,et al.  TCP Friendly Rate Control (TFRC): Protocol Specification , 2003, RFC.