1. 2: Application Layer 1 1DT057 Distributed Information System Chapter 3 Transport Layer

2. C HAPTER 3: T RANSPORT L AYER Transport Layer 3-2 Our goals: understand principles behind transport layer services: multiplexing/demultipl exing reliable data transfer flow control congestion control learn about transport layer protocols in the Internet: UDP: connectionless transport TCP: connection-oriented transport

3. C HAPTER 3 OUTLINE Transport Layer 3-3 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 Congestion control

4. T RANSPORT VS. NETWORK LAYER Transport Layer 3-4 network layer: logical communication between hosts transport layer: logical communication between processes relies on, enhances, network layer services

5. C HAPTER 3 OUTLINE Transport Layer 3-5 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 Congestion control

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

7. HOW DEMULTIPLEXING WORKS Transport Layer 3-7 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 host uses IP addresses & port numbers to direct segment to appropriate socket source port #dest port # 32 bits application data (message) other header fields TCP/UDP segment format

8. C ONNECTIONLESS DEMUX ( CONT ) DatagramSocket serverSocket = new DatagramSocket(6428); 3-8 Transport Layer Client IP:B P2 client IP: A P1 P3 server IP: C SP: 6428 DP: 9157 SP: 9157 DP: 6428 SP: 6428 DP: 5775 SP: 5775 DP: 6428 SP provides “return address”

9. I NTERNET TRANSPORT - LAYER PROTOCOLS Transport Layer 3-9 reliable, in-order delivery (TCP) congestion control flow control connection setup unreliable, unordered delivery: UDP no-frills extension of “best- effort” IP services not available: delay guarantees bandwidth guarantees 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 application transport network data link physical logical end-end transport

10. TCP VS. UDP Transport Layer 3- 10

11. TCP VS. UDP FeaturesTCP (Yes/No)UDP (Yes/No) (1) Ordered packets (2) Connectionless (3) Reliable data delivery (no packet loss) (4) Flow control (5) Congestion control (6) delay guarantees (7) bandwidth guarantees

12. TCP VS. UDP FeaturesTCP (Yes/No)UDP (Yes/No) (1) Ordered packetsYN (2) ConnectionlessNY (3) Reliable data delivery (no packet loss) YN (4) Flow controlYN (5) Congestion controlYN (6) delay guarantees NN (7) bandwidth guarantees NN

13. C HAPTER 3 OUTLINE Transport Layer 3- 13 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 congestion control

14. UDP: USER DATAGRAM PROTOCOL [RFC 768] Transport Layer 3- 14 “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

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

16. C HAPTER 3 OUTLINE Transport Layer 3- 16 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 congestion control

17. PRINCIPLES OF RELIABLE DATA TRANSFER Transport Layer 3- 17 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)

18. PRINCIPLES OF RELIABLE DATA TRANSFER Transport Layer 3- 18 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)

19. PRINCIPLES OF RELIABLE DATA TRANSFER Transport Layer 3- 19 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)

20. RDT3.0 EXAMPLE 3- 20 Transport Layer

21. RDT3.0 EXAMPLE 3- 21 Transport Layer

22. PERFORMANCE OF RDT3.0 Transport Layer 3- 22 rdt3.0 works, but performance stinks ex: 1 Gbps link, 15 ms prop. delay, 8000 bit packet: m U sender : utilization – fraction of time sender busy sending m 1KB pkt every 30 msec -> 33kB/sec thruput over 1 Gbps link m network protocol limits use of physical resources!

23. RDT 3.0: STOP - AND - WAIT OPERATION 3- 23 Transport Layer first packet bit transmitted, t = 0 senderreceiver RTT last packet bit transmitted, t = L / R first packet bit arrives last packet bit arrives, send ACK ACK arrives, send next packet, t = RTT + L / R

24. PIPELINED PROTOCOLS Transport Layer 3- 24 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

25. P IPELINING : INCREASED UTILIZATION 3-25 Transport Layer first packet bit transmitted, t = 0 senderreceiver RTT last bit transmitted, t = L / R first packet bit arrives last packet bit arrives, send ACK ACK arrives, send next packet, t = RTT + L / R last bit of 2 nd packet arrives, send ACK last bit of 3 rd packet arrives, send ACK Increase utilization by a factor of 3!

26. P IPELINING P ROTOCOLS Transport Layer 3- 26 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

27. G O -B ACK -N Transport Layer 3- 27 Sender: k-bit seq # in pkt header “window” of up to N, consecutive unACKed pkts allowed r ACK(n): ACKs all pkts up to, including seq # n - “cumulative ACK” m may receive duplicate ACKs (see receiver) r timer for each in-flight pkt r timeout(n): retransmit pkt n and all higher seq # pkts in window

28. GBN IN ACTION 3- 28 Transport Layer

29. GBN D EMO 3- 29 Transport Layer http://www.cs.mum.edu/courses/cs450/GoBackN.htm

30. SELECTIVE REPEAT Transport Layer 3- 30 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

31. SELECTIVE REPEAT: SENDER, RECEIVER WINDOWS 3- 31 Transport Layer

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

33. S ELECTIVE REPEAT IN ACTION 3- 33 Transport Layer

34. SELECTIVE REPEAT: DILEMMA Transport Layer 3- 34 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?

35. S ELECTIVE R EPEAT D EMO 3- 35 Transport Layer http://www.eecis.udel.edu/~amer/450/TransportApplets/ SR/SRindex.html

36. C HAPTER 3 OUTLINE Transport Layer 3- 36 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 Congestion control

37. TCP: OVERVIEW RFCS: 793, 1122, 1323, 2018, 2581 Transport Layer 3- 37 full duplex data: connection-oriented: flow controlled: point-to-point: reliable, in-order byte steam: pipelined: send & receive buffers

38. TCP SEQ. #’ S AND ACK S Transport Layer 3- 38 Seq. #’s: byte stream “number” of first byte in segment’s data ACKs: seq # of next byte expected from other side cumulative ACK Host A Host B Seq=42, ACK=79, data = ‘C’ Seq=79, ACK=43, data = ‘C’ Seq=43, ACK=80 User types ‘C’ host ACKs receipt of echoed ‘C’ host ACKs receipt of ‘C’, echoes back ‘C’ time simple telnet scenario

39. TCP RELIABLE DATA TRANSFER Transport Layer 3- 39 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

40. TCP: RETRANSMISSION SCENARIOS 3- 40 Transport Layer Host A Seq=100, 20 bytes data ACK=100 time premature timeout Host B Seq=92, 8 bytes data ACK=120 Seq=92, 8 bytes data Seq=92 timeout ACK=120 Host A Seq=92, 8 bytes data ACK=100 loss timeout lost ACK scenario Host B X Seq=92, 8 bytes data ACK=100 time Seq=92 timeout SendBase = 100 SendBase = 120 SendBase = 120 Sendbase = 100

41. TCP RETRANSMISSION SCENARIOS (MORE) 3- 41 Transport Layer Host A Seq=92, 8 bytes data ACK=100 loss timeout Cumulative ACK scenario Host B X Seq=100, 20 bytes data ACK=120 time SendBase = 120

42. TCP F LOW C ONTROL Transport Layer 3- 42 receive side of TCP connection has a receive buffer: speed-matching service: matching send rate to receiving application’s drain rate r app process may be slow at reading from buffer sender won’t overflow receiver’s buffer by transmitting too much, too fast flow control IP datagrams TCP data (in buffer) (currently) unused buffer space application process

43. C HAPTER 3 OUTLINE Transport Layer 3- 43 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 congestion control

44. PRINCIPLES OF CONGESTION CONTROL Transport Layer 3- 44 Congestion: informally: “too many sources sending too much data too fast for network to handle” different from flow control! manifestations: lost packets (buffer overflow at routers) long delays (queueing in router buffers)

45. TCP CONGESTION CONTROL: 3- 45 Transport Layer r goal: TCP sender should transmit as fast as possible, but without congesting network m Q: how to find rate just below congestion level r decentralized: each TCP sender sets its own rate, based on implicit feedback: m ACK: segment received (a good thing!), network not congested, so increase sending rate m lost segment: assume loss due to congested network, so decrease sending rate

46. TCP CONGESTION CONTROL : BANDWIDTH PROBING 3- 46 Transport Layer r “probing for bandwidth”: increase transmission rate on receipt of ACK, until eventually loss occurs, then decrease transmission rate m continue to increase on ACK, decrease on loss (since available bandwidth is changing, depending on other connections in network) ACKs being received, so increase rate X X X X X loss, so decrease rate sending rate time TCP’s “sawtooth” behavior

47. C HAPTER 3: S UMMARY Transport Layer 3- 47 principles behind transport layer services: multiplexing, demultiplexing reliable data transfer flow control congestion control instantiation and implementation in the Internet UDP TCP Next: leaving the network “edge” (application, transport layers) into the network “core”