Presentation is loading. Please wait.

Presentation is loading. Please wait.

5: DataLink Layer5-1 Link Layer  5.1 Introduction and services  5.2 Error detection and correction  5.3Multiple access protocols  5.4 Link-layer Addressing.

Similar presentations


Presentation on theme: "5: DataLink Layer5-1 Link Layer  5.1 Introduction and services  5.2 Error detection and correction  5.3Multiple access protocols  5.4 Link-layer Addressing."— Presentation transcript:

1 5: DataLink Layer5-1 Link Layer  5.1 Introduction and services  5.2 Error detection and correction  5.3Multiple access protocols  5.4 Link-layer Addressing  5.5 Ethernet  5.6 Link-layer switches  5.9 A day in the life of a web request

2 5: DataLink Layer5-2 Link Layer: Introduction Some terminology:  hosts and routers are nodes  communication channels that connect adjacent nodes along communication path are links: o wired links, wireless links o Point-to-point links, multi- access (or broadcast) links  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

3 5: DataLink Layer5-3 Link layer: context  datagram transferred by different link protocols over different links: o e.g., Ethernet on first link, frame relay on intermediate links, on last link  each link protocol provides different services o e.g., may or may not provide rdt over link

4 Introduction1-4 source application transport network link physical HtHt HnHn M segment HtHt datagram destination application transport network link physical HtHt HnHn HlHl M HtHt HnHn M HtHt M M network link physical link physical HtHt HnHn HlHl M HtHt HnHn M HtHt HnHn M HtHt HnHn HlHl M router switch Encapsulation message M HtHt M HnHn frame

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

6 5: DataLink Layer5-6 Link Layer Services (more)  flow control: o pacing between adjacent sending and receiving nodes  error detection: o errors caused by signal attenuation, noise. o receiver detects presence of errors: signals sender for retransmission or drops frame  error correction: o receiver identifies and corrects bit error(s) without resorting to retransmission

7 5: DataLink Layer5-7 Where is the link layer implemented?  in each and every host  link layer implemented in “adaptor” (aka network interface card NIC) o Ethernet card, PCMCI card, card o implements link, physical layer  attaches into host’s system buses  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

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

9 5: DataLink Layer5-9 Link Layer  5.1 Introduction and services  5.2 Error detection and correction  5.3Multiple access protocols  5.4 Link-layer Addressing  5.5 Ethernet  5.6 Link-layer switches  5.9 A day in the life of a web request

10 5: DataLink Layer5-10 Parity Checking Single Bit Parity: Detect single bit errors Two Dimensional Bit Parity: Detect and correct single bit errors 0 0

11 5: DataLink Layer5-11 Internet checksum (review) 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: o NO - error detected o YES - no error detected. But maybe errors nonetheless? Goal: detect “errors” (e.g., flipped bits) in transmitted packet (note: used at transport layer only)

12 5: DataLink Layer5-12 Checksumming: Cyclic Redundancy Check  view data bits, D, as a binary number (actually, a polynomial with binary coefficients)  choose r+1 bit pattern (generator), G  goal: choose r CRC bits, R, such that o exactly divisible by G (modulo 2) o receiver knows G, divides by G. If non-zero remainder: error detected! o can detect all burst errors less than r+1 bits  widely used in practice (Ethernet, WiFi, ATM)

13 Cyclic Redundancy Check  Modulo 2 arithmetic o addition = subtraction = XOR  Each bit string represents a polynomial.  Example: corresponds to  A polynomial, G(x), of degree r is known to both sender and receiver.  Sender appends r bits (called CRC code) to the message so that the resulting polynomial can be divided evenly by G(x).  Receiver checks if the received frame (message together with CRC) is still divisible by G(x).  If not, there are transmission errors in the frame.

14  Common polynomials for G(x): CRC CRC-8 CRC-10 CRC-12 CRC-16 CRC-CCITT CRC-32 C(x) x 8 +x 2 +x 1 +1 x 10 +x 9 +x 5 +x 4 +x 1 +1 x 12 +x 11 +x 3 +x 2 +x 1 +1 x 16 +x 15 +x 2 +1 x 16 +x 12 +x 5 +1 x 32 +x 26 +x 23 +x 22 +x 16 +x 12 +x 11 +x 10 +x 8 +x 7 +x 5 +x 4 +x 2 +x+1

15 5: DataLink Layer5-15 CRC Example

16 5: DataLink Layer5-16 Link Layer  5.1 Introduction and services  5.2 Error detection and correction  5.3Multiple access protocols  5.4 Link-layer Addressing  5.5 Ethernet  5.6 Link-layer switches  5.9 A day in the life of a web request

17 5: DataLink Layer5-17 Multiple Access Links and Protocols Two types of “links”:  point-to-point o PPP for dial-up access o point-to-point link between Ethernet switch and host  broadcast (shared wire or medium) o old-fashioned Ethernet o upstream HFC (cable network) o wireless LAN shared wire (e.g., cabled Ethernet) shared RF (e.g., WiFi) shared RF (satellite) humans at a cocktail party (shared air, acoustical)

18 Introduction1-18 Cable Network Architecture: Overview home cable headend cable distribution network (simplified) Typically 500 to 5,000 homes

19 5: DataLink Layer5-19 Multiple Access protocols  single shared broadcast channel  two or more simultaneous transmissions by nodes: interference o 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! o no out-of-band channel for coordination

20 5: DataLink Layer5-20 Ideal Multiple Access Protocol Broadcast channel of rate R bps 1. when one node wants to transmit, it can send at the full rate, say R. 2. when M nodes want to transmit, each can send at average rate R/M 3. fully decentralized: o no special node to coordinate transmissions o no synchronization of clocks, slots 4. simple

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

22 5: DataLink Layer5-22 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 slot frame

23 5: DataLink Layer5-23 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 frequency bands time FDM cable

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

25 5: DataLink Layer5-25 ALOHA  When a node has a frame to send, send immediately.  Set a timer for a random amount of time.  If an ACK arrives before the timer expires, fine; otherwise, resend the frame.  (Works like stop-and-wait with random timeout interval)

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

27 5: DataLink Layer5-27 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

28 5: DataLink Layer5-28 CSMA/CD (Collision Detection) CSMA/CD: carrier sensing, deferral as in CSMA o collisions detected within short time o colliding transmissions aborted, reducing channel wastage  collision detection: o easy in wired LANs: measure signal strengths; compare transmitted & received signals o difficult in wireless LANs: received signal strength overwhelmed by local transmission strength  human analogy: the polite conversationalist

29 5: DataLink Layer5-29 CSMA/CD collision detection

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

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

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

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

34 5: DataLink Layer5-34 Link Layer  5.1 Introduction and services  5.2 Error detection and correction  5.3Multiple access protocols  5.4 Link-Layer Addressing  5.5 Ethernet  5.6 Link-layer switches  5.9 A day in the life of a web request

35 5: DataLink Layer5-35 MAC Addresses and ARP  32-bit IP address: o network-layer address o used to get datagram to destination IP subnet  MAC (or LAN or physical or Ethernet) address: o function: get frame from one interface to another physically-connected interface (in same network) o 48 bit MAC address burned in NIC ROM

36 5: DataLink Layer5-36 LAN Addresses and ARP Each adapter on LAN has unique LAN address Broadcast address = FF-FF-FF-FF-FF-FF = adapter 1A-2F-BB AD D7-FA-20-B0 0C-C4-11-6F-E F7-2B LAN (wired or wireless)

37 5: DataLink Layer5-37 LAN Address (more)  MAC address allocation administered by IEEE  manufacturer buys portion of MAC address space (to assure uniqueness)  analogy: (a) MAC address: like Social Security Number (b) IP address: like postal address  MAC flat address ➜ portability o can move LAN card from one LAN to another  IP hierarchical address NOT portable o address depends on IP subnet to which node is attached

38 5: DataLink Layer5-38 ARP: Address Resolution Protocol  Each IP node (host, router) on LAN has ARP table  ARP table: IP/MAC address mappings for some LAN nodes o TTL (Time To Live): time after which address mapping will be forgotten (typically 20 min) Q: given a node’s IP address, how to determine its MAC address? 1A-2F-BB AD ??? 0C-C4-11-6F-E F7-2B LAN

39 5: DataLink Layer5-39 ARP protocol: Same LAN (network)  A wants to send datagram to B, and B’s MAC address not in A’s ARP table.  A broadcasts ARP query packet, containing B's IP address o dest MAC address = FF- FF-FF-FF-FF-FF o all machines on LAN receive ARP query  B receives ARP packet, replies to A with its (B's) MAC address o frame sent to A’s MAC address (unicast)  A caches (saves) IP-to- MAC address pair in its ARP table until information becomes old (times out)  ARP is “plug-and-play”: o nodes create their ARP tables without intervention from net administrator

40 5: DataLink Layer5-40 Addressing: routing to another LAN R 1A-23-F9-CD-06-9B E6-E BB-4B CC-49-DE-D0-AB-7D A C-E8-FF B2-2F-54-1A-0F B BD-D2-C7-56-2A walkthrough: send datagram from A to B via R assume A knows B’s IP address  two ARP tables in router R, one for each IP network (LAN) LAN

41 5: DataLink Layer5-41  A creates IP datagram with source A, destination B  A uses ARP to get R’s MAC address for  A creates link-layer frame with R's MAC address as dest, frame contains A-to-B IP datagram  A’s NIC sends frame  R’s NIC receives frame  R removes IP datagram from Ethernet frame, sees its destined to B  R uses ARP to get B’s MAC address  R creates frame containing A-to-B IP datagram sends to B R 1A-23-F9-CD-06-9B E6-E BB-4B CC-49-DE-D0-AB-7D A C-E8-FF B2-2F-54-1A-0F B BD-D2-C7-56-2A This is a really important example – make sure you understand!

42 5: DataLink Layer5-42 Link Layer  5.1 Introduction and services  5.2 Error detection and correction  5.3Multiple access protocols  5.4 Link-Layer Addressing  5.5 Ethernet  5.6 Link-layer switches  5.9 A day in the life of a web request

43 5: DataLink Layer5-43 Ethernet “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

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

45 5: DataLink Layer5-45 Ethernet Frame Structure Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame Preamble:  7 bytes with pattern followed by one byte with pattern  used to synchronize receiver & sender clock rates

46 5: DataLink Layer5-46 Ethernet Frame Structure (more)  Addresses: 6 bytes o if adapter receives frame with matching destination address, or with broadcast address (eg ARP packet), it passes data in frame to network layer protocol o otherwise, adapter discards frame  Type: indicates higher layer protocol (mostly IP but others possible, e.g., Novell IPX, AppleTalk)  CRC: checked at receiver, if error is detected, frame is dropped

47 5: DataLink Layer5-47 Ethernet: Unreliable, connectionless  connectionless: No handshaking between sending and receiving NICs  Unreliable (best effort): receiving NIC doesn’t send acks or nacks to sending NIC o stream of datagrams passed to network layer can have gaps (missing datagrams) o gaps will be filled if app is using TCP o otherwise, app will see gaps  Ethernet’s MAC protocol: CSMA/CD

48 5: DataLink Layer5-48 Ethernet CSMA/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 collision while transmitting, aborts and sends jam signal 5. After aborting, NIC enters exponential backoff: after m-th collision, NIC waits K slots of time and then returns to Step 2, where K is a random value in {0, 1, 2, …, 2 m -1}. (1 slot = 512 bit-times)

49 5: DataLink Layer5-49 Ethernet’s CSMA/CD (more) Jam Signal: make sure all other transmitters are aware of collision; 48 bits Bit time:.1 microsec for 10 Mbps Ethernet ; for K=1023, wait time is about 50 msec Exponential Backoff:  Goal: adapt retransmission attempts to estimated current load o 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}

50 5: DataLink Layer Ethernet Standards: Link & Physical Layers  many different Ethernet standards o common MAC protocol and frame format o different speeds: 2 Mbps, 10 Mbps, 100 Mbps, 1Gbps, 10G bps o different physical layer media: fiber, cable application transport network link physical MAC protocol and frame format 100BASE-TX 100BASE-T4 100BASE-FX 100BASE-T2 100BASE-SX 100BASE-BX fiber physical layer copper (twister pair) physical layer

51 5: DataLink Layer5-51 Manchester encoding  used in 10BaseT  each bit has a transition  allows clocks in sending and receiving nodes to synchronize to each other o no need for a centralized, global clock among nodes!  Hey, this is physical-layer stuff!

52 5: DataLink Layer5-52 Link Layer  5.1 Introduction and services  5.2 Error detection and correction  5.3 Multiple access protocols  5.4 Link-layer Addressing  5.5 Ethernet  5.6 Link-layer switches, LANs  5.9 A day in the life of a web request

53 5: DataLink Layer5-53 Hubs physical-layer (“dumb”) repeaters: o bits coming in one link go out all other links at same rate o all nodes connected to hub can collide with one another o no frame buffering o no CSMA/CD at hub: host NICs detect collisions twisted pair hub

54 5: DataLink Layer5-54 Switch  link-layer device: smarter than hubs, take active role o store, forward Ethernet frames o examine incoming frame’s MAC address, selectively forward frame to one-or-more outgoing links when frame is to be forwarded on segment, uses CSMA/CD to access segment  transparent o hosts are unaware of presence of switches  plug-and-play, self-learning o switches do not need to be configured

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

56 5: DataLink Layer5-56 Switch Table  Q: how does switch know that A’ reachable via interface 4, B’ reachable via interface 5?  A: each switch has a switch table, each entry: o (MAC address of host, interface to reach host, time stamp)  looks like a routing table!  Q: how are entries created, maintained in switch table? o something like a routing protocol? A A’ B B’ C C’ switch with six interfaces (1,2,3,4,5,6)

57 5: DataLink Layer5-57 Switch: self-learning  switch learns which hosts can be reached through which interfaces o when frame received, switch “learns” location of sender: incoming LAN segment o records sender/location pair in switch table A A’ B B’ C C’ A A’ Source: A Dest: A’ MAC addr interface TTL Switch table (initially empty) A 1 60

58 5: DataLink Layer5-58 Switch: frame filtering/forwarding When frame received: 1. record (in switch table) link associated with sending host 2. index switch table using MAC 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

59 5: DataLink Layer5-59 Self-learning, forwarding: example A A’ B B’ C C’ A A’ Source: A Dest: A’ MAC addr interface TTL Switch table (initially empty) A 1 60 A A’  frame destination unknown: flood A’ A  destination A location known: A’ 4 60 selective send

60 5: DataLink Layer5-60 Interconnecting switches  switches can be connected together A B  Q: sending from A to I - how does S 1 know to forward frame destined to F via S 4 and S 3 ?  A: self learning! (works exactly the same as in single-switch case!) S1S1 C D E F S2S2 S4S4 S3S3 H I G

61 5: DataLink Layer5-61 Self-learning multi-switch example Suppose A sends frame to I, I responds to A Q: show switch tables and packet forwarding in S 1, S 2, S 3, S 4 A B S1S1 C D E F S2S2 S4S4 S3S3 H I G

62 5: DataLink Layer5-62 Institutional network to external network router IP subnet mail server web server

63 5: DataLink Layer5-63 Switches vs. Routers  both store-and-forward devices o routers: network layer devices (examine network layer headers) o switches are link layer devices  routers maintain routing tables, implement routing algorithms  switches maintain switch tables, implement filtering, learning algorithms Switch

64 5: DataLink Layer5-64 Link Layer  5.1 Introduction and services  5.2 Error detection and correction  5.3Multiple access protocols  5.4 Link-Layer Addressing  5.5 Ethernet  5.6 Link-layer switches  5.9 A day in the life of a web request

65 5: DataLink Layer5-65 Synthesis: a day in the life of a web request  journey down protocol stack complete! o application, transport, network, link  putting-it-all-together: synthesis! o goal: identify, review, understand protocols (at all layers) involved in seemingly simple scenario: requesting www page o scenario: student attaches laptop to campus network, requests/receives

66 5: DataLink Layer5-66 A day in the life: scenario Comcast network /13 Google’s network / web server DNS server school network /24 browser web page

67 5: DataLink Layer5-67 A day in the life… connecting to the Internet  connecting laptop needs to get its own IP address, addr of first-hop router, addr of DNS server: use DHCP router (runs DHCP) DHCP UDP IP Eth Phy DHCP UDP IP Eth Phy DHCP  DHCP request encapsulated in UDP, encapsulated in IP, encapsulated in Ethernet  Ethernet frame broadcast (dest: FFFFFFFFFFFF ) on LAN, received at router running DHCP server  Ethernet demux’ed to IP demux’ed, UDP demux’ed to DHCP

68 5: DataLink Layer5-68 A day in the life… connecting to the Internet  DHCP server formulates DHCP ACK containing client’s IP address, IP address of first-hop router for client, name & IP address of DNS server router (runs DHCP) DHCP UDP IP Eth Phy DHCP UDP IP Eth Phy DHCP  encapsulation at DHCP server, frame forwarded (switch learning) through LAN, demultiplexing at client Client now has IP address, knows name & addr of DNS server, IP address of its first-hop router  DHCP client receives DHCP ACK reply

69 5: DataLink Layer5-69 A day in the life… ARP (before DNS, before HTTP)  before sending HTTP request, need IP address of DNS DNS UDP IP Eth Phy DNS  DNS query created, encapsulated in UDP, encapsulated in IP, encasulated in Eth. In order to send frame to router, need MAC address of router interface: ARP  ARP query broadcast, received by router, which replies with ARP reply giving MAC address of router interface  client now knows MAC address of first hop router, so can now send frame containing DNS query ARP query Eth Phy ARP ARP reply

70 5: DataLink Layer5-70 A day in the life… using DNS DNS UDP IP Eth Phy DNS  IP datagram containing DNS query forwarded via LAN switch from client to 1 st hop router  IP datagram forwarded from campus network into comcast network, routed (tables created by RIP, OSPF and/or BGP routing protocols) to DNS server  demux’ed to DNS server  DNS server replies to client with IP address of Comcast network /13 DNS server DNS UDP IP Eth Phy DNS

71 5: DataLink Layer5-71 A day in the life… TCP connection carrying HTTP HTTP TCP IP Eth Phy HTTP  to send HTTP request, client first opens TCP socket to web server  TCP SYN segment (step 1 in 3-way handshake) inter- domain routed to web server  TCP connection established! web server SYN TCP IP Eth Phy SYN SYNACK  web server responds with TCP SYNACK (step 2 in 3- way handshake)

72 5: DataLink Layer5-72 A day in the life… HTTP request/reply HTTP TCP IP Eth Phy HTTP  HTTP request sent into TCP socket  IP datagram containing HTTP request routed to  IP datgram containing HTTP reply routed back to client web server HTTP TCP IP Eth Phy  web server responds with HTTP reply (containing web page) HTTP  web page finally (!!!) displayed

73 5: DataLink Layer5-73 Chapter 5: let’s take a breath  journey down protocol stack complete (except PHY)  solid understanding of networking principles, practice  ….. could stop here …. but lots of interesting topics! o Internetworking (CSE 678, TCP/IP, socket programming) o Wireless (ECE xxx) o Multimedia (CSE 679) o Security (CSE 651)


Download ppt "5: DataLink Layer5-1 Link Layer  5.1 Introduction and services  5.2 Error detection and correction  5.3Multiple access protocols  5.4 Link-layer Addressing."

Similar presentations


Ads by Google