1. 5: DataLink Layer5-1 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 Hubs and switches r 5.7 PPP r 5.8 Link Virtualization: ATM

2. 5: DataLink Layer5-2 MAC Addresses and ARP r 32-bit IP address: m network-layer address m used to get datagram to destination IP subnet r MAC (or LAN or physical or Ethernet) address: m used to get datagram from one interface to another physically-connected interface (same network) m 48 bit MAC address (for most LANs) burned in the adapter ROM

3. 5: DataLink Layer5-3 LAN Addresses and ARP Each adapter on LAN has unique LAN address Broadcast address = FF-FF-FF-FF-FF-FF = adapter 1A-2F-BB-76-09-AD 58-23-D7-FA-20-B0 0C-C4-11-6F-E3-98 71-65-F7-2B-08-53 LAN (wired or wireless)

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

5. 5: DataLink Layer5-5 ARP: Address Resolution Protocol r Each IP node (Host, Router) on LAN has ARP table r ARP Table: IP/MAC address mappings for some LAN nodes m TTL (Time To Live): time after which address mapping will be forgotten (typically 20 min) Question: how to determine MAC address of B knowing B’s IP address? 1A-2F-BB-76-09-AD 58-23-D7-FA-20-B0 0C-C4-11-6F-E3-98 71-65-F7-2B-08-53 LAN 237.196.7.23 237.196.7.78 237.196.7.14 237.196.7.88

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

7. 5: DataLink Layer5-7 Routing to another LAN walkthrough: send datagram from A to B via R assume A know’s B IP address r Two ARP tables in router R, one for each IP network (LAN) r In routing table at source Host, find router 111.111.111.110 r In ARP table at source, find MAC address E6-E9-00-17-BB-4B, etc A R B

8. 5: DataLink Layer5-8 r A creates datagram with source A, destination B r A uses ARP to get R’s MAC address for 111.111.111.110 r A creates link-layer frame with R's MAC address as dest, frame contains A-to-B IP datagram r A’s adapter sends frame r R’s adapter receives frame r R removes IP datagram from Ethernet frame, sees its destined to B r R uses ARP to get B’s MAC address r R creates frame containing A-to-B IP datagram sends to B A R B

9. 5: DataLink Layer5-9 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 Hubs and switches r 5.7 PPP r 5.8 Link Virtualization: ATM

10. 5: DataLink Layer5-10 Ethernet “dominant” wired LAN technology: r cheap $20 for 100Mbs! r first widely used LAN technology r Simpler, cheaper than token LANs and ATM r Kept up with speed race: 10 Mbps – 10 Gbps Metcalfe’s Ethernet sketch

11. 5: DataLink Layer5-11 Star topology r Bus topology popular through mid 90s r Now star topology prevails r Connection choices: hub or switch (more later) hub or switch

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

13. 5: DataLink Layer5-13 Ethernet Frame Structure (more) r Addresses: 6 bytes m if adapter receives frame with matching destination address, or with broadcast address (eg ARP packet), it passes data in frame to net-layer protocol m otherwise, adapter discards frame r Type: indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk) r CRC: checked at receiver, if error is detected, the frame is simply dropped

14. 5: DataLink Layer5-14 Unreliable, connectionless service r Connectionless: No handshaking between sending and receiving adapter. r Unreliable: receiving adapter doesn’t send acks or nacks to sending adapter m stream of datagrams passed to network layer can have gaps m gaps will be filled if app is using TCP m otherwise, app will see the gaps

15. 5: DataLink Layer5-15 Ethernet uses CSMA/CD r No slots r adapter doesn’t transmit if it senses that some other adapter is transmitting, that is, carrier sense r transmitting adapter aborts when it senses that another adapter is transmitting, that is, collision detection r Before attempting a retransmission, adapter waits a random time, that is, random access

16. 5: DataLink Layer5-16 CSMA/CD Procedure

17. 5: DataLink Layer5-17 Ethernet CSMA/CD algorithm 1. Adaptor receives datagram from net layer & creates frame 2. If adapter senses channel idle, it starts to transmit frame. If it senses channel busy, waits until channel idle and then transmits 3. If adapter transmits entire frame without detecting another transmission, the adapter is done with frame ! 4. If adapter detects another transmission while transmitting, aborts and sends jam signal 5. After aborting, adapter enters exponential backoff: after the mth collision, adapter chooses a K at random from {0,1,2,…,2 m -1}. Adapter waits K·512 bit times and returns to Step 2

18. 5: DataLink Layer5-18 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: r Goal: adapt retransmission attempts to estimated current load m heavy load: random wait will be longer r first collision: choose K from {0,1}; delay is K· 512 bit transmission times r after second collision: choose K from {0,1,2,3}… r after ten collisions, choose K from {0,1,2,3,4,…,1023}

19. 5: DataLink Layer5-19 10BaseT and 100BaseT r 10/100 Mbps rate; latter called “fast ethernet” r T stands for Twisted Pair r Nodes connect to a hub: “star topology”; 100 m max distance between nodes and hub twisted pair hub

20. 5: DataLink Layer5-20 Hubs Hubs are essentially physical-layer repeaters: m bits coming from one link go out all other links m at the same rate m no frame buffering m no CSMA/CD at hub: adapters detect collisions m provides net management functionality twisted pair hub

21. 5: DataLink Layer5-21 Manchester encoding r Used in 10BaseT r Each bit has a transition r Allows clocks in sending and receiving nodes to synchronize to each other m no need for a centralized, global clock among nodes! r Hey, this is physical-layer stuff!

22. 5: DataLink Layer5-22 Gbit Ethernet r uses standard Ethernet frame format r allows for point-to-point links and shared broadcast channels r in shared mode, CSMA/CD is used; short distances between nodes required for efficiency r uses hubs, called here “Buffered Distributors” r Full-Duplex at 1 Gbps for point-to-point links r 10 Gbps now !

23. 5: DataLink Layer5-23 IEEE 802 Projects

24. 5: DataLink Layer5-24 IEEE 802 Projects r 802.6: DQDB (MAN) (disbanded) r 802.11: Wireless LAN r 802.15: Wireless Personal Area Network(WPAN) r 802.16: Broadband Wireless Access(BBWA) r 802.17: Resilient Packet Ring r 802.18: Radio Regulatory Technical Advisory r 802.19: Coexistence Technical Advisory r 802.20: Mobile Wireless Access r 802.21: Media Independent Handover

25. 5: DataLink Layer5-25 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 Interconnections: Hubs and switches r 5.7 PPP r 5.8 Link Virtualization: ATM

26. 5: DataLink Layer5-26 Interconnecting with hubs r Backbone hub interconnects LAN segments r Extends max distance between nodes r But individual segment collision domains become one large collision domain r Can’t interconnect 10BaseT & 100BaseT hub

27. 5: DataLink Layer5-27 Switch r Link layer device m stores and forwards Ethernet frames m examines frame header and selectively forwards frame based on MAC dest address m when frame is to be forwarded on segment, uses CSMA/CD to access segment r transparent m hosts are unaware of presence of switches r plug-and-play, self-learning m switches do not need to be configured

28. 5: DataLink Layer5-28 Forwarding How do determine onto which LAN segment to forward frame? Looks like a routing problem... hub switch 1 2 3

29. 5: DataLink Layer5-29 Self learning r A switch has a switch table r entry in switch table: m (MAC Address, Interface, Time Stamp) m stale entries in table dropped (TTL can be 60 min) r switch learns which hosts can be reached through which interfaces m when frame received, switch “learns” location of sender: incoming LAN segment m records sender/location pair in switch table

30. 5: DataLink Layer5-30 Filtering/Forwarding When switch receives a frame: index switch table using MAC dest address 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

31. 5: DataLink Layer5-31 Switch example Suppose C sends frame to D r Switch receives frame from from C m notes in bridge table that C is on interface 1 m because D is not in table, switch forwards frame into interfaces 2 and 3 r frame received by D hub switch A B C D E F G H I address interface ABEGABEG 11231123 1 2 3

32. 5: DataLink Layer5-32 Switch example Suppose D replies back with frame to C. r Switch receives frame from from D m notes in bridge table that D is on interface 2 m because C is in table, switch forwards frame only to interface 1 r frame received by C hub switch A B C D E F G H I address interface ABEGCABEGC 1123111231

33. 5: DataLink Layer5-33 Switch: traffic isolation r switch installation breaks subnet into LAN segments r switch filters packets: m same-LAN-segment frames not usually forwarded onto other LAN segments m segments become separate collision domains hub switch collision domain

34. 5: DataLink Layer5-34 Switches: dedicated access r Switch with many interfaces r Hosts have direct connection to switch r No collisions; full duplex Switching: A-to-A’ and B-to-B’ simultaneously, no collisions switch A A’ B B’ C C’

35. 5: DataLink Layer5-35 More on Switches r cut-through switching: frame forwarded from input to output port without first collecting entire frame m slight reduction in latency r combinations of shared/dedicated, 10/100/1000 Mbps interfaces

36. 5: DataLink Layer5-36 Institutional network hub switch to external network router IP subnet mail server web server

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

38. 5: DataLink Layer5-38 Summary comparison

39. 5: DataLink Layer5-39 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 Hubs and switches r 5.7 PPP r 5.8 Link Virtualization: ATM

40. 5: DataLink Layer5-40 Point to Point Data Link Control r one sender, one receiver, one link: easier than broadcast link: m no Media Access Control m no need for explicit MAC addressing m e.g., dialup link, ISDN line r popular point-to-point DLC protocols: m PPP (point-to-point protocol) m HDLC: High level data link control (Data link used to be considered “high layer” in protocol stack!

41. 5: DataLink Layer5-41 PPP in the protocol stack HDLC PPP IP A network layer packet such as IP packet is encapsulated in a PPP packet, and a PPP packet is encapsulated in a HDLC frame.

42. 5: DataLink Layer5-42 Frame Format HDLC frame PPP packet Address field: PPP uses a broadcast address of HDLC, 11111111. Control field: PPP uses a U-frame, its values is 11000000. Protocol field defines what is being carried in the data field.

43. 5: DataLink Layer5-43 PPP Design Requirements [RFC 1557] r packet framing: encapsulation of network-layer datagram in data link frame m carry network layer data of any network layer protocol (not just IP) at same time m ability to demultiplex upwards r bit transparency: must carry any bit pattern in the data field r error detection (no correction) r connection liveness: detect, signal link failure to network layer r network layer address negotiation: endpoint can learn/configure each other’s network address

44. 5: DataLink Layer5-44 PPP non-requirements r no error correction/recovery r no flow control r out of order delivery OK r no need to support multipoint links (e.g., polling) Error recovery, flow control, data re-ordering all relegated to higher layers!

45. 5: DataLink Layer5-45 PPP Data Frame r Flag: delimiter (framing) r Address: does nothing (only one option) r Control: does nothing; in the future possible multiple control fields r Protocol: upper layer protocol to which frame delivered (eg, PPP-LCP, IP, IPCP, etc)

46. 5: DataLink Layer5-46 PPP Data Frame r info: upper layer data being carried r check: cyclic redundancy check for error detection

47. 5: DataLink Layer5-47 Byte Stuffing r “data transparency” requirement: data field must be allowed to include flag pattern m Q: is received data or flag? r Sender: adds (“stuffs”) extra byte after each data byte r Receiver: m two 01111110 bytes in a row: discard first byte, continue data reception m single 01111110: flag byte

48. 5: DataLink Layer5-48 Byte Stuffing flag byte pattern in data to send flag byte pattern plus stuffed byte in transmitted data

49. 5: DataLink Layer5-49 PPP Data Control Protocol Before exchanging network- layer data, data link peers must r configure PPP link (max. frame length, authentication) r learn/configure network layer information m for IP: carry IP Control Protocol (IPCP) msgs (protocol field: 8021) to configure/learn IP address

50. 5: DataLink Layer5-50 Overall Procedure LCP PAP or CHAP NCP(IPCP) IP NCP(IPCP) LCP

51. 5: DataLink Layer5-51 0021 16 PPP Packets Flag address ControlProtocolData FCSFlag IP packet 8021 16 IPCP packet C223 16 CHAP packet C023 16 PAP packet C021 16 LCP packet

52. 5: DataLink Layer5-52 Protocol fields

53. 5: DataLink Layer5-53 LCP Packet LCP is responsible for establishing, maintaining, terminating links. It also provides negotiation mechanisms to set options.

54. 5: DataLink Layer5-54 LCP Packets and codes CodePacket TypeDescription 01 16 Configure-request Contains the list of proposed options and their values 02 16 Configure-ack Accepts all options proposed 03 16 Configure-nak Announces that some options are not acceptable 04 16 Configure-reject Announces that some options are not recognized 05 16 Terminate-request Requests to shut down the line 06 16 Terminate-ack Accepts the shut down request 07 16 Code-reject Announces an unknown code 08 16 Protocol-reject Announces an unknown protocol 09 16 Echo-request A type of hello message to check if the other end is alive 0A 16 Echo-reply The response to the echo-request message 0B 16 Discard-request A request to discard the packet

55. 5: DataLink Layer5-55 PAP (Password Authentication Protocol) PAP is the simplest authentication protocol with two steps.

56. 5: DataLink Layer5-56 PAP Packets

57. 5: DataLink Layer5-57 CHAP (Challenge Handshake Authentication Protocol) r PAP is not enough because a third party can easily pick up the password. r CHAP is a three-way handshake protocol that provides greater security than PAP. m The system sends to the user a challenge packet containing a challenge value. m The user applied the predefined functions that takes the challenge value and user’s password and creates a result. The user sends the result to the system. m The system does the same calculation, and compare its result with the result which the user sent.

58. 5: DataLink Layer5-58 CHAP: three way handshake

59. 5: DataLink Layer5-59 CHAP Packets

60. 5: DataLink Layer5-60 NCP(Network Control Protocol) r NCP is a set of control protocols to allow packets from the network layer to be delivered into a PPP packet. r IPCP is one of NCP protocols for IP packet delivery.

61. 5: DataLink Layer5-61 IPCP Packet

62. 5: DataLink Layer5-62 Code Values for IPCP packets CodeIPCP Packet 01Configure-request 02Configure-ack 03Configure-nak 04Configure-reject 05Terminate-request 06Terminate-ack 07Code-reject

63. 5: DataLink Layer5-63 Example LCP PAP or CHAP NCP(IPCP) IP NCP(IPCP) LCP