Chapter 3 Transport Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete slides (including this one) and slide content to suit your needs. They obviously represent a lot of work on our part. In return for use, we only ask the following: If you use these slides (e.g., in a class) in substantially unaltered form, that you mention their source (after all, we d like people to use our book!) If you post any slides in substantially unaltered form on a www site, that you note that they are adapted from (or perhaps identical to) our slides, and note our copyright of this material. Thanks and enjoy! JFK/KWR Computer Networking: A Top Down Approach 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, April 2009. Chapter 3: Transport Layer Our goals: understand principles behind layer : multiplexing/ learn about layer protocols in the Internet: UDP: connectionless TCP: connectionoriented TCP All material copyright 1996-2009 J.F Kurose and K.W. Ross, All Rights Reserved Transport Layer 3-1 Transport Layer 3-2 Chapter 3 outline : UDP : TCP Transport and protocols provide logical communication between app processes running on different hosts protocols run in end systems send side: breaks app messages into segments, passes to layer rcv side: reassembles segments into messages, passes to app layer more than one protocol available to apps Internet: TCP and UDP Transport Layer 3-3 Transport Layer 3-4 1
Transport vs. layer Internet -layer protocols layer: logical communication between processes relies on, enhances, layer layer: logical communication between hosts Analogy: 12 kids sending letters to 12 kids processes = kids app messages = letters in envelopes hosts = houses protocol = Ann and Bill -layer protocol = postal service Reliable, in-order delivery (TCP) connection setup Unreliable, unordered delivery: UDP no-frills extension of best-effort IP Services not available: delay guarantees bandwidth guarantees Transport Layer 3-5 Transport Layer 3-6 Chapter 3 outline Transport vs. layer : UDP : TCP layer: logical communication between processes relies on, enhances, layer layer: logical communication between hosts Analogy: 12 kids sending letters to 12 kids processes = kids app messages = letters in envelopes hosts = houses protocol = Ann and Bill -layer protocol = postal service Transport Layer 3-7 Transport Layer 3-8 2
Multiplexing/ Multiplexing at send host: gathering data from multiple sockets, enveloping data with header (later used for ) link P3 P1 P1 link host 1 host 2 Demultiplexing at rcv host: delivering received segments to correct socket P2 = socket P4 = process host 3 link Transport Layer 3-9 How works host receives IP datagrams each datagram has source IP address, destination IP address each datagram carries 1 -layer segment each segment has source, destination port number host uses IP addresses & port numbers to direct segment to appropriate socket 32 bits source port # dest port # other header fields data (message) TCP/UDP segment format Transport Layer 3-10 Connectionless Connectionless demux (cont) Create sockets with port numbers: DatagramSocket mysocket1 = new DatagramSocket(12534); DatagramSocket mysocket2 = new DatagramSocket(12535); UDP socket identified by two-tuple: (dest IP address, dest port number) When host receives UDP segment: checks destination port number in segment directs UDP segment to socket with that port number IP datagrams with different source IP addresses and/or source port numbers directed to same socket Transport Layer 3-11 DatagramSocket serversocket = new DatagramSocket(6428); P2 client IP: A SP: 9157 DP: 6428 SP: 6428 DP: 9157 P: Port Number SP provides return address P3 server IP: C SP: 6428 DP: 5775 SP: 5775 DP: 6428 P1P1 Client IP:B Transport Layer 3-12 3
Connection-oriented demux Connection-oriented demux (cont) TCP socket identified by 4-tuple: source IP address source port number dest IP address dest port number receiving host uses all four values to direct segment to appropriate socket Server host may support many simultaneous TCP sockets: each socket identified by its own 4-tuple Web servers have different sockets for each connecting client non-persistent HTTP will have different socket for each request P1 client IP: A SP: 9157 DP: 80 S-IP: A D-IP:C P4 server IP: C P5 P6 P2 P1P3 SP: 5775 DP: 80 S-IP: B D-IP:C SP: 9157 DP: 80 S-IP: B D-IP:C Client IP:B Transport Layer 3-13 Transport Layer 3-14 Connection-oriented demux: Threaded Web Server Chapter 3 outline P1 client IP: A SP: 9157 DP: 80 S-IP: A D-IP:C P4 server IP: C SP: 5775 DP: 80 S-IP: B D-IP:C SP: 9157 DP: 80 S-IP: B D-IP:C P2 P1P3 Client IP:B : UDP : TCP Transport Layer 3-15 Transport Layer 3-16 4
UDP: User Datagram Protocol [RFC 768] UDP: more no-frills, bare bones Internet protocol best effort service, UDP segments may be: lost delivered out of order to app Connectionless: no handshaking between UDP sender, receiver each UDP segment handled independently of others Why is there a UDP? finer -level over what data is sent, and when. no connection establishment (which can add delay) simple: no connection state at sender, receiver small segment header no : UDP can blast away as fast as desired often used for streaming multimedia apps loss tolerant rate sensitive other UDP uses DNS SNMP reliable transfer over UDP: add reliability at layer -specific error recovery! Length, in bytes of UDP segment, including header source port # dest port # length 32 bits Application data (message) checksum UDP segment format Transport Layer 3-17 Transport Layer 3-18 UDP checksum Goal: detect errors (e.g., flipped bits) in transmitted segment Sender: treat segment contents as sequence of 16-bit integers checksum: addition (1 s complement sum) of segment contents sender puts checksum value into UDP checksum field Receiver: compute checksum of received segment check if computed checksum equals checksum field value: NO - error detected YES - no error detected. But maybe errors nonetheless? More later. Transport Layer 3-19 Internet Checksum Example Note When adding numbers, a carryout from the most significant bit needs to be added to the result Example: add two 16-bit integers wraparound sum checksum 1 1 1 1 0 0 1 1 0 0 1 1 0 0 1 1 0 1 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 0 0 1 0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 1 1 + + Transport Layer 3-20 5
Chapter 3 outline Principles of Reliable data transfer : UDP : TCP important in app.,, link layers top-10 list of important ing topics! characteristics of unreliable channel will determine complexity of protocol (rdt) Transport Layer 3-21 Transport Layer 3-22 Principles of Reliable data transfer Principles of Reliable data transfer Transport Layer 3-23 Transport Layer 3-24 6
Reliable data transfer: getting started Rdt1.0: reliable transfer over a reliable channel We ll: incrementally develop sender, receiver sides of protocol (rdt) consider only unidirectional data transfer but info will flow on both directions! use finite state machines (FSM) to specify sender, receiver state: when in this state next state uniquely determined by next event state 1 event causing state transition actions taken on state transition event actions state 2 underlying channel perfectly reliable no bit errors no loss of packets separate FSMs for sender, receiver: sender sends data into underlying channel receiver read data from underlying channel sender receiver Transport Layer 3-25 Transport Layer 3-26 Rdt2.0: channel with bit errors underlying channel may flip bits in packet checksum to detect bit errors the question: how to recover from errors? acknowledgements (ACKs): receiver explicitly tells sender that pkt received OK negative acknowledgements (NAKs): receiver explicitly tells sender that pkt had errors sender retransmits pkt on receipt of NAK new mechanisms in rdt2.0 (beyond rdt1.0): error detection receiver feedback: msgs (ACK,NAK) rcvr->sender Transport Layer 3-27 rdt2.0: FSM specification sender receiver Transport Layer 3-28 7
rdt2.0 has a fatal flaw! rdt2.1: sender, handles garbled ACK/NAKs What happens if ACK/NAK corrupted? sender doesn t know what happened at receiver! can t just retransmit: possible duplicate stop and wait Sender sends one packet, then waits for receiver response Handling duplicates: sender retransmits current pkt if ACK/NAK garbled sender adds sequence number to each pkt receiver discards (doesn t deliver up) duplicate pkt Transport Layer 3-29 Transport Layer 3-30 rdt2.1: receiver, handles garbled ACK/NAKs rdt2.1: discussion Sender: seq # added to pkt two seq. # s (0,1) will suffice. Why? must check if received ACK/NAK corrupted twice as many states state must remember whether current pkt has 0 or 1 seq. # Receiver: must check if received packet is duplicate state indicates whether 0 or 1 is expected pkt seq # note: receiver can not know if its last ACK/NAK received OK at sender Transport Layer 3-31 Transport Layer 3-32 8
rdt2.2: a NAK-free protocol rdt3.0: channels with errors and loss same functionality as rdt2.1, using ACKs only instead of NAK, receiver sends ACK for last pkt received OK receiver must explicitly include seq # of pkt being ACKed duplicate ACK at sender results in same action as NAK: retransmit current pkt Transport Layer 3-33 New assumption: underlying channel can also lose packets (data or ACKs) checksum, seq. #, ACKs, retransmissions will be of help, but not enough Approach: sender waits reasonable amount of time for ACK retransmits if no ACK received in this time if pkt (or ACK) just delayed (not lost): retransmission will be duplicate, but use of seq. # s already handles this receiver must specify seq # of pkt being ACKed requires countdown timer Transport Layer 3-34 rdt3.0 in action rdt3.0 in action Transport Layer 3-35 Transport Layer 3-36 9
Pipelined protocols Pipelining: sender allows multiple, in-flight, yet-tobe-acknowledged pkts range of sequence numbers must be increased buffering at sender and/or receiver Pipelining: increased utilization first packet bit transmitted, t = 0 last bit transmitted, t = L / R RTT ACK arrives, send next packet, t = RTT + L / R sender receiver first packet bit arrives last packet bit arrives, send ACK last bit of 2 nd packet arrives, send ACK last bit of 3 rd packet arrives, send ACK Two generic forms of pipelined protocols: go-back-n, selective repeat Transport Layer 3-39 U sender = 3 * L / R RTT + L / R =.024 30.008 Increase utilization by a factor of 3! = 0.0008 microsecon Transport Layer 3-40 Pipelining Protocols GBN in action Go-back-N: overview sender: up to N unacked pkts in pipeline receiver: only sends cumulative ACKs doesn t ACK pkt if there s a gap sender: has timer for oldest unacked pkt if timer expires: retransmit all unacked packets Selective Repeat: overview sender: up to N unacked packets in pipeline receiver: ACKs individual pkts sender: maintains timer for each unacked pkt if timer expires: retransmit only unacked packet Transport Layer 3-41 Transport Layer 3-42 10
Selective Repeat receiver individually acknowledges all correctly received pkts buffers pkts, as needed, for eventual in-order delivery to upper layer sender only resends pkts for which ACK not received sender timer for each unacked pkt sender window N consecutive seq # s again limits seq #s of sent, unacked pkts SR in action Transport Layer 3-43 Transport Layer 3-44 Chapter 3 Transport Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete slides (including this one) and slide content to suit your needs. They obviously represent a lot of work on our part. In return for use, we only ask the following: If you use these slides (e.g., in a class) in substantially unaltered form, that you mention their source (after all, we d like people to use our book!) If you post any slides in substantially unaltered form on a www site, that you note that they are adapted from (or perhaps identical to) our slides, and note our copyright of this material. Thanks and enjoy! JFK/KWR Computer Networking: A Top Down Approach 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, April 2009. Chapter 3: Transport Layer Our goals: understand principles behind layer : multiplexing/demultipl exing learn about layer protocols in the Internet: UDP: connectionless TCP: connection-oriented TCP All material copyright 1996-2009 J.F Kurose and K.W. Ross, All Rights Reserved Transport Layer 3-45 Transport Layer 3-46 11
Chapter 3 outline TCP: Overview RFCs: 793, 1122, 1323, 2018, 2581 : UDP : TCP point-to-point: one sender, one receiver reliable pipelined: TCP congestion and flow set window size send & receive buffers full duplex data: bi-directional data flow in same connection MSS: maximum segment size connection-oriented: handshaking (exchange of msgs) init s sender, receiver state before data exchange led: sender will not overwhelm receiver Transport Layer 3-47 Transport Layer 3-48 TCP seq. # s and ACKs Chapter 3 outline Seq. # s: byte stream number of first byte in segment s data ACKs: seq # of next byte expected from other side cumulative ACK : UDP : TCP simple telnet scenario Transport Layer 3-49 Transport Layer 3-50 12
timeout Seq=92 timeout timeout Seq=92 timeout TCP TCP: retransmission scenarios TCP creates rdt service on top of IP s unreliable service pipelined segments cumulative ACKs TCP uses single retransmission timer retransmissions are triggered by: timeout events duplicate ACKs initially consider simplified TCP sender: ignore duplicate ACKs ignore flow, Transport Layer 3-51 SendBase = 100 Host A X loss Host B time lost ACK scenario Sendbase = 100 SendBase = 120 SendBase = 120 time Host A Host B premature timeout Transport Layer 3-52 TCP retransmission scenarios (more) Host A Host B X loss How to generate SEQ# and ACK# With data packet S_SEQ# = R_ACK# S_ACK# = R_SEQ# + R_Len R_SEQ# = S_ACK# R_ACK# = S_SEQ# + S_Len SendBase = 120 time Cumulative ACK scenario With no data packet S_SEQ# = R_ACK# S_ACK# = R_SEQ# + 1 R_SEQ# = S_ACK# R_ACK# = S_SEQ# + 1 Transport Layer 3-53 Transport Layer 3-54 13
timeout Example 1. Example 2 With data packet S_SEQ# = R_ACK# S_ACK# = R_SEQ# + R_Len R_SEQ# = S_ACK# R_ACK# = S_SEQ# + S_Len With no data packet S_SEQ# = R_ACK# S_ACK# = R_SEQ# + 1 R_SEQ# = S_ACK# R_ACK# = S_SEQ# + 1 Transport Layer 3-55 Transport Layer 3-56 Fast Retransmit Fast Retransmit triple duplicate ACKs Host A seq # 1 seq # 11 seq # 21 seq # 31 seq # 41 Len= 10 bytes Host B time *assumption: all segment has the same length = 10 bytes X Len= 10 bytes ACK=11 ACK=11 ACK=11 ACK=11 Transport Layer 3-57 time-out period often relatively long: long delay before resending lost packet detect lost segments via duplicate ACKs. sender often sends many segments back-toback if segment is lost, there will likely be many duplicate ACKs for that segment If sender receives 3 ACKs for same data, it assumes that segment after ACKed data was lost: fast retransmit: resend segment before timer expires Transport Layer 3-58 14
Chapter 3 outline TCP Flow Control : UDP : TCP receive side of TCP connection has a receive buffer: IP datagrams (currently) TCP data unused buffer (in buffer) space app process may be slow at reading from buffer process flow sender won t overflow receiver s buffer by transmitting too much, too fast speed-matching service: matching send rate to receiving s drain rate Transport Layer 3-59 Transport Layer 3-60 TCP Flow : how it works Chapter 3 outline IP datagrams (currently) TCP data unused buffer (in buffer) space rwnd RcvBuffer process (suppose TCP receiver discards out-of-order segments) unused buffer space: = rwnd (a.k.a receiver window) = RcvBuffer-[LastByteRcvd - LastByteRead] receiver: advertises unused buffer space by including rwnd value in segment header sender: limits # of unacked bytes to rwnd guarantees receiver s buffer doesn t overflow Transport Layer 3-61 : UDP : TCP Transport Layer 3-62 15
TCP Connection Management Recall: TCP sender, receiver establish connection before exchanging data segments initialize TCP variables: seq. #s buffers, flow info (e.g. RcvWindow) client: connection initiator Socket clientsocket = new Socket("hostname","port number"); server: contacted by client Socket connectionsocket = welcomesocket.accept(); Three way handshake: Step 1: client host sends TCP SYN segment to server specifies initial seq # no data Step 2: server host receives SYN, replies with SYNACK segment server allocates buffers specifies server initial seq. # Step 3: client receives SYNACK, replies with ACK segment, which may contain data TCP Connection Management (cont.) Closing a connection: client closes socket: clientsocket.close(); Step 1: client end system sends TCP FIN segment to server Step 2: server receives FIN, replies with ACK. Closes connection, sends FIN. Transport Layer 3-63 Transport Layer 3-64 TCP Connection Management (cont.) Chapter 3 outline Step 3: client receives FIN, replies with ACK. Enters timed wait - will respond with ACK to received FINs Step 4: server, receives ACK. Connection closed. Note: with small modification, can handle simultaneous FINs. : UDP : TCP Transport Layer 3-65 Transport Layer 3-66 16
Principles of Congestion Control Chapter 3 outline Congestion: informally: too many sources sending (too much data) at too high rate (too fast) for to handle different from flow! manifestations: lost packets (buffer overflow at routers) long delays (queueing in router buffers) : UDP : TCP Transport Layer 3-67 Transport Layer 3-68 TCP : goal: TCP sender should transmit as fast as possible, but without congesting Q: how to find rate just below congestion level decentralized: each TCP sender sets its own rate, based on implicit feedback: ACK: segment received (a good thing!), not congested, so increase sending rate lost segment: assume loss due to congested, so decrease sending rate Transport Layer 3-69 17