1 Robust Transport Protocol for Dynamic High-Speed Networks: enhancing XCP approach Dino M. Lopez Pacheco INRIA RESO/LIP, ENS of Lyon, France Congduc Pham.

Slides:



Advertisements
Similar presentations
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Advertisements

Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 1 Department of Information Engineering University of Pisa Network Telecomunication.
1 TCP Vegas: New Techniques for Congestion Detection and Avoidance Lawrence S. Brakmo Sean W. O’Malley Larry L. Peterson Department of Computer Science.
Congestion Control Reasons: - too many packets in the network and not enough buffer space S = rate at which packets are generated R = rate at which receivers.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
1 End to End Bandwidth Estimation in TCP to improve Wireless Link Utilization S. Mascolo, A.Grieco, G.Pau, M.Gerla, C.Casetti Presented by Abhijit Pandey.
Router-assisted congestion control Lecture 8 CS 653, Fall 2010.
Improving TCP Performance over MANETs by Exploiting Cross-Layer Information Awareness Xin Yu NYU Presented by: David Choffnes.
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
Congestion Control An Overview -Jyothi Guntaka. Congestion  What is congestion ?  The aggregate demand for network resources exceeds the available capacity.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
School of Information Technologies TCP Congestion Control NETS3303/3603 Week 9.
On Modeling Feedback Congestion Control Mechanism of TCP using Fluid Flow Approximation and Queuing Theory  Hisamatu Hiroyuki Department of Infomatics.
An Implementation and Experimental Study of the eXplicit Control Protocol (XCP) Yongguang Zhang and Tom Henderson INFOCOMM 2005 Presenter - Bob Kinicki.
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
Congestion Control Tanenbaum 5.3, /12/2015Congestion Control (A Loss Based Technique: TCP)2 What? Why? Congestion occurs when –there is no reservation.
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
WebTP: Protocol Design Issues Jeng Lung & Yogesh Bhumralkar.
1 Chapter 3 Transport Layer. 2 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4.
TCP in Heterogeneous Network Md. Ehtesamul Haque # P.
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
Congestion Control for High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs.
Ns Simulation Final presentation Stella Pantofel Igor Berman Michael Halperin
Introduction 1 Lecture 14 Transport Layer (Congestion Control) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science.
TCP: flow and congestion control. Flow Control Flow Control is a technique for speed-matching of transmitter and receiver. Flow control ensures that a.
Courtesy: Nick McKeown, Stanford 1 TCP Congestion Control Tahir Azim.
Transport Layer 4 2: Transport Layer 4.
Principles of Congestion Control Congestion: informally: “too many sources sending too much data too fast for network to handle” different from flow control!
UDT: UDP based Data Transfer Protocol, Results, and Implementation Experiences Yunhong Gu & Robert Grossman Laboratory for Advanced Computing / Univ. of.
B 李奕德.  Abstract  Intro  ECN in DCTCP  TDCTCP  Performance evaluation  conclusion.
U Innsbruck Informatik - 1 CADPC/PTP in a nutshell Michael Welzl
High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.
Contents Causes and cost of congestion Three examples How to handle congestion End-to-end Network-assisted TCP congestion control ATM ABR congestion control.
HighSpeed TCP for High Bandwidth-Delay Product Networks Raj Kettimuthu.
Congestion Control for High Bandwidth-Delay Product Networks D. Katabi (MIT), M. Handley (UCL), C. Rohrs (MIT) – SIGCOMM’02 Presented by Cheng.
Transport Layer 3-1 Chapter 3 Transport Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
Thoughts on the Evolution of TCP in the Internet (version 2) Sally Floyd ICIR Wednesday Lunch March 17,
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
PCP: Efficient Endpoint Congestion Control NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of Washington.
An SSCOP-based Link Layer Protocol for Wireless LANs Haoli Wang and Aravind Velayutham IEEE Global Telecommunications Conference 1-5 December, 2003 San.
Winter 2008CS244a Handout 71 CS244a: An Introduction to Computer Networks Handout 7: Congestion Control Nick McKeown Professor of Electrical Engineering.
1 Computer Networks Congestion Avoidance. 2 Recall TCP Sliding Window Operation.
Congestion Avoidance and Control Van Jacobson and Michael Karels Presented by Sui-Yu Wang.
Winter 2003CS244a Handout 71 CS492B Project #2 TCP Tutorial # Jin Hyun Ju.
Random Early Detection (RED) Router notifies source before congestion happens - just drop the packet (TCP will timeout and adjust its window) - could make.
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
1/12 WiSE: A Novel Efficient Transport Protocol for Wireless Networks Roberta Fracchia Joint work with C. Casetti, C. Chiasserini, M. Meo.
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
Peer-to-Peer Networks 13 Internet – The Underlay Network
2005/12/14 1 Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness Xin Yu Department of Computer Science.
Performance Evaluation of L3 Transport Protocols for IEEE (2 nd round) Richard Rouil, Nada Golmie, and David Griffith National Institute of Standards.
@Yuan Xue A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their.
@Yuan Xue A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their.
Distributed Systems 11. Transport Layer
Internet Networking recitation #9
Chapter 3 outline 3.1 transport-layer services
CUBIC Marcos Vieira.
Transport Protocols over Circuits/VCs
Generalizing The Network Performance Interference Problem
TCP Congestion Control
So far, On the networking side, we looked at mechanisms to links hosts using direct linked networks and then forming a network of these networks. We introduced.
Internet Networking recitation #10
CS4470 Computer Networking Protocols
Congestion Control Reasons:
TCP Congestion Control
TCP Overview.
Review of Internet Protocols Transport Layer
Presentation transcript:

1 Robust Transport Protocol for Dynamic High-Speed Networks: enhancing XCP approach Dino M. Lopez Pacheco INRIA RESO/LIP, ENS of Lyon, France Congduc Pham LIUPPA, University of Pau, France MICC-ICON 2005

2 Variable bandwidth environment networks ● In High-Speed networks, the available best-effort bandwidth can vary over time for many reasons: – non regulated flows (UDP). – QoS Mechanisms. – Resources reservation.

3 Transport control protocols At the moment, there are many TCP versions to take advantage of the network resources, for example: ➔ TCP Vegas, FAST TCP ➔ TCP Westwood ➔ SCTP, HSTCP Other propositions very different from TCP, such as: ➔ CADPC/PTP ➔ XCP

4 The XCP Protocol ● XCP is a router-assisted solution (XCP routers) ● Routers can compute the available bandwidth by monitoring the input traffic rate I r, the output link capacity O r, and the persistent queue size Q.

5 The XCP Protocol (2) In this way: ● The feedback is computed by the XCP routers and sent back to the sender in the ACK packets. ● The sender receives the feedback and adds this value to his congestion window size. ● The sender does not make any assumption on the state of the network. This information is provided by the XCP routers. Therefore, XCP will be able to find the optimal congestion window size, even though the load of the network changes over time.

6 The simulation topology ● 1,..., 10 XCP senders/receivers. ● 2 routers (R1, R2). ● 200Mb – 1Gb of link capacity ● Classical dumpbell topology. ● 17 UDP senders/receivers.

7 XCP in variable bandwidth environments (case 1) Very good performance

8 XCP in variable bandwidth environments (case 1) Very good performance Congestion window size evolution according to the available bandwidth

9 XCP in variable bandwidth environment (case 2) Good fairness and stability even in unfriendly environments

10 Loss of ACK packets in XCP networks The loss of packets is common in the networks. In the case of ACK losses inside of an XCP network: ● if the bandwidth does not vary over time, there is no problem because: ✔ when the throughput is very slow, the feedback will be large enough to get the maximum capacity. ✔ when the throughput is optimal, the loss of very small feedbacks will not have any effect. ● if the bandwidth varies over time, and the ACKs are lost when the bandwidth decreases, this losses will produce a wrong calculus in the sender's congestion window size, increasing the probability of data packets loss.

11 Timeouts introduced by the ACK loss (wrong cwnd value computed) Effects of a 30% ACK loss rate in the XCP network (1 flow)

12 Timeouts introduced by the ACK loss (wrong cwnd value computed) Effects of a 30% ACK loss rate in the XCP network (1 flow) Very important inactivity period (almost 5s)

13 Timeouts at 5s and 30s Effects of a 30% ACK loss rate in the XCP networks (3 flows)

14 Timeouts at 5s and 30s Effects of a 30% ACK loss rate in the XCP networks (3 flows) Unfairness and difficulty in restarting the connection

15 XCP-r, an approach to solve the problem Since the ACK losses produce a wrong calculus of the congestion window size in the sender, we have proposed to compute this value in the receiver and send it to the sender inside the ACK packets. We have called this approach XCP-r (XCP in the receiver)

16 Some technical aspects in XCP-r ● The receiver will create an equivalent variable to cwnd (cwnd') when a connection request will be received. ● The receiver will have to create one cwnd' for each connection established. ● After a congestion problem, if the sender modifies its congestion window size, it will notify the change and the receiver will update the cwnd’ variable.

17 XCP-r in variable bandwidth environments Without ACK packets losses, the simulations results are similar to XCP

18 XCP-r in variable bandwidth environments Without ACK packets losses, the simulations results are similar to XCP

19 very fast recovery after a timeout Effects of a 30% ACK loss rate in the XCP-r networks (1 flow)

20 very fast recovery after a timeout Effects of a 30% ACK loss rate in the XCP-r networks (1 flow) the inactivity period is almost negligible

21 Effects of a 30% ACK loss rate in the XCP-r networks (3 flow) Fast recovery after the timeouts problems Excellent fairness level

22 Effects of a 30% ACK loss rate in the XCP-r networks (3 flow) Fast recovery after the timeouts problems No timeout registered Excellent fairness level

23 XCP and XCP-r in a High Speed Network (12% ACK loss rate) Small changes in the bandwidth can introduce many problems in XCP

24 XCP and XCP-r in a High Speed Network (12% ACK loss rate) Small changes in the bandwidth can introduce many problems in XCP XCP-r remarkably improves the performance!

25 Conclusion XCP is a promising router-assisted approach for high- speed networks, but : ➢ The high dependence of the information contained in the ACK could make XCP very unstable in very dynamic high speed networks. XCP-r diminishes this problem ➢ It provides a high level of performance in dynamic high speed networks. ➢ Suitable in very high-speed networking infrastructures like computational grids.