Chapter 5 Link Layer and LANs

1. Chapter 5Link Layer and LANs Computer Networking: A Top Down Approach Jim Kurose, Keith RossAddison-Wesley. 5: DataLink Layer

2. Link Layer Services • framing, link access: • encapsulate datagram into frame, adding header, trailer • channel access if shared medium • “MAC” addresses used in frame headers to identify source, dest • different from IP address! • reliable delivery between adjacent nodes • we learned how to do this already (chapter 3)! • seldom used on low bit-error link (fiber, some twisted pair) • wireless links: high error rates • Q: why both link-level and end-end reliability? 5: DataLink Layer

3. Link Layer Services (more) • flow control: • pacing between adjacent sending and receiving nodes • error detection: • errors caused by signal attenuation, noise. • receiver detects presence of errors: • signals sender for retransmission or drops frame • error correction: • receiver identifies and corrects bit error(s) without resorting to retransmission • half-duplex and full-duplex • with half duplex, nodes at both ends of link can transmit, but not at same time 5: DataLink Layer

4. Error Detection • EDC= Error Detection and Correction bits (redundancy) • D = Data protected by error checking, may include header fields • Error detection not 100% reliable! • protocol may miss some errors, but rarely • larger EDC field yields better detection and correction otherwise 5: DataLink Layer

5. Parity Checking Two Dimensional Bit Parity: Detect and correct single bit errors Single Bit Parity: Detect single bit errors Odd parity scheme Parity bit value is chosen such that number of 1’s send is odd. Ex. 9 1’s in the data, so the parity bit is ‘0’. 0 0 (even parity) 5: DataLink Layer

6. 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? Internet checksum (review) Goal: detect “errors” (e.g., flipped bits) in transmitted packet (note: checkwum used at transport layer, CRC at data link layer) 5: DataLink Layer

7. Multiple Access Links and Protocols Two types of “links”: • point-to-point • PPP for dial-up access • point-to-point link between Ethernet switch and host • broadcast (shared wire or medium) • old-fashioned Ethernet • upstream HFC (hybrid fiber-coaxial cable) • 802.11 wireless LAN shared wire (e.g., cabled Ethernet) shared RF (e.g., 802.11 WiFi) shared RF (satellite) 5: DataLink Layer

8. MAC Protocols: a taxonomy Three broad classes: • Channel Partitioning • divide channel into smaller “pieces” (time slots, frequency, code) • allocate piece to node for exclusive use • Random Access • channel not divided, allow collisions • “recover” from collisions • “Taking turns” • nodes take turns, but nodes with more to send can take longer turns 5: DataLink Layer

9. Channel Partitioning MAC protocols: TDMA TDMA: time division multiple access • access to channel in "rounds" • each station gets fixed length slot (length = pkt trans time) in each round • unused slots go idle • example: 6-station LAN, 1,3,4 have pkt, slots 2,5,6 idle 6-slot frame 3 3 4 4 1 1 5: DataLink Layer

10. Channel Partitioning MAC protocols: FDMA FDMA: frequency division multiple access • channel spectrum divided into frequency bands • each station assigned fixed frequency band • unused transmission time in frequency bands go idle • example: 6-station LAN, 1,3,4 have pkt, frequency bands 2,5,6 idle time frequency bands FDM cable 5: DataLink Layer

11. Random Access Protocols • When node has packet to send • transmit at full channel data rate R. • no a priori coordination among nodes • two or more transmitting nodes ➜ “collision”, • random access MAC protocol specifies: • how to detect collisions (e.g., no Ack, or bad reception) • how to recover from collisions (e.g., via delayed retransmissions) • Examples of random access MAC protocols: • ALOHA • slotted ALOHA • CSMA: Carrier Sense Multiple Access, • CSMA/CD (Ethernet): CSMA with collision detection • CSMA/CA (WiFi 802.11): CSMA with collision avoidance 5: DataLink Layer

12. Random MAC (Medium Access Control) Techniques • ALOHA (‘70) [packet radio network] • A station sends whenever it has a packet/frame • Listens for round-trip-time delay for Ack • If no Ack then re-send packet/frame after random delay • too short  more collisions • too long  under utilization • No carrier sense is used • If two stations transmit about the same time frames collide • Utilization of ALOHA is low ~18% 5: DataLink Layer

13. Pure (unslotted) ALOHA • unslotted Aloha: simple, no synchronization • when frame first arrives • transmit immediately • collision probability increases: • frame sent at t0 collides with other frames sent in [t0-1,t0+1] 5: DataLink Layer

14. Pure Aloha efficiency P(success by given node) = P(node transmits) . P(no other node transmits in [t0-1,t0] . P(no other node transmits in [t0,t0+1] = p . (1-p)N-1 . (1-p)N-1 = p . (1-p)2(N-1) … choosing optimum p and then letting n -> infty ... = 1/(2e) = .18 Very bad, can we do better? 5: DataLink Layer

15. Assumptions: all frames same size time divided into equal size slots (time to transmit 1 frame) nodes start to transmit only slot beginning nodes are synchronized if 2 or more nodes transmit in slot, all nodes detect collision Operation: when node obtains fresh frame, transmits in next slot if no collision: node can send new frame in next slot if collision: node retransmits frame in each subsequent slot with prob. p until success Slotted ALOHA 5: DataLink Layer

16. Pros single active node can continuously transmit at full rate of channel highly decentralized: only slots in nodes need to be in sync simple Cons collisions, wasting slots idle slots nodes may be able to detect collision in less than time to transmit packet clock synchronization Slotted ALOHA 5: DataLink Layer

17. suppose: N nodes with many frames to send, each transmits in slot with probability p prob that given node has success in a slot = p(1-p)N-1 prob that any node has a success = Np(1-p)N-1 max efficiency: find p* that maximizes Np(1-p)N-1 for many nodes, take limit of Np*(1-p*)N-1 as N goes to infinity, gives: Max efficiency = 1/e = .37 Slotted Aloha efficiency Efficiency : long-run fraction of successful slots (many nodes, all with many frames to send) At best: channel used for useful transmissions 37% of time! ! 5: DataLink Layer

18. CSMA (Carrier Sense Multiple Access) CSMA: listen before transmit: If channel sensed idle: transmit entire frame • If channel sensed busy, defer transmission 5: DataLink Layer

19. CSMA collisions spatial layout of nodes collisions can still occur: propagation delay means two nodes may not hear each other’s transmission collision: entire packet transmission time wasted note: role of distance & propagation delay in determining collision probability 5: DataLink Layer

20. CSMA/CD (Collision Detection) CSMA/CD: carrier sensing, deferral as in CSMA • collisions detected within short time • colliding transmissions aborted, reducing channel wastage • collision detection: • easy in wired LANs: measure signal strengths, compare transmitted, received signals • difficult in wireless LANs: received signal strength overwhelmed by local transmission strength (use CSMA/CA: we’ll get back to that in Ch 6) • human analogy: the polite conversationalist 5: DataLink Layer

21. CSMA/CD collision detection CSMA/CD CSMA 5: DataLink Layer

22. Shared meduim bus 5: DataLink Layer

23. More on CSMA/CD and Ethernet • uses broadcast and filtration: all stations on the bus receive the frame, but only the station with the appropriate data link D-L (MAC) destination address picks up the frame. For multicast, filteration may be done at the D-L layer or at the network layer (with more overhead) 5: DataLink Layer

24. Analyzing CSMA/CD • Utilization or ‘efficiency’ is fraction of the time used for useful/successful data transmission Collision Collision Success Av. Time wasted ~ 5 Prop TRANS 5: DataLink Layer

25. u=TRANS/(TRANS+wasted)=TRANS/(TRANS+5PROP)=1/(1+5a), where a=PROP/TRANS • if a is small, stations learn about collisions and u increases • if a is large, then u decreases 5: DataLink Layer

26. 5: DataLink Layer

27. Collision detection in Wireless • Need special equipment to detect collision at receiver • We care about the collision at the reciever • 1. no-collision detected at sender but collision detected at receiver • 2. collision at sender but no collision at receiver • Neighborhood of sender and receiver are not the same (it’s not a shared wire, but define relatively (locally) to a node [hidden terminal problem] • … more later 5: DataLink Layer

28. “Taking Turns” MAC protocols channel partitioning MAC protocols: • share channel efficiently and fairly at high load • inefficient at low load: delay in channel access, 1/N bandwidth allocated even if only 1 active node! Random access MAC protocols • efficient at low load: single node can fully utilize channel • high load: collision overhead “taking turns” protocols look for best of both worlds! 5: DataLink Layer

29. data data poll “Taking Turns” MAC protocols Polling: • master node “invites” slave nodes to transmit in turn • typically used with “dumb” slave devices • concerns: • polling overhead • latency • single point of failure (master) master slaves 5: DataLink Layer

30. “Taking Turns” MAC protocols Token passing: • control token passed from one node to next sequentially. • token message • concerns: • token overhead • latency • single point of failure (token) T (nothing to send) T data 5: DataLink Layer

31. Release after reception: utilization analysis Prop • u=useful time/total time(useful+wasted) • u=T1+T2+…+TN/[T1+T2+..+TN+(N+1)PROP] • a=PROP/TRANS=PROP/E(Tn), where E(Tn) is the expected (average) transmission of a node Prop token Prop N1 Prop 12 5: DataLink Layer

32. u=Ti/(Ti+(N+1)PROP) ~1/(1+PROP/E(Tn)), where E(Tn)= Ti/N • u=1/(1+a) for token ring • [compared to Ethernet u=1/(1+5a)] 5: DataLink Layer

33. 5: DataLink Layer

34. As the number of stations increases, less time for token passing, and u increases • for release after transmission u=1/(1+a/N), where N is the number of stations 5: DataLink Layer

35. Ethernet (IEEE 802.3, uses CSMA/CD) “dominant” wired LAN technology: • cheap $20 for NIC • first widely used LAN technology • simpler, cheaper than token LANs and ATM • kept up with speed race: 10 Mbps – 10 Gbps Metcalfe’s Ethernet sketch 5: DataLink Layer

36. Star topology • bus topology popular through mid 90s • all nodes in same collision domain (can collide with each other) • today: star topology prevails • active switch in center • each “spoke” runs a (separate) Ethernet protocol (nodes do not collide with each other) switch bus: coaxial cable star 5: DataLink Layer

37. application transport network link physical fiber physical layer copper (twister pair) physical layer 802.3 Ethernet Standards: Link & Physical Layers • many different Ethernet standards • common MAC protocol and frame format • different speeds: 2 Mbps, 10 Mbps, 100 Mbps, 1Gbps, 10G bps • different physical layer media: fiber, cable • Switched Ethernet: use frame bursting to increase utilization. Still CSMA/CD compatible MAC protocol and frame format 100BASE-T2 100BASE-FX 100BASE-TX 100BASE-BX 100BASE-SX 100BASE-T4 5: DataLink Layer

38. Shared medium hub 5: DataLink Layer

39. Switching hub 5: DataLink Layer

40. 5: DataLink Layer

41. 5: DataLink Layer

42. Switch: allows multiple simultaneous transmissions A • hosts have dedicated, direct connection to switch • switches buffer packets • Ethernet protocol used on each incoming link, but no collisions; full duplex • each link is its own collision domain • switching:A-to-A’ and B-to-B’ simultaneously, without collisions • not possible with dumb hub C’ B 1 2 3 6 4 5 C B’ A’ switch with six interfaces (1,2,3,4,5,6) 5: DataLink Layer

43. Source: A Dest: A’ A’ A MAC addr interface TTL 60 60 1 4 A A’ A A’ A A’ A A’ A A’ A A’ A A’ Self-learning, forwarding: example A • frame destination unknown: C’ B 1 2 3 flood 6 4 5 • destination A location known: C selective send B’ A’ Switch table (initially empty) 5: DataLink Layer