04832250 Computer Networks (Honor Track) A Data Communication and - PowerPoint PPT Presentation

04832250 – Computer Networks (Honor Track) A Data Communication and Device Networking Perspective A Data Communication and Device Networking Perspective Module 5: End-to-End Transport Prof. Chenren Xu � ��� � Center for Energy-efficient Computing and Applications Computer Science, Peking University chenren@pku.edu.cn http://soar.pku.edu.cn/ 1

Where we are in the Course Application Transport • Starting the Transport Layer! Network - Builds on the network layer to deliver data across networks for Link applications with the desired reliability or quality Physical • Recall app app - Transport layer provides end-to-end connectivity across the TCP TCP network IP IP IP IP 802.11 802.11 802.3 802.3 - Segments carry application data across the network Host Router Host - Segments are carried within packets within frames Segment TCP (Streams) UDP (Datagrams) Connections Datagrams TCP App, e.g., HTTP 802.11 IP Bytes are delivered Messages may be lost, reliably, and in order reordered, duplicated Packet Arbitrary length content Limited message size Frame Flow control matches Can send regardless sender to receiver of receiver state Congestion control Can send regardless matches sender to network of network state 2

Topics • Service Models - Socket API and ports - Datagrams, Streams • User Datagram Protocol (UDP) • Transmission Control Protocol (TCP) - Connections - Sliding Window - Flow control - Retransmission timers - Congestion control 3

Socket API • Simple abstraction to use the network Socket, - The “network” API (really Transport service) used to write all Internet apps Port #2 - Part of all major OSes and languages; originally Berkeley (Unix) ~1983 • Supports both Internet transport services (Streams and Datagrams) Socket, • Sockets let apps attach to the local network at different ports Port #1 • Same API used for Streams and Datagrams Primitive Meaning SOCKET Create a new communication endpoint BIND Associate a local address (port) with a socket LISTEN Announce willingness to accept connections Only needed ACCEPT Passively establish an incoming connection for Streams CONNECT Actively attempt to establish a connection SEND (TO) Send some data over the socket To/From forms for RECEIVE (FROM) Receive some data over the socket Datagrams CLOSE Release the socket 4

Ports • Application process is identified by the • Some Well-Known Ports tuple IP address, protocol, and port Port Protocol Use - Ports are 16-bit integers representing local 20, 21 FTP File transfer “mailboxes” that a process leases 22 SSH Remote login, replacement for Telnet • Servers often bind to “well-known ports” 25 SMTP Email 80 HTTP World Wide Web - <1024, require administrative privileges 110 POP-3 Remote email access • Clients often assigned “ephemeral” ports 143 IMAP Remote email access - Chosen by OS, used temporarily 443 HTTPS Secure Web (HTTP over SSL/TLS) 543 RTSP Media player control 631 IPP Printer sharing 5

Topics • Service Models - Socket API and ports - Datagrams, Streams I just want to • User Datagram Protocol (UDP) send a packet! • Transmission Control Protocol (TCP) Network - Connections - Sliding Window - Flow control - Retransmission timers - Congestion control 6

User Datagram Protocol (UDP) • A shim layer on packets • Datagram Sockets Time • Used by apps that don’t want reliability or bytestreams Client Server 1: socket 1: socket - Voice-over-IP (unreliable) 2: bind request - DNS, RPC (message-oriented) 4: sendto 3: recvfrom* - DHCP (bootstrapping) reply 6: sendto 5: recvfrom* • UDP Buffering 7: close 7: close • UDP Header Application App App App *= call blocks - Uses ports to identify sending and receiving Ports application processes Transport - Datagram length up to 64K (TCP) - Checksum (16 bits) for reliability Message queues Port Mux/Demux Network (IP) packet 7

Topics • Service Models - Socket API and ports - Datagrams, Streams • User Datagram Protocol (UDP) • Transmission Control Protocol (TCP) SYN! ACK! SYNACK! - Connections (establish and release) - Sliding Window Network - Flow control - Retransmission timers - Congestion control 8

Connection Establishment • How to set up connections - We’ll see how TCP does it • Both sender and receiver must be ready before we start the transfer of data - Need to agree on a set of parameters - e.g., the Maximum Segment Size (MSS) • This is signaling - It sets up state at the endpoints - Like “dialing” for a telephone call 9

Three-Way Handshake • Used in TCP Active party Passive party (client) (server) • Opens connection for data in both directions 1 • Each side probes the other with a fresh Initial Sequence Number 2 - Sends on a SYNchronize segment 3 - Echo on an ACKnowledge segment - SYNs are retransmitted if lost Time • Sequence and ack numbers carried on further (data) segments Active party Passive party Delayed or (client) (server) • Suppose delayed, duplicate copies of the SYN and ACK arrive at the server! duplicates - Connection will be cleanly rejected on both sides J - DoS attack … X REJECT X REJECT 10

TCP Connection State Machine (Connection Establishment) • Captures the states (rectangles) and transitions (arrows) - A/B means event A (active or passive) triggers the transition, with action B Both parties run Active party (client) Passive party (server) instances of this CLOSED 1 CLOSED state machine LISTEN SYN_SENT 2 SYN_RCVD ESTABLISHED 3 Time ESTABLISHED • Finite state machines are a useful tool to specify and check the handling of all cases that may occur • TCP allows for simultaneous open - i.e., both sides open at once instead of the client-server pattern 11

Connection Release FIN! FIN! • How to release connections Network - We’ll see how TCP does it • Orderly release by both parties when done - Delivers all pending data and “hangs up” - Cleans up state in sender and receiver Active Passive • Key problem is to provide reliability while releasing party party - TCP uses a “symmetric” close in which both sides shutdown independently • TCP Connection Release 1 - Two steps: § Active sends FIN(x), ACKs § Passive sends FIN(y), ACKs 2 § FINs are retransmitted if lost - Each FIN/ACK closes one direction of data transfer 12

TCP Connection State Machine (Connection Release) Both parties run A/B means event A triggers instances of this the transition, with action B Active party Passive party state machine ESTABLISHED ESTABLISHED FIN_WAIT_1 1 FIN_WAIT_2 LAST_ACK 2 TIME_WAIT 考！ (timeout) CLOSED CLOSED • TIME_WAIT State - We wait a long time (two times the maximum segment lifetime of 60 seconds) after sending all segments and before completing the close, but why? § ACK might have been lost, in which case FIN will be resent for an orderly close § Could otherwise interfere with a subsequent connection 13

TCP Connection State Machine Complete 14

Topics • Service Models - Socket API and ports - Datagrams, Streams • User Datagram Protocol (UDP) • Transmission Control Protocol (TCP) Yeah! - Connections (establish and release) - Sliding Window Network - Flow control - Retransmission timers - Congestion control 15

Sliding Window • Principles of the Algorithm Sender Receiver - Pipelining and reliability Frame 0 - Building on Stop-and-Wait – ARQ with one message at a time ACK 0 Time Timeout • Limitations of Stop-and-Wait Frame 1 - It allows only a single message to be outstanding from the sender: ACK 1 § Fine for LAN (only one frame fit) § Not efficient for network paths with BD >> 1 packet - Example: R = 1 Mbps, D = 50 ms, RTT = 2D = 100 ms § Assume pkt is 1250 Byte = 10 Kb, 10 Kb / 100 ms = 100 Kbps = 0.1 Mbps = only 10% channel utilization § What if R = 10 Mbps? • Generalization of Stop-and-Wait - Allows W packets to be outstanding – can send W packets per RTT (=2D) § Need W = 2BD to fill network path 16

Sliding Window – Sender • Sender buffers up to W segments until they are Sliding W=5 Available Window acknowledged 5 6 7 .. 2 3 4 5 2 3 .. 3 Acked Unacked Unavailable .. .. - LFS = last frame sent, LAR = last ack received - Sends while LFS – LAR ≤ W seq. number LFS LAR W=5 • Transport accepts another segment of data from the Application ... Acked Unavailable Unacked .. .. - Transport sends it (as LFS – LAR = 5) seq. number LFS LAR W=5 Available • Next higher ACK arrives from peer… - Window advances, buffer is freed 5 6 7 2 2 3 4 5 .. 2 3 .. 3 Acked Unacked Unavailable .. .. - LFS – LAR à 4 (can send one more) seq. number LAR LFS 17