ICS 156 Networking Lab Magda El Zarki Professor

ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine

Course Outline n n Ch 1: Introduction Ch 2: Bridges Ch 3: Routers Ch 4: Transport Protocols

4. Transport Layer Protocols n Introduction n Transport Layer Protocols: – Transport Control Protocol (TCP) and – User Datagram Protocol (UDP)

4. 1 Introduction

4. 1. 1 TCP and UDP n There are two kinds of Transport Protocols used in the Internet: – UDP: User Datagram Protocol – TCP: Transport Control Protocol n They both operate over IP. n They both use PORT numbers for connecting to applications.

4. 1. 2 Port Numbers (1/3) n The concatenation of IP address and Port Number provides a unique identifier for transferring information between a source and a destination. This is known as a socket, the door between an application and the underlying transport system. n Each application service is allocated a unique port number: – FTP - 21 – Telnet - 23 – Domain Name Server - 53, etc.

4. 1. 2 Port Numbers (2/3) n There are 1023 port numbers available for application services. n Not all port numbers are well known, in that case a request is sent to a catch all port number. The response packet contains the correct port number.

4. 1. 2 Port Numbers (3/3)

4. 1. 3 TCP vs UDP n The tuple <Source Port, Destination Port> is used in the addressing of the Transport Data Unit (TDU). n Most applications that require a reliable transport mechanism use TCP, otherwise UDP is used because it is simpler. n UDP is the preferred choice for real-time services as it does not incorporate a lot of the overhead that is associated with TCP.

4. 2 UDP (1/3) n Uses only 8 bytes of header: – 2 bytes for source port – 2 bytes for destination port – 2 bytes for length of data unit – 2 bytes for checksum (covers IP addresses and IP length field included)

4. 2 UDP (2/3) n Provides connectionless service - no sequencing, no end to end error control (only error detection, includes data), no flow control. n NFS, some routing protocols (e. g. , RIP), RTP (Real-Time Protocol), TFTP, etc. , use UDP as it is simple and fast if reliability is not an issue. n IP will do fragmentation if the UDP packet is too large for the path (i. e. , > path MTU).

4. 2 UDP (3/3) n A UDP packet can be as large as the max. IP packet minus the headers. Generally the application will limit the packet size. n UDP leaves most of the work to the upper (application) layer. This can slow things down, as ACKs, re-ordering, etc. , has to be done by the application.

4. 3 TCP (1/2)

4. 3 TCP (2/2) n 20 byte header (without options) n Header plus data referred to as a transport segment n Segment size chosen to accommodate the smallest IP packet size on path to avoid fragmentation

4. 3. 1 Connection Establishment and Tear Down n TCP goes through a 3 phase set-up: – Connection set-up (3 way hand-shake): SYN, SYN ACK, ACK – Data transfer – Connection tear down: FIN, ACK, FIN, ACK (two way or one way)

4. 3. 2 Sequence Numbers and ACKs n TCP is connection oriented - uses sequence numbers (always increasing, numbers not consecutive, reflect the number of bytes not segments!). For example: if TCP wants to send 2000 bytes and sends them in two segments of 1000 bytes each, if first segment has sequence no 102, then sequence number of second segment will be 102+1000= 1102. n The ACKs on the other hand reflect the sequence number of the next byte that the receiver is expecting. If the receiver received segment with sequence number 102 of length 1000, then ACK will use number: 102+ 1000 = 1102.

4. 3. 3 Out of Order Arrivals n The RFC does not specify what to do with out of order packets. TCP will only acknowledge ordered transmissions, but the question is: should it keep out of order packets in its buffer or just discard them? The easiest implementation is to discard and wait for all packets to arrive in order. n An ACK is sent in response to an out of order packet, it contains the “expected” sequence number.

4. 3. 4 Group and Delayed ACKs n Group ACKs: TCP will use group ACKs, also referred to as delayed ACKs. in otherwords, it will not ACK each received segment, it will wait for a short while (differs on each system, 200 msecs for WANs, 20 msec for LANs) and then ACK all segments (max. 2 segments) that it has received so far. n It does that so that: 1) it can do group ACKing which is more efficient, and 2) it hopes to be able to piggyback an ACK on data going in the reverse direction. If there is data in the buffer that needs to be sent, it will not do a delayed ACK. Only uses delayed ACK if send buffer is empty.

4. 3. 5 Timers & Retransmissions n Uses error detection and recovery - ACKs and retransmissions. If an ACK is not received before a timer expires, the segment is resent. n The retransmission timer is not a static value. It is calculated based upon current network status. The timer must be greater than the roundtrip delay!

4. 3. 6 Flow Control (1/2) n Sliding window is used as the flow control technique (matching of sender and receiver data rates): Each end system will advertise the largest window it is willing to receive without ACKs, i. e. , packets that can be outstanding between source and destination. n This value is dynamic, it changes based upon how fast the receiver can read the arriving data. It is always advertised in the messages sent from the destination to the source. Note however that the TCP congestion control mechanism does kick in too and affects the amount of data that can be sent.

4. 3. 6 Flow Control (2/2) n If an ACK packet comes back with a receiver window size of “ 0”, that means that the destination wants the source to hold off with transmission. In this case the sending host can only send segments with 1 byte of data. This is to keep the connection alive between the two ends, i. e. , keep ACKs flowing from destination to source indicating the window size.

4. 3. 7 Congestion Control n TCP has imbedded congestion control. When ACKs come back with a delay (i. e. timers expire) the window size is reduced by the sender. The sender will only send data = min{congestion window, receiver (or sliding) window}. n TCP also uses something called slow start: The sender starts off with only sending 1 (in some cases 2) packet, then doubles that if the ACK comes back before the retransmit timer expires. It keeps on doubling until it reaches a threshold then goes into a linear increase (i. e. , adds one to the window size). If at anytime an ACK is delayed, it sets the threshold to half the current congestion window size and starts again with slow start.

4. 3. 8 Applications and TCP n n n All applications that are concerned with reliable transport use TCP SMTP (email), ftp, RIP, http, etc. use TCP hides the underlying network from the application: it segments, it re-orders packets, does error control and handles flow matching and congestion control.