TCP Enhancement for Random Loss Jiang Wu Computer Science Lakehead University.

Slides:



Advertisements
Similar presentations
The Transmission Control Protocol (TCP) carries most Internet traffic, so performance of the Internet depends to a great extent on how well TCP works.
Advertisements

Assume that a file is transferred from a node A to a node B. The file has been fragmented in 5 frames. Frame 0 is corrupted, the ACK of frame 1 is corrupted,
Channel Allocation Protocols. Dynamic Channel Allocation Parameters Station Model. –N independent stations, each acting as a Poisson Process for the purpose.
Transport Layer – TCP (Part2) Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
Restricted Slow-Start for TCP William Allcock 1,2, Sanjay Hegde 3 and Rajkumar Kettimuthu 1,2 1 Argonne National Laboratory 2 The University of Chicago.
Performance Improvement of TCP in Wireless Cellular Network Based on Acknowledgement Control Osaka University Masahiro Miyoshi, Masashi Sugano, Masayuki.
Congestion Control Tanenbaum 5.3, /12/2015Congestion Control (A Loss Based Technique: TCP)2 What? Why? Congestion occurs when –there is no reservation.
1 Lecture 10: TCP Performance Slides adapted from: Congestion slides for Computer Networks: A Systems Approach (Peterson and Davis) Chapter 3 slides for.
1 689 Lecture 2 Review of Last Lecture Networking basics TCP/UDP review.
1 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, TCP Increase/Decrease.
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
Congestion Avoidance and Control Van Jacobson Jonghyun Kim April 1, 2004.
A Real-Time Video Multicast Architecture for Assured Forwarding Services Ashraf Matrawy, Ioannis Lambadaris IEEE TRANSACTIONS ON MULTIMEDIA, AUGUST 2005.
Performance Enhancement of TFRC in Wireless Ad Hoc Networks Travis Grant – Mingzhe Li, Choong-Soo Lee, Emmanuel.
Performance Enhancement of TFRC in Wireless Ad Hoc Networks Mingzhe Li, Choong-Soo Lee, Emmanuel Agu, Mark Claypool and Bob Kinicki Computer Science Department.
On Efficient On-line Grouping of Flows with Shared Bottlenecks at Loaded Servers by O. Younis and S. Fahmy Department of Computer Sciences, Purdue University.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
ACN: Congestion Control1 Congestion Control and Resource Allocation.
TCP with Adaptive Pacing for Multihop Wireless Networks Sherif M. EIRakabawy, Alexander Klemm, Christoph Lindemann University of Dortmund Germany Proceedings.
1 K. Salah Module 6.1: TCP Flow and Congestion Control Connection establishment & Termination Flow Control Congestion Control QoS.
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
TCP: flow and congestion control. Flow Control Flow Control is a technique for speed-matching of transmitter and receiver. Flow control ensures that a.
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.
A Simulation of Adaptive Packet Size in TCP Congestion Control Zohreh Jabbari.
COMT 4291 Communications Protocols and TCP/IP COMT 429.
CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.
An End-to-end Approach to Increase TCP Throughput Over Ad-hoc Networks Sarah Sharafkandi and Naceur Malouch.
CS/EE 145A Congestion Control Netlab.caltech.edu/course.
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
Wireless TCP Prasun Dewan Department of Computer Science University of North Carolina
B 李奕德.  Abstract  Intro  ECN in DCTCP  TDCTCP  Performance evaluation  conclusion.
Chapter 12 Transmission Control Protocol (TCP)
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
CS 164: Slide Set 2: Chapter 1 -- Introduction (continued).
ECE 8990 Advanced Computer Network SystemsMississippi State University Comparison of TCP SACK and TCP Peach Sriram Rajan Vijaykumar Rajaram.
Transport Layer3-1 TCP throughput r What’s the average throughout of TCP as a function of window size and RTT? m Ignore slow start r Let W be the window.
AQM & TCP models Courtesy of Sally Floyd with ICIR Raj Jain with OSU.
1 Capacity Dimensioning Based on Traffic Measurement in the Internet Kazumine Osaka University Shingo Ata (Osaka City Univ.)
Transport Layer 3-1 Chapter 3 Transport Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March
1. Introduction REU 2006-Packet Loss Distributions of TCP using Web100 Zoriel M. Salado, Mentors: Dr. Miguel A. Labrador and Cesar D. Guerrero 2. Methodology.
Deadline-based Resource Management for Information- Centric Networks Somaya Arianfar, Pasi Sarolahti, Jörg Ott Aalto University, Department of Communications.
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.
Winter 2008CS244a Handout 81 CS244a: An Introduction to Computer Networks Handout 8: Congestion Avoidance and Active Queue Management Nick McKeown Professor.
We used ns-2 network simulator [5] to evaluate RED-DT and compare its performance to RED [1], FRED [2], LQD [3], and CHOKe [4]. All simulation scenarios.
1 Computer Networks Congestion Avoidance. 2 Recall TCP Sliding Window Operation.
Advance Computer Networks Lecture#09 & 10 Instructor: Engr. Muhammad Mateen Yaqoob.
Internet and Intranet Protocols and Applications The Internet: Delay, Errors, Detection February, 2002 Joseph Conron Computer Science Department New York.
Random Early Detection (RED) Router notifies source before congestion happens - just drop the packet (TCP will timeout and adjust its window) - could make.
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
Transport Layer: Sliding Window Reliability
1 Advanced Transport Protocol Design Nguyen Multimedia Communications Laboratory March 23, 2005.
Spring Computer Networks1 Congestion Control Sections 6.1 – 6.4 Outline Preliminaries Queuing Discipline Reacting to Congestion Avoiding Congestion.
Peer-to-Peer Networks 13 Internet – The Underlay Network
Congestion Avoidance Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
TCP as a Reliable Transport. How things can go wrong… Lost packets Corrupted packets Reordered packets …Malicious packets…
Transmission Control Protocol (TCP) TCP Flow Control and Congestion Control CS 60008: Internet Architecture and Protocols Department of CSE, IIT Kharagpur.
PAC: Perceptive Admission Control for Mobile Wireless Networks Ian D. Chakeres Elizabeth M. Belding-Royer.
Bandwidth estimation: metrics, measurement techniques, and tools Presenter: Yuhang Wang.
A Bidirectional Multi-channel MAC Protocol for Improving TCP Performance on Multihop Wireless Ad Hoc Networks Tianbo Kuang and Carey Williamson Department.
Other Methods of Dealing with Congestion
Window Control Adjust transmission rate by changing Window Size
A Stochastic Model for TCP with Stationary Random Losses
Generalizing The Network Performance Interference Problem
Other Methods of Dealing with Congestion
FAST TCP : From Theory to Experiments
CSE 4213: Computer Networks II
Queueing Problem The performance of network systems rely on different delays. Propagation/processing/transmission/queueing delays Which delay is affected.
Designing a Relative Delay Estimator for Multipath Transport
Presentation transcript:

TCP Enhancement for Random Loss Jiang Wu Computer Science Lakehead University

Content TCP Issue Queueing Model Model Analysis Enhancement Proposal Conclusion

TCP Issue TCP ref[1], [3] Congestion control algorithm Reduce transmission rate whenever packet loss occurs Issue ref[4] Don’t distinguish between congestion and random loss Take incorrect action to random losses Suffer performance degradation in wireless network

Queueing Model ref[5] TCP Sender Router Buffer Queueing System TCP Receiver Router Some parameter of the queueing system: Queueing delay: the time a packet takes waiting in the queue Transmission delay: the time the router takes to put a packet to the transmission channel Suppose the size of the packets is constant, the router can be modeled as an M/D/1 queue because: Packets arrive according to Poisson process Transmission delay is constant 1 server (Router) for the queue

M/D/1 Queue Properties ref[5] M/D/1 queue properties: Let the packet arrival rate to be, transmission delay to be, then the load of the link is defined as The expectation of the queueing delay The expectation of queue length Q is

M/D/1 Queue Characteristics

Calculate Queue Length Round Trip Time (RTT): The time period between a packet is sent by the sender and its ACK is received by the sender. It consists of: Queueing Delay, a random variable >= 0 Transmission delay Propagation delay: the time the packet travels on the line ACK delay: the time the ACK travels from the receiver to the sender RTTmin : The minimum RTT observed by the sender Calculate the load ( is unknown yet)

Get Transmission Delay Packet pairs in TCP ref[1], [3] Get transmission delay ref[1] A by-product: maximum bandwidth of the bottle link Calculate the parameters: Router SenderReceiver (All parameter is known now)

Detect the Congestion Throughput: new packets received by receiver in unit time The knee occurs when the average queue length is one ref[2]  Ref[2]

Enhancement Proposal Enhancement to TCP Detect the minimum RTT When there are 2 packets ready to be sent, send them back-to- back, and measure the space between the ACK Calculate the load When a packet loss occurs when, don’t lower the transmission rate Anticipated result TCP performance will not degrade heavily due to transmission loss

Research Plan Design the enhancement algorithm Implement the enhancement Evaluate the performance improvement One paper before March 2004 Compare the performance to others One paper

Reference [1] V. Jacobson. Congestion avoidance and control. In ACM SIGCOMM '88, [2] K. Ramakrishnan and R. Jain, “Congestion avoidance in computer networks with a connectionless network layer” Tech. Rep., DEC, August [3] RFC2581 TCP Congestion Control [4] Pan, J.; Mark, J.W.; Shen, X. TCP performance and its improvement over wireless links. Globecom IEEE [5] Robert B. Cooper. Introduction To Queueing Theory. Second Edition North Holland, New York Oxford