Chapter 3 outline

3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4 Principles of reliable data transfer 3.5 Connection-oriented transport: TCP segment structure reliable data transfer flow control connection management 3.6 Principles of congestion control 3.7 TCP congestion control Chapter 3 outline Transport Layer

provide logical communication between app processes running on different hosts transport protocols run in end systems more than one transport protocol available to apps Internet: TCP and UDP application transport network data link physical application transport network data link physical logical end-end transport Transport services and protocols Transport Layer

Process Process socket socket Port 9876 Port 9999 UDP UDP 2: Application Layer

Process Process welcome socket Port 9999 socket socket Port 6789 Port 6789 TCP TCP Host S Host C 2: Application Layer

network layer: delivers packets between hosts transport layer: delivers packets between processes relies on & enhances network layer services Transport vs. network layer Transport Layer

reliable, in-order delivery (TCP) connection setup congestion control flow control unreliable, unordered delivery: UDP no-frills extension of “best-effort” IP services not available: delay guarantees bandwidth guarantees application transport network data link physical application transport network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical logical end-end transport Internet transport-layer protocols Transport Layer

Multiplexing at send host: Demultiplexing at rcv host: Multiplexing/demultiplexing delivering received segments to correct socket gathering data from multiple sockets, enveloping data with header (later used for demultiplexing) = socket = process application P4 application application P1 P2 P3 P1 transport transport transport network network network link link link physical physical physical host 3 host 2 host 1 Transport Layer

host receives IP datagrams each datagram has source IP address, destination IP address each datagram carries 1 transport-layer segment each segment has source, destination port number UDP: host uses port numbers to direct segment to appropriate socket TCP: host uses IP addresses & port numbers to direct segment to appropriate socket How demultiplexing works 32 bits source port # dest port # other header fields application data (message) TCP/UDP segment format Transport Layer

When host receives UDP segment: checks destination port number in segment directs UDP segment to socket with that port number Connectionless demultiplexing Transport Layer

TCP socket (connection) 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 Connection-oriented demux Transport Layer

SP: 9157 SP: 5775 P1 P1 P2 P4 P3 P6 P5 client IP: A DP: 80 DP: 80 Connection-oriented demux (cont) S-IP: B D-IP:C SP: 9157 DP: 80 Client IP:B server IP: C S-IP: A S-IP: B D-IP:C D-IP:C Transport Layer

SP: 9157 SP: 5775 P1 P1 P2 P3 client IP: A DP: 80 DP: 80 Connection-oriented demux: Threaded Web Server P4 S-IP: B D-IP:C SP: 9157 DP: 80 Client IP:B server IP: C S-IP: A S-IP: B D-IP:C D-IP:C Transport Layer

“no frills,” “bare bones” Internet transport 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? no connection establishment (which can add delay) simple: no connection state at sender, receiver small segment header no congestion control: UDP can blast away as fast as desired UDP: User Datagram Protocol [RFC 768] Transport Layer

often used for streaming multimedia apps loss tolerant rate sensitive reliable transfer over UDP: add reliability at application layer application-specific error recovery! UDP: more 32 bits source port # dest port # Length, in bytes of UDP segment, including header checksum length Application data (message) UDP segment format Transport Layer

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 …. UDP checksum Goal: detect “errors” (e.g., flipped bits) in transmitted segment Transport Layer

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 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 wraparound sum checksum Transport Layer

important in app., transport, link layers top-10 list of important networking topics! characteristics of unreliable channel will determine complexity of reliable data transfer protocol (rdt) Principles of Reliable data transfer Transport Layer

We’ll: incrementally develop sender, receiver sides of reliable data transfer protocol (rdt) consider only unidirectional data transfer but control info will flow on both directions! The book uses finite state machines (FSM) to specify sender, receiver Reliable data transfer: getting started Transport Layer

underlying channel perfectly reliable no bit errors no loss of packets no duplicates first-in-first-out Rdt1.0: reliable transfer over a reliable channel SenderReceiver Send pkt Rcv pkt Send pkt Rcv pkt Send pkt Rcv pkt Transport Layer

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: control msgs (ACK,NAK) from receiver to sender Rdt2.0: channel with bit errors Transport Layer

rdt2.0 in action SenderReceiver SenderReceiver Send pkt Rcv pkt Send ACK Send pkt Rcv pkt Send ACK Rcv ACK Send pkt Rcv ACK Send pkt x Rcv pkt Dct errors Send NAK Rcv pkt Send ACK Rcv NAK Re-send pkt Rcv ACK Send pkt Rcv pkt Send ACK Rcv pkt Send ACK Rcv ACK Rcv ACK With errors Without error Transport Layer

What happens if ACK/NAK corrupted? sender doesn’t know what happened at receiver! Remedy: sender retransmits current pkt if ACK/NAK garbled problem: may introduce duplicates 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 stop and wait rdt2.0 has a fatal flaw! Sender sends one packet, then waits for receiver response Transport Layer

rdt2.1 in action SenderReceiver SenderReceiver Send pkt0 Rcv pkt0 Send ACK Send pkt0 Rcv pkt0 Send ACK Rcv ACK Send pkt1 Rcv ACK0 Send pkt1 x Rcv garbled pkt Send NAK Rcv pkt1 Send ACK Rcv NAK Re-send pkt1 Rcv ACK1 Send pkt0 Rcv pkt1 Send ACK x Rcv pkt0 Send ACK Rcv garbled ACK/NAK Re-send pkt1 Rcv ACK0 Rcv pkt1 Discard pkt1 With errors Without error Transport Layer

Sender: seq # added to pkt two seq. #’s (0,1) will suffice. must check if received ACK/NAK corrupted 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 rdt2.1: discussion Transport Layer

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 rdt3.0: channels with errors and loss Transport Layer

rdt3.0 in action Transport Layer

rdt3.0 works, but performance stinks Performance of rdt3.0 sender receive RTT Transport Layer

Pipelining: sender allows multiple, “in-flight”, yet-to-be-acknowledged pkts range of sequence numbers must be increased buffering at sender and/or receiver Two generic forms of pipelined protocols: go-Back-N, selective repeat Pipelined protocols Transport Layer

Pipelining: increased utilization sender receiver first packet bit transmitted, last bit transmitted first packet bit arrives RTT last packet bit arrives, send ACK last bit of 2nd packet arrives, send ACK last bit of 3rd packet arrives, send ACK ACK arrives, send next packet Transport Layer

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 Pipelining Protocols Transport Layer

Sender: k-bit seq # in pkt header “window” of up to N, consecutive unACKed pkts allowed Go-Back-N • ACK(n): ACKs all pkts up to, including seq # n - “cumulative ACK” • may receive duplicate ACKs (see receiver) • timer for the first pkt in window • timeout(n): retransmit pkt n and all higher seq # pkts in window Transport Layer

ACK-only: always send ACK for correctly-received pkt with highest in-order seq # may generate duplicate ACKs need only remember expectedseqnum out-of-order pkt: discard (don’t buffer) -> no receiver buffering! Re-ACK pkt with highest in-order seq # GBN: receiver Transport Layer

GBN inaction Transport Layer

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 Selective Repeat Transport Layer

Selective repeat: sender, receiver windows Transport Layer

data from above : if next available seq # in window, send pkt timeout(n): resend pkt n, restart timer ACK(n) in [sendbase,sendbase+N-1]: mark pkt n as received if n smallest unACKed pkt, advance window base to next unACKed seq # receiver sender Selective repeat pkt n in [rcvbase, rcvbase+N-1] • send ACK(n) • out-of-order: buffer • in-order: deliver (also deliver buffered, in-order pkts), advance window to next not-yet-received pkt pkt n in [rcvbase-N,rcvbase-1] • ACK(n) otherwise: • ignore Transport Layer

Selective repeat in action Transport Layer

Example: seq #’s: 0, 1, 2, 3 window size=3 receiver sees no difference in two scenarios! incorrectly passes duplicate data as new in (a) Q: what relationship between seq # size and window size? Selective repeat: dilemma Transport Layer

Two-way communication, say, between A and B Run two GBN’s (or SR’s) In one of them, A is sender, B receiver In the other, B is sender, A receiver A and B each send both data packets and ACKs Piggybacking Two-way communication Transport Layer

Example ReceiverSender SenderReceiver pkt0 ACK0 ACK4 pkt5 pkt1 ACK5 ACK1 pkt6 pkt2 ACK6 ACK2 pkt7 ACK7 Transport Layer

Piggybacking SenderReceiver Send pkt0,4 Send pkt5,0 Send pkt1,5 Send pkt6,1 Send pkt2,6 Send pkt7,2 Send ACK7 ACK(n): ACKs all pkts up to seq # n Transport Layer

Alternative ACK(n) in GBN SenderReceiver SenderReceiver Send pkt0 Send pkt0 Send ACK1 Send ACK0 Send pkt1 Send pkt1 Send ACK2 Send ACK1 Send pkt2 Send pkt2 Send ACK3 Send ACK2 ACK(n): ACKs all pkts up to seq # n-1 ACK(n): ACKs all pkts up to seq # n Transport Layer

full duplex data: bi-directional data flow in same connection MSS: maximum segment size connection-oriented: handshaking (exchange of control msgs) init’s sender, receiver state before data exchange flow controlled: sender will not overwhelm receiver point-to-point: one sender, one receiver reliable, in-order byte steam: no “message boundaries” pipelined: TCP congestion and flow control set window size send & receive buffers TCP: OverviewRFCs: 793, 1122, 1323, 2018, 2581 Transport Layer

Chapter 3 outline