5: DataLink Layer5-1 Chapter 5 Link Layer and LANs A note on the use of these ppt slides: We’re making these slides freely available to all (faculty, students, readers). They’re in PowerPoint form so you can add, modify, and delete slides (including this one) and slide content to suit your needs. They obviously represent a lot of work on our part. In return for use, we only ask the following:  If you use these slides (e.g., in a class) in substantially unaltered form, that you mention their source (after all, we’d like people to use our book!)  If you post any slides in substantially unaltered form on a www site, that you note that they are adapted from (or perhaps identical to) our slides, and note our copyright of this material. Thanks and enjoy! JFK/KWR All material copyright J.F Kurose and K.W. Ross, All Rights Reserved Computer Networking: A Top Down Approach 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, April 2009.

Glossary r Data link layer: 資料鏈結層 r Multiple access: 多重存取 ( 多個節點共用同 一廣播式頻道，如 Etherenet ( 乙太網路 ) 、 WiFi) r Link layer addressing: 鏈結層定址機制 r LAN (Local Area Network): 區域網路 r Frame: 訊框，封包在資料鏈結層稱之為訊框 r Datagram: 數據報，封包在 IP 層稱之為數據報 5: DataLink Layer5-2

Glossary r “MAC (Media Access Control)” address: 媒 體存取控制層位址，俗稱網路卡卡號 r Half-duplex: 半雙工 ( 通訊端點雙向均可收送 資料，但非同時，如 Walky-Talky) r Network interface card: 網路介面卡，俗稱 網路卡 r Random Access Protocols: 隨機存取協定 r CSMA (Carrier Sense Multiple Access): 載 波感測多重存取 5: DataLink Layer5-3

5: DataLink Layer5-4 Chapter 5: The Data Link Layer Our goals: r understand principles behind data link layer services: m error detection, correction m sharing a broadcast channel: multiple access m link layer addressing r instantiation and implementation of various link layer technologies

5: DataLink Layer5-5 Link Layer r 5.1 Introduction and services r 5.2 Error detection and correction r 5.3Multiple access protocols r 5.4 Link-layer Addressing r 5.5 Ethernet r 5.6 Link-layer switches

5: DataLink Layer5-6 Link Layer: Introduction Some terminology: r hosts and routers are nodes r communication channels that connect adjacent nodes along communication path are links m wired links m wireless links m LANs r layer-2 packet is a frame, encapsulates datagram data-link layer has responsibility of transferring datagram from one node to adjacent node over a link

5: DataLink Layer5-7 Link layer: context r datagram transferred by different link protocols over different links: m e.g., Ethernet on first link, frame relay on intermediate links, on last link

5: DataLink Layer5-8 Link Layer Services r Framing, link access: m encapsulate datagram into frame, adding header, trailer m “MAC (Media Access Control)” addresses used in frame headers to identify source, destination different from IP address! r reliable delivery between adjacent nodes m we learned how to do this already (chapter 3)! m seldom used on low bit-error link (fiber, some twisted pair) m wireless links: high error rates Q: why both link-level and end-end reliability?

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

5: DataLink Layer5-10 Where is the link layer implemented? r in each and every host r link layer implemented in “adaptor” (aka network interface card NIC) m Ethernet card, card m implements link, physical layer r attaches into host’s system buses r combination of hardware, software, firmware controller physical transmission cpu memory host bus (e.g., PCI) network adapter card host schematic application transport network link physical

5: DataLink Layer5-11 Adaptors Communicating r sending side: m encapsulates datagram in frame m adds error checking bits, rdt, flow control, etc. r receiving side m looks for errors, rdt, flow control, etc m extracts datagram, passes to upper layer at receiving side controller sending host receiving host datagram frame

5: DataLink Layer5-12 Link Layer r 5.1 Introduction and services r 5.2 Error detection and correction r 5.3Multiple access protocols r 5.4 Link-layer Addressing r 5.5 Ethernet r 5.6 Link-layer switches

5: DataLink Layer5-13 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 Layer5-14 Error Detection Two example error detection codes Internet checksum: used at transport layer Cyclic Redundancy Check (CRC): widely used in practice (Ethernet, WiFi, ATM)

5: DataLink Layer5-15 Link Layer r 5.1 Introduction and services r 5.2 Error detection and correction r 5.3Multiple access protocols r 5.4 Link-layer Addressing r 5.5 Ethernet r 5.6 Link-layer switches

5: DataLink Layer5-16 Multiple Access Links and Protocols Two types of “links”: r point-to-point m PPP for dial-up access r broadcast (shared wire or medium) m old-fashioned Ethernet m wireless LAN shared wire (e.g., cabled Ethernet) shared RF (e.g., WiFi) shared RF (satellite) humans at a cocktail party (shared air, acoustical)

5: DataLink Layer5-17 Ethernet

5: DataLink Layer5-18 Multiple Access protocols r single shared broadcast channel r two or more simultaneous transmissions by nodes: interference m collision if node receives two or more signals at the same time multiple access protocol r distributed algorithm that determines how nodes share channel, i.e., determine when node can transmit

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

5: DataLink Layer5-20 Random Access Protocols r When node has packet to send m transmit at full channel data rate R. m no a priori coordination among nodes  two or more transmitting nodes ➜ “collision”, r random access protocol specifies: m how to detect collisions m how to recover from collisions (e.g., via delayed retransmissions) r Examples of random access protocols: m CSMA/CD, CSMA/CA

5: DataLink Layer5-21 CSMA (Carrier Sense Multiple Access) CSMA: listen before transmit: If channel sensed idle: transmit entire frame r If channel sensed busy, defer transmission r human analogy: don’t interrupt others!

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

5: DataLink Layer5-23 CSMA/CD (Collision Detection) CSMA/CD: carrier sensing, deferral as in CSMA m collisions detected within short time m colliding transmissions aborted, reducing channel wastage r collision detection: m easy in wired LANs: measure signal strengths, compare transmitted, received signals m difficult in wireless LANs: received signal strength overwhelmed by local transmission strength

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

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

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

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

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

5: DataLink Layer5-29 Summary of MAC protocols r channel partitioning, by time, frequency or code m Time Division, Frequency Division r random access (dynamic), m carrier sensing: easy in some technologies (wire), hard in others (wireless) m CSMA/CD used in Ethernet m CSMA/CA used in r taking turns m polling from central site, token passing m Bluetooth, FDDI, IBM Token Ring