10 - TCP reliable data transfer

10 - TCP reliable data transfer - Last Lecture Overview of...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Last Lecture Overview of the transport layer Principles of Reliable Data Transfers Error detection/correction ACK/NACK & retransmission (ARQ) Timeout Sequence numbers Sliding window protocols Go back N Selective repeat Problems not addressed yet Delayed duplicates Timeout estimation SUNY at Buffalo; CSE 489/589 – Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This Lecture How TCP Actually Works Reliable and efficient data transfer Next lecture Connection management Flow control Congestion control will be addressed separately SUNY at Buffalo; CSE 489/589 – Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 2
Background image of page 2
TCP Evolution SUNY at Buffalo; CSE 489/589 – Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 3 1975 1980 1985 1990 1982 TCP & IP RFC 793 & 791 1974 TCP described by Vint Cerf and Bob Kahn In IEEE Trans Comm 1983 BSD Unix 4.2 supports TCP/IP 1984 Nagel’s algorithm to reduce overhead of small packets; predicts congestion collapse 1987 Karn’s algorithm to better estimate round-trip time 1986 Congestion collapse observed 1988 Van Jacobson’s algorithms congestion avoidance and congestion control ( most implemented in 4.3BSD Tahoe ) 1990 4.3BSD Reno fast retransmit delayed ACK’s 1975 Three-way handshake Raymond Tomlinson In SIGCOMM 75 Reno is the “least common denominator”
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
TCP Evolution This history is incomplete (see website & RFC 4614 for more links) Not all implementations implement all these features We won’t be able to cover every feature, only most common ones SUNY at Buffalo; CSE 489/589 – Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 4 1993 1994 1996 1994 ECN (Floyd) Explicit Congestion Notification 1993 TCP Vegas (Brakmo et al) delay-based congestion avoidance 1994 T/TCP (Braden) Transaction TCP 1996 SACK TCP (Floyd et al) Selective Acknowledgement 1996 Hoe NewReno startup and loss recovery 1996 FACK TCP (Mathis et al) extension to SACK
Background image of page 4
Tips and Tricks Why TCP Tahoe, TCP Reno? SUNY at Buffalo; CSE 489/589 – Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 5
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Answer TCP Tahoe : TCP implementation from 4.3BSD-Tahoe (released in June 1988) The name Tahoe came from the development name used by Computer Consoles, Incorporated, for the machine that they eventually released as the Power 6/32. Computer Consoles gave CSRG a few machines to develop cross-platform BSD TCP Reno : TCP implementation from 4.3BSD-Reno (released in 1988) The release was named after a big gambling city in Nevada as an oblique reminder to its recipients that running the interim release was a bit of a gamble. SUNY at Buffalo; CSE 489/589 – Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 6
Background image of page 6
TCP Overview 1. Multiplexing and Demultiplexing 2. Byte-stream service Stream of bytes sent and received, not stream of packets 3.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 33

10 - TCP reliable data transfer - Last Lecture Overview of...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online