Chapter 5 Link Layer & LNS Link Layer: Introduction Some terminology: hosts and routers are nodes communication channels that connect adjacent nodes along communication path are links wired links wireless links LNs layer-2 packet is a frame, encapsulates datagram 5: DataLink Layer 5a-1 data-link layer has responsibility of transferring datagram from one node to adjacent node over a link 5: DataLink Layer 5-2 Link layer: context datagram transferred by different link protocols over different links: e.g., ernet on first link, frame relay on intermediate links, 802.11 on last link each link protocol provides different services e.g., may or may not provide rdt over link Link Layer Services framing, link access: encapsulate datagram into frame, adding header, trailer channel access if shared medium MC addresses used in frame headers to identify source, dest different from 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 5-3 5: DataLink Layer 5-4
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 5-5 Where is the link layer implemented? in each and every host link layer implemented in adaptor (aka network interface card NIC) application transport host schematic ernet card, PCMCI network cpu memory link card, 802.11 card implements link, physical layer attaches into host s system buses combination of hardware, software, firmware link physical controller physical transmission host bus (e.g., PCI) network adapter card 5: DataLink Layer 5-6 daptors Communicating Error Detection datagram controller sending host frame sending side: encapsulates datagram in frame adds error checking bits, rdt, flow control, etc. datagram datagram controller receiving host receiving side looks for errors, rdt, flow control, etc extracts datagram, passes to upper layer at receiving side 5: DataLink Layer 5-7 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-8
Parity Checking Single it Parity: Detect single bit errors Two Dimensional it Parity: Detect and correct single bit errors Multiple ccess Links and Protocols Two types of links : point-to-point PPP for dial-up access point-to-point link between ernet switch and host broadcast (shared wire or medium) old-fashioned ernet upstream HFC 802.11 wireless LN 0 0 5: DataLink Layer 5-9 shared wire (e.g., cabled ernet) shared RF (e.g., 802.11 WiFi) shared RF (satellite) humans at a cocktail party (shared air, acoustical) 5: DataLink Layer 5-10 Multiple ccess protocols single shared broadcast channel two or more simultaneous transmissions by nodes: interference collision if node receives two or more signals at the same time multiple access protocol distributed algorithm that determines how nodes share channel, i.e., determine when node can transmit communication about channel sharing must use channel itself! no out-of-band channel for coordination Ideal Multiple ccess Protocol roadcast channel of rate R bps 1. when one node wants to transmit, it can send at rate R. 2. when M nodes want to transmit, each can send at average rate R/M 3. fully decentralized: no special node to coordinate transmissions no synchronization of clocks, slots 4. simple 5: DataLink Layer 5-11 5: DataLink Layer 5-12
MC 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 ccess channel not divided, allow collisions recover from collisions Taking turns nodes take turns, but nodes with more to send can take longer turns Channel Partitioning MC protocols: TDM TDM: 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 LN, 1,3,4 have pkt, slots 2,5,6 idle 6-slot frame 1 3 4 1 3 4 5: DataLink Layer 5-13 5: DataLink Layer 5-14 Channel Partitioning MC protocols: FDM FDM: 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 LN, 1,3,4 have pkt, frequency bands 2,5,6 idle FDM cable frequency bands 5: DataLink Layer 5-15 Random ccess 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 MC protocol specifies: how to detect collisions how to recover from collisions (e.g., via delayed retransmissions) Examples of random access MC protocols: slotted LOH LOH CSM, CSM/CD, CSM/C 5: DataLink Layer 5-16
Slotted LOH Slotted LOH ssumptions: 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 5: DataLink Layer 5-17 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 5: DataLink Layer 5-18 Slotted loha efficiency Efficiency : long-run fraction of successful slots (many nodes, all with many frames to send) 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 t best: channel used for useful transmissions 37% of time!! 5: DataLink Layer 5-19 Pure (unslotted) LOH unslotted loha: simpler, no synchronization when frame first arrives transmit immediately collision probability increases: frame sent at t 0 collides with other frames sent in [t 0-1,t 0 +1] 5: DataLink Layer 5-20
Pure loha efficiency P(success by given node) = P(node transmits). P(no other node transmits in [t 0-1,t 0 ]. P(no other node transmits in [t 0,t 0 +1] = p. (1-p) N-1. (1-p) N-1 = p. (1-p) 2(N-1) choosing optimum p and then letting n -> infty... CSM (Carrier Sense Multiple ccess) CSM: listen before transmit: If channel sensed idle: transmit entire frame If channel sensed busy, defer transmission human analogy: don t interrupt others! = 1/(2e) =.18 even worse than slotted loha! 5: DataLink Layer 5-21 5: DataLink Layer 5-22 CSM collisions 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 spatial layout of nodes CSM/CD (Collision Detection) CSM/CD: carrier sensing, deferral as in CSM collisions detected within short time colliding transmissions aborted, reducing channel wastage collision detection: easy in wired LNs: measure signal strengths, compare transmitted, received signals difficult in wireless LNs: received signal strength overwhelmed by local transmission strength human analogy: the polite conversationalist 5: DataLink Layer 5-23 5: DataLink Layer 5-24
CSM/CD collision detection Taking Turns MC protocols channel partitioning MC 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 MC 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 5-25 5: DataLink Layer 5-26 Taking Turns MC protocols Taking Turns MC 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) slaves data data poll master Token passing: control token passed from one node to next sequentially. token message concerns: token overhead latency single point of failure (token) (nothing to send) T T data 5: DataLink Layer 5-27 5: DataLink Layer 5-28
Summary of MC protocols channel partitioning, by time, frequency or code Time Division, Frequency Division random access (dynamic), LOH, S-LOH, CSM, CSM/CD carrier sensing: easy in some technologies (wire), hard in others (wireless) CSM/CD used in ernet CSM/C used in 802.11 taking turns polling from central site, token passing luetooth, FDDI, IM Token Ring MC ddresses and RP 32-bit address: network-layer address used to get datagram to destination subnet MC (or LN or physical or ernet) address: function: get frame from one interface to another physically-connected interface (same network) 48 bit MC address (for most LNs) burned in NIC ROM, also sometimes software settable 5: DataLink Layer 5-29 5: DataLink Layer 5-30 LN ddresses and RP Each adapter on LN has unique LN address 71-65-F7-2-08-53 LN (wired or wireless) 1-2F--76-09-D 58-23-D7-F-20-0 0C-C4-11-6F-E3-98 roadcast address = FF-FF-FF-FF-FF-FF = adapter LN ddress (more) MC address allocation administered by IEEE manufacturer buys portion of MC address space (to assure uniqueness) analogy: (a) MC address: like Social Security Number (b) address: like postal address MC flat address portability can move LN card from one LN to another hierarchical address NOT portable address depends on subnet to which node is attached 5: DataLink Layer 5-31 5: DataLink Layer 5-32
RP: ddress Resolution Protocol RP protocol: Same LN (network) Question: how to determine MC address of knowing s address? 137.196.7.23 71-65-F7-2-08-53 137.196.7.88 LN 137.196.7.78 1-2F--76-09-D Each node (host, router) on LN has RP table RP table: /MC address mappings for some LN nodes 137.196.7.14 < address; MC address; TTL> TTL (Time To Live): time after which address mapping will be forgotten 58-23-D7-F-20-0 (typically 20 min) 0C-C4-11-6F-E3-98 wants to send datagram to, and s MC address not in s RP table. broadcasts RP query packet, containing 's address dest MC address = FF- FF-FF-FF-FF-FF all machines on LN receive RP query receives RP packet, replies to with its ('s) MC address frame sent to s MC address (unicast) caches (saves) -to- MC address pair in its RP table until information becomes old (times out) soft state: information that times out (goes away) unless refreshed RP is plug-and-play : nodes create their RP tables without intervention from net administrator 5: DataLink Layer 5-33 5: DataLink Layer 5-34 ddressing: routing to another LN walkthrough: send datagram from to via R focus on addressing at (datagram) and MC layer (frame) assume knows s address assume knows address of first hop router, R (how?) assume knows R s MC address (how?) 111.111.111.111 74-29-9C-E8-FF-55 R 222.222.222.220 1-23-F9-CD-06-9 222.222.222.222 49-D-D2-C7-56-2 ddressing: routing to another LN creates datagram with source, destination creates link-layer frame with R's MC address as dest, frame contains -to- datagram 111.111.111.111 74-29-9C-E8-FF-55 MC src: 74-29-9C-E8-FF-55 MC dest: E6-E9-00-17--4 src: 111.111.111.111 dest: 222.222.222.222 R 222.222.222.220 1-23-F9-CD-06-9 222.222.222.222 49-D-D2-C7-56-2 111.111.111.112 CC-49-DE-D0--7D 111.111.111.110 E6-E9-00-17--4 222.222.222.221 88-2-2F-54-1-0F 111.111.111.112 CC-49-DE-D0--7D 111.111.111.110 E6-E9-00-17--4 222.222.222.221 88-2-2F-54-1-0F Link Layer 5-35 Link Layer 5-36
ddressing: routing to another LN ddressing: routing to another LN frame sent from to R frame received at R, datagram removed, passed up to R forwards datagram with source, destination R creates link-layer frame with 's MC address as dest, frame contains -to- datagram 111.111.111.111 74-29-9C-E8-FF-55 MC src: 74-29-9C-E8-FF-55 MC dest: E6-E9-00-17--4 src: 111.111.111.111 src: 111.111.111.111 dest: 222.222.222.222 dest: 222.222.222.222 R 222.222.222.220 1-23-F9-CD-06-9 222.222.222.222 49-D-D2-C7-56-2 111.111.111.111 74-29-9C-E8-FF-55 R 222.222.222.220 1-23-F9-CD-06-9 MC src: 1-23-F9-CD-06-9 MC dest: 49-D-D2-C7-56-2 src: 111.111.111.111 dest: 222.222.222.222 222.222.222.222 49-D-D2-C7-56-2 111.111.111.112 CC-49-DE-D0--7D 111.111.111.110 E6-E9-00-17--4 222.222.222.221 88-2-2F-54-1-0F 111.111.111.112 CC-49-DE-D0--7D 111.111.111.110 E6-E9-00-17--4 222.222.222.221 88-2-2F-54-1-0F Link Layer 5-37 Link Layer 5-38 ddressing: routing to another LN R forwards datagram with source, destination R creates link-layer frame with 's MC address as dest, frame contains -to- datagram 111.111.111.111 74-29-9C-E8-FF-55 R 222.222.222.220 1-23-F9-CD-06-9 MC src: 1-23-F9-CD-06-9 MC dest: 49-D-D2-C7-56-2 src: 111.111.111.111 dest: 222.222.222.222 222.222.222.222 49-D-D2-C7-56-2 ddressing: routing to another LN R forwards datagram with source, destination R creates link-layer frame with 's MC address as dest, frame contains -to- datagram 111.111.111.111 74-29-9C-E8-FF-55 R 222.222.222.220 1-23-F9-CD-06-9 MC src: 1-23-F9-CD-06-9 MC dest: 49-D-D2-C7-56-2 src: 111.111.111.111 dest: 222.222.222.222 222.222.222.222 49-D-D2-C7-56-2 111.111.111.112 CC-49-DE-D0--7D 111.111.111.110 E6-E9-00-17--4 222.222.222.221 88-2-2F-54-1-0F 111.111.111.112 CC-49-DE-D0--7D 111.111.111.110 E6-E9-00-17--4 222.222.222.221 88-2-2F-54-1-0F Link Layer 5-39 Link Layer 5-40
ernet dominant wired LN technology: cheap $20 for NIC first widely used LN technology simpler, cheaper than token LNs and TM kept up with speed race: 10 Mbps 10 Gbps 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) ernet protocol (nodes do not collide with each other) Metcalfe s ernet sketch switch 5: DataLink Layer 5-41 bus: coaxial cable star 5: DataLink Layer 5-42 ernet Frame Structure Sending adapter encapsulates datagram (or other network layer protocol packet) in ernet frame Preamble: 7 bytes with pattern 10101010 followed by one byte with pattern 10101011 used to synchronize receiver, sender clock rates ernet Frame Structure (more) ddresses: 6 bytes if adapter receives frame with matching destination address, or with broadcast address (eg RP packet), it passes data in frame to network layer protocol otherwise, adapter discards frame Type: indicates higher layer protocol (mostly but others possible, e.g., Novell X, ppletalk) CRC: checked at receiver, if error is detected, frame is dropped 5: DataLink Layer 5-43 5: DataLink Layer 5-44
ernet: Unreliable, connectionless connectionless: No handshaking between sending and receiving NICs unreliable: receiving NIC doesn t send acks or nacks to sending NIC stream of datagrams passed to network layer can have gaps (missing datagrams) gaps will be filled if app is using TCP otherwise, app will see gaps ernet s MC protocol: unslotted CSM/CD ernet CSM/CD algorithm 1. NIC receives datagram from network layer, creates frame 2. If NIC senses channel idle, starts frame transmission If NIC senses channel busy, waits until channel idle, then transmits 3. If NIC transmits entire frame without detecting another transmission, NIC is done with frame! 4. If NIC detects another transmission while transmitting, aborts and sends jam signal 5. fter aborting, NIC enters exponential backoff: after mth collision, NIC chooses K at random from {0,1,2,,2 m -1}. NIC waits K 512 bit times, returns to Step 2 5: DataLink Layer 5-45 5: DataLink Layer 5-46 ernet s CSM/CD (more) CSM/CD efficiency Jam Signal: make sure all other transmitters are aware of collision; 48 bits it time:.1 microsec for 10 Mbps ernet ; for K=1023, wait time is about 50 msec See/interact with Java applet on WL Web site: highly recommended! Exponential ackoff: Goal: adapt retransmission attempts to estimated current load heavy load: random wait will be longer first collision: choose K from {0,1}; delay is K 512 bit transmission times after second collision: choose K from {0,1,2,3} after ten collisions, choose K from {0,1,2,3,4,,1023} T prop = max prop delay between 2 nodes in LN t trans = time to transmit max-size frame efficiency goes to 1 as t prop goes to 0 efficiency = 1+ + 5t as t trans goes to infinity better performance than LOH: and simple, cheap, decentralized! 1 prop /t trans 5: DataLink Layer 5-47 5: DataLink Layer 5-48
802.3 ernet Standards: Link & sical Layers many different ernet standards common MC protocol and frame format different speeds: 2 Mbps, 10 Mbps, 100 Mbps, 1Gbps, 10G bps different physical layer media: fiber, cable Manchester encoding application transport network link physical 100SE-TX 100SE-T4 copper (twister pair) physical layer MC protocol and frame format 100SE-T2 100SE-SX 100SE-FX 100SE-X fiber physical layer 5: DataLink Layer 5-49 used in 10aseT each bit has a transition allows clocks in sending and receiving nodes to synchronize to each other no need for a centralized, global clock among nodes! Hey, this is physical-layer stuff! 5: DataLink Layer 5-50 Hubs physical-layer ( dumb ) repeaters: bits coming in one link go out all other links at same rate all nodes connected to hub can collide with one another no frame buffering no CSM/CD at hub: host NICs detect collisions hub twisted pair Switch link-layer device: smarter than hubs, take active role store, forward ernet frames examine incoming frame s MC address, selectively forward frame to one-or-more outgoing links when frame is to be forwarded on segment, uses CSM/CD to access segment transparent hosts are unaware of presence of switches plug-and-play, self-learning switches do not need to be configured 5: DataLink Layer 5-51 5: DataLink Layer 5-52
Switch: allows multiple simultaneous transmissions hosts have dedicated, direct connection to switch switches buffer packets ernet protocol used on each incoming link, but no collisions; full duplex each link is its own collision domain switching: -to- and - to- simultaneously, without collisions not possible with dumb hub C 6 5 1 2 3 4 switch with six interfaces (1,2,3,4,5,6) C Switch Table Q: how does switch know that reachable via interface 4, reachable via interface 5? : each switch has a switch table, each entry: (MC address of host, interface to reach host, time stamp) looks like a routing table! Q: how are entries created, maintained in switch table? something like a routing protocol? C 6 5 1 2 3 4 switch with six interfaces (1,2,3,4,5,6) C 5: DataLink Layer 5-53 5: DataLink Layer 5-54 Switch: self-learning switch learns which hosts can be reached through which interfaces when frame received, switch learns location of sender: incoming LN segment records sender/location pair in switch table C MC addr interface TTL 6 1 60 5 1 2 3 4 Source: Dest: C Switch table (initially empty) 5: DataLink Layer 5-55 Switch: frame filtering/forwarding When frame received: 1. record link associated with sending host 2. index switch table using MC dest address 3. if entry found for destination then { if dest on segment from which frame arrived then drop the frame else forward the frame on interface indicated } else flood forward on all but the interface on which the frame arrived 5: DataLink Layer 5-56
Self-learning, forwarding: example frame destination unknown: flood destination location known: selective send C MC addr interface TTL 1 60 4 60 1 6 2 3 5 4 Source: Dest: C Switch table (initially empty) Interconnecting switches switches can be connected together S 1 C S 2 D E Q: sending from to G - how does S 1 know to forward frame destined to F via S 4 and S 3? : self learning! (works exactly the same as in single-switch case!) S 4 F G S 3 H I 5: DataLink Layer 5-57 5: DataLink Layer 5-58 Self-learning multi-switch example Suppose C sends frame to I, I responds to C Institutional network S 1 S 2 C D 1 2 E S 4 F G S 3 H I to external network router mail server web server subnet Q: show switch tables and packet forwarding in S 1, S 2, S 3, S 4 5: DataLink Layer 5-59 5: DataLink Layer 5-60
Switches vs. Routers both store-and-forward devices routers: network layer devices (examine network layer headers) switches are link layer devices routers maintain routing tables, implement routing algorithms switches maintain switch tables, implement filtering, learning algorithms Synthesis: a day in the life of a web request journey down protocol stack complete! application, transport, network, link putting-it-all-together: synthesis! goal: identify, review, understand protocols (at all layers) involved in seemingly simple scenario: requesting www page scenario: student attaches laptop to campus network, requests/receives www.google.com 5: DataLink Layer 5-61 Link Layer 5-62 day in the life: scenario day in the life connecting to the Internet browser school network 68.80.2.0/24 web page web server 64.233.169.105 Comcast network 68.80.0.0/13 Google s network 64.233.160.0/19 server UDP UDP router (runs ) connecting laptop needs to get its own address, addr of firsthop router, addr of server: request use encapsulated in UDP, encapsulated in, encapsulated in 802.3 ernet ernet frame broadcast (dest: FFFFFFFFFFFF) on LN, received at router running server ernet demuxed to demuxed, UDP demuxed to Link Layer 5-63 Link Layer 5-64
day in the life connecting to the Internet day in the life RP (before, before ) UDP UDP router (runs ) Client now has address, knows name & addr of server, address of its first-hop router server formulates CK containing client s address, address of first-hop router for client, name & address of encapsulation server at server, frame forwarded (switch learning) through LN, demultiplexing at client client receives CK reply RP query UDP RP RP reply RP router (runs ) before sending request, need address of www.google.com: query created, encapsulated in UDP, encapsulated in, encapsulated in. To send frame to router, need MC address of router interface: RP RP query broadcast, received by router, which replies with RP reply giving MC address of router interface client now knows MC address of first hop router, so can now send frame containing query Link Layer 5-65 Link Layer 5-66 day in the life using UDP router (runs ) datagram containing query forwarded via LN switch from client to 1 st hop router UDP Comcast network 68.80.0.0/13 server datagram forwarded from campus network into comcast network, routed (tables created by R, OSPF, IS-IS and/or GP routing protocols) to server demux ed to server server replies to client with address of www.google.com Link Layer 5-67 day in the life TCP connection carrying SYNCK SYNCK SYNCK SYNCK SYNCK SYNCK TCP TCP web server 64.233.169.105 router (runs ) to send request, client first opens TCP socket to web server TCP SYN segment (step 1 in 3- way handshake) inter-domain routed to web server web server responds with TCP SYNCK (step 2 in 3-way handshake) TCP connection established! Link Layer 5-68
day in the life request/reply TCP web page finally (!!!) displayed TCP web server 64.233.169.105 router (runs ) request sent into TCP socket datagram containing request routed to www.google.com web server responds with reply (containing web page) datagram containing reply routed back to client Link Layer 5-69