3rd Edition, Chapter 5

103
5: DataLink Layer 5-1 Who am I? Peter Desnoyers room 214 [email protected]

description

 

Transcript of 3rd Edition, Chapter 5

Page 1: 3rd Edition, Chapter 5

5 DataLink Layer 5-1

Who am I

Peter Desnoyersroom 214

pjdcsumassedu

5 DataLink Layer 5-2

Chapter 5 The Data Link LayerOur goals understand principles behind data link layer

services framing error detection correction sharing a broadcast channel multiple access link layer addressing reliable data transfer flow control done

instantiation and implementation of various link layer technologies

5 DataLink Layer 5-3

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-4

Link Layer IntroductionSome terminology hosts and routers are nodes communication channels

that connect adjacent nodes along communication path are links wired links wireless links LANs

layer-2 packet is a frame encapsulates datagram

ldquolinkrdquo

data-link layer has responsibility of transferring datagram from one node to adjacent node over a link

5 DataLink Layer 5-5

Link layer context

Datagram transferred by different link protocols over different links eg Ethernet on first

link packet-over-SONET on intermediate links 80211 on last link

Each link protocol provides different services eg may or may not

provide rdt over link

transportation analogy Package from Amherst to NYC

Drive package to UPS Van to central facility Truck to NYC Van to specific address

package = datagram transport segment =

communication link transportation mode = link

layer protocol Package sorting = routing

algorithm

5 DataLink Layer 5-6

Link Layer Services Framing

Higher layers need packets of bytes with beginning end

Physical layer may be a continuous stream of bits

Link access Arbitrate access to shared medium ldquoMACrdquo addresses identify source dest

bull different from IP address Reliable delivery between adjacent nodes

we learned how to do this already (chapter 3) seldom used on low bit error links wireless links high error rates

bull Q why both link-level and end-end reliability

5 DataLink Layer 5-7

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

bull signals sender for retransmission or drops frame

Error Correction receiver identifies and corrects bit error(s)

without resorting to retransmission

5 DataLink Layer 5-8

Adaptors Communicating

link layer implemented in ldquoadaptorrdquo (aka NIC) Ethernet card 80211

card sending side

encapsulates datagram in a frame

adds error checking bits rdt flow control etc

receiving side looks for errors rdt flow

control etc extracts datagram

passes to rcving node

adapter is semi-autonomous

link amp physical layers

sendingnode

frame

rcvingnode

datagram

frame

adapter adapter

link layer protocol

5 DataLink Layer 5-9

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-10

Error DetectionEDC= Error Detection and Correction bits (redundancy)D = Data protected by error checking may include header fields

bull Error detection not 100 reliablebull protocol may miss some errors but rarelybull larger EDC field yields better detection and correction

r EDC bits

5 DataLink Layer 5-11

Parity Checking

Single Bit ParityDetect single bit errors

Two Dimensional Bit ParityDetect and correct single bit errors

0 0

5 DataLink Layer 5-12

Checksumming Cyclic Redundancy Check view data bits D as a binary number choose r+1 bit pattern (generator) G goal choose r CRC bits R such that

ltDRgt exactly divisible by G (modulo 2) receiver knows G divides ltDRgt by G If non-zero

remainder error detected can detect all burst errors less than r+1 bits

widely used in practice (Ethernet hellip)

5 DataLink Layer 5-13

CRC ExampleWant

D2r + R = nGequivalently

D2r = nG + R equivalently if we divide D2r by

G want remainder R

R = remainder[ ]D2r

G

5 DataLink Layer 5-14

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 2: 3rd Edition, Chapter 5

5 DataLink Layer 5-2

Chapter 5 The Data Link LayerOur goals understand principles behind data link layer

services framing error detection correction sharing a broadcast channel multiple access link layer addressing reliable data transfer flow control done

instantiation and implementation of various link layer technologies

5 DataLink Layer 5-3

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-4

Link Layer IntroductionSome terminology hosts and routers are nodes communication channels

that connect adjacent nodes along communication path are links wired links wireless links LANs

layer-2 packet is a frame encapsulates datagram

ldquolinkrdquo

data-link layer has responsibility of transferring datagram from one node to adjacent node over a link

5 DataLink Layer 5-5

Link layer context

Datagram transferred by different link protocols over different links eg Ethernet on first

link packet-over-SONET on intermediate links 80211 on last link

Each link protocol provides different services eg may or may not

provide rdt over link

transportation analogy Package from Amherst to NYC

Drive package to UPS Van to central facility Truck to NYC Van to specific address

package = datagram transport segment =

communication link transportation mode = link

layer protocol Package sorting = routing

algorithm

5 DataLink Layer 5-6

Link Layer Services Framing

Higher layers need packets of bytes with beginning end

Physical layer may be a continuous stream of bits

Link access Arbitrate access to shared medium ldquoMACrdquo addresses identify source dest

bull different from IP address Reliable delivery between adjacent nodes

we learned how to do this already (chapter 3) seldom used on low bit error links wireless links high error rates

bull Q why both link-level and end-end reliability

5 DataLink Layer 5-7

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

bull signals sender for retransmission or drops frame

Error Correction receiver identifies and corrects bit error(s)

without resorting to retransmission

5 DataLink Layer 5-8

Adaptors Communicating

link layer implemented in ldquoadaptorrdquo (aka NIC) Ethernet card 80211

card sending side

encapsulates datagram in a frame

adds error checking bits rdt flow control etc

receiving side looks for errors rdt flow

control etc extracts datagram

passes to rcving node

adapter is semi-autonomous

link amp physical layers

sendingnode

frame

rcvingnode

datagram

frame

adapter adapter

link layer protocol

5 DataLink Layer 5-9

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-10

Error DetectionEDC= Error Detection and Correction bits (redundancy)D = Data protected by error checking may include header fields

bull Error detection not 100 reliablebull protocol may miss some errors but rarelybull larger EDC field yields better detection and correction

r EDC bits

5 DataLink Layer 5-11

Parity Checking

Single Bit ParityDetect single bit errors

Two Dimensional Bit ParityDetect and correct single bit errors

0 0

5 DataLink Layer 5-12

Checksumming Cyclic Redundancy Check view data bits D as a binary number choose r+1 bit pattern (generator) G goal choose r CRC bits R such that

ltDRgt exactly divisible by G (modulo 2) receiver knows G divides ltDRgt by G If non-zero

remainder error detected can detect all burst errors less than r+1 bits

widely used in practice (Ethernet hellip)

5 DataLink Layer 5-13

CRC ExampleWant

D2r + R = nGequivalently

D2r = nG + R equivalently if we divide D2r by

G want remainder R

R = remainder[ ]D2r

G

5 DataLink Layer 5-14

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 3: 3rd Edition, Chapter 5

5 DataLink Layer 5-3

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-4

Link Layer IntroductionSome terminology hosts and routers are nodes communication channels

that connect adjacent nodes along communication path are links wired links wireless links LANs

layer-2 packet is a frame encapsulates datagram

ldquolinkrdquo

data-link layer has responsibility of transferring datagram from one node to adjacent node over a link

5 DataLink Layer 5-5

Link layer context

Datagram transferred by different link protocols over different links eg Ethernet on first

link packet-over-SONET on intermediate links 80211 on last link

Each link protocol provides different services eg may or may not

provide rdt over link

transportation analogy Package from Amherst to NYC

Drive package to UPS Van to central facility Truck to NYC Van to specific address

package = datagram transport segment =

communication link transportation mode = link

layer protocol Package sorting = routing

algorithm

5 DataLink Layer 5-6

Link Layer Services Framing

Higher layers need packets of bytes with beginning end

Physical layer may be a continuous stream of bits

Link access Arbitrate access to shared medium ldquoMACrdquo addresses identify source dest

bull different from IP address Reliable delivery between adjacent nodes

we learned how to do this already (chapter 3) seldom used on low bit error links wireless links high error rates

bull Q why both link-level and end-end reliability

5 DataLink Layer 5-7

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

bull signals sender for retransmission or drops frame

Error Correction receiver identifies and corrects bit error(s)

without resorting to retransmission

5 DataLink Layer 5-8

Adaptors Communicating

link layer implemented in ldquoadaptorrdquo (aka NIC) Ethernet card 80211

card sending side

encapsulates datagram in a frame

adds error checking bits rdt flow control etc

receiving side looks for errors rdt flow

control etc extracts datagram

passes to rcving node

adapter is semi-autonomous

link amp physical layers

sendingnode

frame

rcvingnode

datagram

frame

adapter adapter

link layer protocol

5 DataLink Layer 5-9

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-10

Error DetectionEDC= Error Detection and Correction bits (redundancy)D = Data protected by error checking may include header fields

bull Error detection not 100 reliablebull protocol may miss some errors but rarelybull larger EDC field yields better detection and correction

r EDC bits

5 DataLink Layer 5-11

Parity Checking

Single Bit ParityDetect single bit errors

Two Dimensional Bit ParityDetect and correct single bit errors

0 0

5 DataLink Layer 5-12

Checksumming Cyclic Redundancy Check view data bits D as a binary number choose r+1 bit pattern (generator) G goal choose r CRC bits R such that

ltDRgt exactly divisible by G (modulo 2) receiver knows G divides ltDRgt by G If non-zero

remainder error detected can detect all burst errors less than r+1 bits

widely used in practice (Ethernet hellip)

5 DataLink Layer 5-13

CRC ExampleWant

D2r + R = nGequivalently

D2r = nG + R equivalently if we divide D2r by

G want remainder R

R = remainder[ ]D2r

G

5 DataLink Layer 5-14

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 4: 3rd Edition, Chapter 5

5 DataLink Layer 5-4

Link Layer IntroductionSome terminology hosts and routers are nodes communication channels

that connect adjacent nodes along communication path are links wired links wireless links LANs

layer-2 packet is a frame encapsulates datagram

ldquolinkrdquo

data-link layer has responsibility of transferring datagram from one node to adjacent node over a link

5 DataLink Layer 5-5

Link layer context

Datagram transferred by different link protocols over different links eg Ethernet on first

link packet-over-SONET on intermediate links 80211 on last link

Each link protocol provides different services eg may or may not

provide rdt over link

transportation analogy Package from Amherst to NYC

Drive package to UPS Van to central facility Truck to NYC Van to specific address

package = datagram transport segment =

communication link transportation mode = link

layer protocol Package sorting = routing

algorithm

5 DataLink Layer 5-6

Link Layer Services Framing

Higher layers need packets of bytes with beginning end

Physical layer may be a continuous stream of bits

Link access Arbitrate access to shared medium ldquoMACrdquo addresses identify source dest

bull different from IP address Reliable delivery between adjacent nodes

we learned how to do this already (chapter 3) seldom used on low bit error links wireless links high error rates

bull Q why both link-level and end-end reliability

5 DataLink Layer 5-7

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

bull signals sender for retransmission or drops frame

Error Correction receiver identifies and corrects bit error(s)

without resorting to retransmission

5 DataLink Layer 5-8

Adaptors Communicating

link layer implemented in ldquoadaptorrdquo (aka NIC) Ethernet card 80211

card sending side

encapsulates datagram in a frame

adds error checking bits rdt flow control etc

receiving side looks for errors rdt flow

control etc extracts datagram

passes to rcving node

adapter is semi-autonomous

link amp physical layers

sendingnode

frame

rcvingnode

datagram

frame

adapter adapter

link layer protocol

5 DataLink Layer 5-9

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-10

Error DetectionEDC= Error Detection and Correction bits (redundancy)D = Data protected by error checking may include header fields

bull Error detection not 100 reliablebull protocol may miss some errors but rarelybull larger EDC field yields better detection and correction

r EDC bits

5 DataLink Layer 5-11

Parity Checking

Single Bit ParityDetect single bit errors

Two Dimensional Bit ParityDetect and correct single bit errors

0 0

5 DataLink Layer 5-12

Checksumming Cyclic Redundancy Check view data bits D as a binary number choose r+1 bit pattern (generator) G goal choose r CRC bits R such that

ltDRgt exactly divisible by G (modulo 2) receiver knows G divides ltDRgt by G If non-zero

remainder error detected can detect all burst errors less than r+1 bits

widely used in practice (Ethernet hellip)

5 DataLink Layer 5-13

CRC ExampleWant

D2r + R = nGequivalently

D2r = nG + R equivalently if we divide D2r by

G want remainder R

R = remainder[ ]D2r

G

5 DataLink Layer 5-14

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 5: 3rd Edition, Chapter 5

5 DataLink Layer 5-5

Link layer context

Datagram transferred by different link protocols over different links eg Ethernet on first

link packet-over-SONET on intermediate links 80211 on last link

Each link protocol provides different services eg may or may not

provide rdt over link

transportation analogy Package from Amherst to NYC

Drive package to UPS Van to central facility Truck to NYC Van to specific address

package = datagram transport segment =

communication link transportation mode = link

layer protocol Package sorting = routing

algorithm

5 DataLink Layer 5-6

Link Layer Services Framing

Higher layers need packets of bytes with beginning end

Physical layer may be a continuous stream of bits

Link access Arbitrate access to shared medium ldquoMACrdquo addresses identify source dest

bull different from IP address Reliable delivery between adjacent nodes

we learned how to do this already (chapter 3) seldom used on low bit error links wireless links high error rates

bull Q why both link-level and end-end reliability

5 DataLink Layer 5-7

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

bull signals sender for retransmission or drops frame

Error Correction receiver identifies and corrects bit error(s)

without resorting to retransmission

5 DataLink Layer 5-8

Adaptors Communicating

link layer implemented in ldquoadaptorrdquo (aka NIC) Ethernet card 80211

card sending side

encapsulates datagram in a frame

adds error checking bits rdt flow control etc

receiving side looks for errors rdt flow

control etc extracts datagram

passes to rcving node

adapter is semi-autonomous

link amp physical layers

sendingnode

frame

rcvingnode

datagram

frame

adapter adapter

link layer protocol

5 DataLink Layer 5-9

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-10

Error DetectionEDC= Error Detection and Correction bits (redundancy)D = Data protected by error checking may include header fields

bull Error detection not 100 reliablebull protocol may miss some errors but rarelybull larger EDC field yields better detection and correction

r EDC bits

5 DataLink Layer 5-11

Parity Checking

Single Bit ParityDetect single bit errors

Two Dimensional Bit ParityDetect and correct single bit errors

0 0

5 DataLink Layer 5-12

Checksumming Cyclic Redundancy Check view data bits D as a binary number choose r+1 bit pattern (generator) G goal choose r CRC bits R such that

ltDRgt exactly divisible by G (modulo 2) receiver knows G divides ltDRgt by G If non-zero

remainder error detected can detect all burst errors less than r+1 bits

widely used in practice (Ethernet hellip)

5 DataLink Layer 5-13

CRC ExampleWant

D2r + R = nGequivalently

D2r = nG + R equivalently if we divide D2r by

G want remainder R

R = remainder[ ]D2r

G

5 DataLink Layer 5-14

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 6: 3rd Edition, Chapter 5

5 DataLink Layer 5-6

Link Layer Services Framing

Higher layers need packets of bytes with beginning end

Physical layer may be a continuous stream of bits

Link access Arbitrate access to shared medium ldquoMACrdquo addresses identify source dest

bull different from IP address Reliable delivery between adjacent nodes

we learned how to do this already (chapter 3) seldom used on low bit error links wireless links high error rates

bull Q why both link-level and end-end reliability

5 DataLink Layer 5-7

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

bull signals sender for retransmission or drops frame

Error Correction receiver identifies and corrects bit error(s)

without resorting to retransmission

5 DataLink Layer 5-8

Adaptors Communicating

link layer implemented in ldquoadaptorrdquo (aka NIC) Ethernet card 80211

card sending side

encapsulates datagram in a frame

adds error checking bits rdt flow control etc

receiving side looks for errors rdt flow

control etc extracts datagram

passes to rcving node

adapter is semi-autonomous

link amp physical layers

sendingnode

frame

rcvingnode

datagram

frame

adapter adapter

link layer protocol

5 DataLink Layer 5-9

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-10

Error DetectionEDC= Error Detection and Correction bits (redundancy)D = Data protected by error checking may include header fields

bull Error detection not 100 reliablebull protocol may miss some errors but rarelybull larger EDC field yields better detection and correction

r EDC bits

5 DataLink Layer 5-11

Parity Checking

Single Bit ParityDetect single bit errors

Two Dimensional Bit ParityDetect and correct single bit errors

0 0

5 DataLink Layer 5-12

Checksumming Cyclic Redundancy Check view data bits D as a binary number choose r+1 bit pattern (generator) G goal choose r CRC bits R such that

ltDRgt exactly divisible by G (modulo 2) receiver knows G divides ltDRgt by G If non-zero

remainder error detected can detect all burst errors less than r+1 bits

widely used in practice (Ethernet hellip)

5 DataLink Layer 5-13

CRC ExampleWant

D2r + R = nGequivalently

D2r = nG + R equivalently if we divide D2r by

G want remainder R

R = remainder[ ]D2r

G

5 DataLink Layer 5-14

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 7: 3rd Edition, Chapter 5

5 DataLink Layer 5-7

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

bull signals sender for retransmission or drops frame

Error Correction receiver identifies and corrects bit error(s)

without resorting to retransmission

5 DataLink Layer 5-8

Adaptors Communicating

link layer implemented in ldquoadaptorrdquo (aka NIC) Ethernet card 80211

card sending side

encapsulates datagram in a frame

adds error checking bits rdt flow control etc

receiving side looks for errors rdt flow

control etc extracts datagram

passes to rcving node

adapter is semi-autonomous

link amp physical layers

sendingnode

frame

rcvingnode

datagram

frame

adapter adapter

link layer protocol

5 DataLink Layer 5-9

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-10

Error DetectionEDC= Error Detection and Correction bits (redundancy)D = Data protected by error checking may include header fields

bull Error detection not 100 reliablebull protocol may miss some errors but rarelybull larger EDC field yields better detection and correction

r EDC bits

5 DataLink Layer 5-11

Parity Checking

Single Bit ParityDetect single bit errors

Two Dimensional Bit ParityDetect and correct single bit errors

0 0

5 DataLink Layer 5-12

Checksumming Cyclic Redundancy Check view data bits D as a binary number choose r+1 bit pattern (generator) G goal choose r CRC bits R such that

ltDRgt exactly divisible by G (modulo 2) receiver knows G divides ltDRgt by G If non-zero

remainder error detected can detect all burst errors less than r+1 bits

widely used in practice (Ethernet hellip)

5 DataLink Layer 5-13

CRC ExampleWant

D2r + R = nGequivalently

D2r = nG + R equivalently if we divide D2r by

G want remainder R

R = remainder[ ]D2r

G

5 DataLink Layer 5-14

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 8: 3rd Edition, Chapter 5

5 DataLink Layer 5-8

Adaptors Communicating

link layer implemented in ldquoadaptorrdquo (aka NIC) Ethernet card 80211

card sending side

encapsulates datagram in a frame

adds error checking bits rdt flow control etc

receiving side looks for errors rdt flow

control etc extracts datagram

passes to rcving node

adapter is semi-autonomous

link amp physical layers

sendingnode

frame

rcvingnode

datagram

frame

adapter adapter

link layer protocol

5 DataLink Layer 5-9

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-10

Error DetectionEDC= Error Detection and Correction bits (redundancy)D = Data protected by error checking may include header fields

bull Error detection not 100 reliablebull protocol may miss some errors but rarelybull larger EDC field yields better detection and correction

r EDC bits

5 DataLink Layer 5-11

Parity Checking

Single Bit ParityDetect single bit errors

Two Dimensional Bit ParityDetect and correct single bit errors

0 0

5 DataLink Layer 5-12

Checksumming Cyclic Redundancy Check view data bits D as a binary number choose r+1 bit pattern (generator) G goal choose r CRC bits R such that

ltDRgt exactly divisible by G (modulo 2) receiver knows G divides ltDRgt by G If non-zero

remainder error detected can detect all burst errors less than r+1 bits

widely used in practice (Ethernet hellip)

5 DataLink Layer 5-13

CRC ExampleWant

D2r + R = nGequivalently

D2r = nG + R equivalently if we divide D2r by

G want remainder R

R = remainder[ ]D2r

G

5 DataLink Layer 5-14

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 9: 3rd Edition, Chapter 5

5 DataLink Layer 5-9

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-10

Error DetectionEDC= Error Detection and Correction bits (redundancy)D = Data protected by error checking may include header fields

bull Error detection not 100 reliablebull protocol may miss some errors but rarelybull larger EDC field yields better detection and correction

r EDC bits

5 DataLink Layer 5-11

Parity Checking

Single Bit ParityDetect single bit errors

Two Dimensional Bit ParityDetect and correct single bit errors

0 0

5 DataLink Layer 5-12

Checksumming Cyclic Redundancy Check view data bits D as a binary number choose r+1 bit pattern (generator) G goal choose r CRC bits R such that

ltDRgt exactly divisible by G (modulo 2) receiver knows G divides ltDRgt by G If non-zero

remainder error detected can detect all burst errors less than r+1 bits

widely used in practice (Ethernet hellip)

5 DataLink Layer 5-13

CRC ExampleWant

D2r + R = nGequivalently

D2r = nG + R equivalently if we divide D2r by

G want remainder R

R = remainder[ ]D2r

G

5 DataLink Layer 5-14

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 10: 3rd Edition, Chapter 5

5 DataLink Layer 5-10

Error DetectionEDC= Error Detection and Correction bits (redundancy)D = Data protected by error checking may include header fields

bull Error detection not 100 reliablebull protocol may miss some errors but rarelybull larger EDC field yields better detection and correction

r EDC bits

5 DataLink Layer 5-11

Parity Checking

Single Bit ParityDetect single bit errors

Two Dimensional Bit ParityDetect and correct single bit errors

0 0

5 DataLink Layer 5-12

Checksumming Cyclic Redundancy Check view data bits D as a binary number choose r+1 bit pattern (generator) G goal choose r CRC bits R such that

ltDRgt exactly divisible by G (modulo 2) receiver knows G divides ltDRgt by G If non-zero

remainder error detected can detect all burst errors less than r+1 bits

widely used in practice (Ethernet hellip)

5 DataLink Layer 5-13

CRC ExampleWant

D2r + R = nGequivalently

D2r = nG + R equivalently if we divide D2r by

G want remainder R

R = remainder[ ]D2r

G

5 DataLink Layer 5-14

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 11: 3rd Edition, Chapter 5

5 DataLink Layer 5-11

Parity Checking

Single Bit ParityDetect single bit errors

Two Dimensional Bit ParityDetect and correct single bit errors

0 0

5 DataLink Layer 5-12

Checksumming Cyclic Redundancy Check view data bits D as a binary number choose r+1 bit pattern (generator) G goal choose r CRC bits R such that

ltDRgt exactly divisible by G (modulo 2) receiver knows G divides ltDRgt by G If non-zero

remainder error detected can detect all burst errors less than r+1 bits

widely used in practice (Ethernet hellip)

5 DataLink Layer 5-13

CRC ExampleWant

D2r + R = nGequivalently

D2r = nG + R equivalently if we divide D2r by

G want remainder R

R = remainder[ ]D2r

G

5 DataLink Layer 5-14

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 12: 3rd Edition, Chapter 5

5 DataLink Layer 5-12

Checksumming Cyclic Redundancy Check view data bits D as a binary number choose r+1 bit pattern (generator) G goal choose r CRC bits R such that

ltDRgt exactly divisible by G (modulo 2) receiver knows G divides ltDRgt by G If non-zero

remainder error detected can detect all burst errors less than r+1 bits

widely used in practice (Ethernet hellip)

5 DataLink Layer 5-13

CRC ExampleWant

D2r + R = nGequivalently

D2r = nG + R equivalently if we divide D2r by

G want remainder R

R = remainder[ ]D2r

G

5 DataLink Layer 5-14

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 13: 3rd Edition, Chapter 5

5 DataLink Layer 5-13

CRC ExampleWant

D2r + R = nGequivalently

D2r = nG + R equivalently if we divide D2r by

G want remainder R

R = remainder[ ]D2r

G

5 DataLink Layer 5-14

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 14: 3rd Edition, Chapter 5

5 DataLink Layer 5-14

Link Layer

51 Introduction and services

52 Error detection and correction

53 Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 15: 3rd Edition, Chapter 5

5 DataLink Layer 5-15

Multiple Access Links and Protocols

Two types of ldquolinksrdquo point-to-point ndash eg

PPP for dial-up access DSL point-to-point link between Ethernet switch and host

broadcast (shared wire or medium) traditional Ethernet Cable modem 80211 wireless LAN

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 16: 3rd Edition, Chapter 5

5 DataLink Layer 5-16

Multiple Access 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 ie determine when node can transmit communication about channel sharing must use

channel itself no out-of-band channel for coordination Q why

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 17: 3rd Edition, Chapter 5

5 DataLink Layer 5-17

Ideal Multiple Access Protocol

Broadcast channel of rate R bps1 When one node wants to transmit it can send

at rate R2 When M nodes want to transmit each can

send at average rate RM3 Fully decentralized

no special node to coordinate transmissions no synchronization of clocks slots

4 Simple

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 18: 3rd Edition, Chapter 5

5 DataLink Layer 5-18

MAC Protocols a taxonomy

Three broad classes Channel Partitioning

divide channel into smaller ldquopiecesrdquo (time slots frequency code)

allocate piece to node for exclusive use

Random Access channel not divided allow collisions ldquorecoverrdquo from collisions

ldquoTaking turnsrdquo Nodes take turns but nodes with more to send can

take longer turns

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 19: 3rd Edition, Chapter 5

5 DataLink Layer 5-19

Traffic types another taxonomy

Elastic demand Send as much as you can as quickly as you

can Example file download

Inelastic demand Send only as much as you need to Example voice

In this section we consider elastic demand only

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 20: 3rd Edition, Chapter 5

5 DataLink Layer 5-20

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 134 have pkt slots 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 21: 3rd Edition, Chapter 5

5 DataLink Layer 5-21

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 134 have pkt frequency bands 256 idle

TDM (Time Division Multiplexing) channel divided into N time slots one per user inefficient with low duty cycle users and at light load

FDM (Frequency Division Multiplexing) frequency subdivided

frequ

ency

bands time

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 22: 3rd Edition, Chapter 5

5 DataLink Layer 5-22

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 ldquocollisionrdquo random access MAC protocol specifies

how to detect collisions how to recover from collisions (eg via delayed

retransmissions)

Examples of random access MAC protocols ALOHA slotted ALOHA CSMA CSMACD CSMACA

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 23: 3rd Edition, Chapter 5

5 DataLink Layer 5-23

Slotted ALOHA

Assumptions all frames same size time is divided into

equal size slots time to transmit 1 frame

nodes start to transmit frames only at beginning of slots

nodes are synchronized if 2 or more nodes

transmit in slot all nodes detect collision

Operation when node obtains fresh

frame it transmits in next slot

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-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 24: 3rd Edition, Chapter 5

5 DataLink Layer 5-24

Slotted ALOHA

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-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 25: 3rd Edition, Chapter 5

5 DataLink Layer 5-25

Slotted ALOHA efficiency

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 26: 3rd Edition, Chapter 5

5 DataLink Layer 5-26

Slotted Aloha efficiency

Suppose N nodes with many frames to send each transmits in slot with probability p

prob that node 1 has success in a slot = p(1-p)N-1

prob that any node has a success = Np(1-p)N-1

For max efficiency with N nodes 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 1e = 37

Efficiency is the long-run fraction of successful slots when there are many nodes each with many frames to send

At best channelused for useful transmissions 37of time

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 27: 3rd Edition, Chapter 5

5 DataLink Layer 5-27

Pure (unslotted) ALOHA unslotted Aloha simpler no synchronization when frame first arrives

transmit immediately

collision probability increases frame sent at t0 collides with other frames sent in [t0-

1t0+1]

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 28: 3rd Edition, Chapter 5

5 DataLink Layer 5-28

Pure Aloha efficiencyP(success by given node) = P(node transmits)

P(no other node transmits in [p0-1p0]

P(no other node transmits in [p0-1p0]

= p (1-p)N-1 (1-p)N-1

= p (1-p)2(N-1)

hellip choosing optimum p and then letting n -gt infty

= 1(2e) = 18 Even worse

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 29: 3rd Edition, Chapter 5

5 DataLink Layer 5-29

CSMA (Carrier Sense Multiple Access)

CSMA listen before transmitIf channel sensed idle transmit entire frame If channel sensed busy defer transmission

Human analogy donrsquot interrupt others

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 30: 3rd Edition, Chapter 5

5 DataLink Layer 5-30

CSMA collisions

collisions can still occurpropagation delay means two nodes may not heareach otherrsquos transmissioncollisionentire packet transmission time wastednoterole of distance amp propagation delay in determining collision probability

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 31: 3rd Edition, Chapter 5

5 DataLink Layer 5-31

CSMACD (Collision Detection)CSMACD 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 receiver shut off while transmitting

human analogy the polite conversationalist

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 32: 3rd Edition, Chapter 5

5 DataLink Layer 5-32

CSMACD collision detection

If yoursquore going to collidedo it quickly and get onwith ithellip

Q if collisions are 10 timesfaster than packets thenwhat is the actual efficiency

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 33: 3rd Edition, Chapter 5

5 DataLink Layer 5-33

ldquoTaking Turnsrdquo MAC protocolschannel partitioning MAC protocols

share channel efficiently and fairly at high load

inefficient at low load delay in channel access 1N 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

ldquotaking turnsrdquo protocolslook for best of both worlds

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 34: 3rd Edition, Chapter 5

5 DataLink Layer 5-34

ldquoTaking Turnsrdquo MAC protocolsPolling master node

ldquoinvitesrdquo slave nodes to transmit in turn

concerns polling overhead latency single point of

failure (master)

Token passing control token passed

from one node to next sequentially

token message concerns

token overhead latency multiple points of failure

Q is it always importantfor the slave nodes tocontinue when the masterfails

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 35: 3rd Edition, Chapter 5

5 DataLink Layer 5-35

Summary of MAC protocols

What do you do with a shared media Channel Partitioning by time frequency or

codebull Time Division Frequency Division

Random partitioning (dynamic) bull ALOHA S-ALOHA CSMA CSMACDbull carrier sensing easy in some technologies (wire)

hard in others (wireless)bull CSMACD used in Ethernetbull CSMACA used in 80211

Taking Turnsbull polling token ring

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 36: 3rd Edition, Chapter 5

5 DataLink Layer 5-36

LAN technologies

Data link layer so far services error detectioncorrection multiple

access

Next LAN technologies addressing Ethernet hubs switches

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 37: 3rd Edition, Chapter 5

5 DataLink Layer 5-37

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 38: 3rd Edition, Chapter 5

5 DataLink Layer 5-38

MAC Addresses

MAC = Media Access Control All stations receive all packets Only keep packets for our address or

explicit broadcast packets

Q why use MAC addresses instead of just snooping for our IP address

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 39: 3rd Edition, Chapter 5

5 DataLink Layer 5-39

MAC Addresses and ARP

32-bit IP address network-layer address used to get datagram to destination IP subnet

MAC (or LAN or physical or Ethernet) address used to get frame from one interface to

another physically-connected interface (same network)

48 bit IEEE MAC address (for most LANs) burned in the adapter ROM

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 40: 3rd Edition, Chapter 5

5 DataLink Layer 5-40

LAN Addresses and ARPEach 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 orwireless)

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 41: 3rd Edition, Chapter 5

5 DataLink Layer 5-41

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

can move LAN card from one LAN to another

IP hierarchical address NOT portable depends on IP subnet to which node is attached

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 42: 3rd Edition, Chapter 5

5 DataLink Layer 5-42

ARP Address Resolution Protocol

Each IP node (Host Router) on LAN has ARP table

ARP Table IPMAC address mappings for some LAN nodes

lt IP address MAC address TTLgt

TTL (Time To Live) time after which address mapping will be forgotten (typically 20 min)

Question how to determineMAC address of Bknowing Brsquos 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

237196723

237196778

237196714

237196788

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 43: 3rd Edition, Chapter 5

5 DataLink Layer 5-43

ARP protocol Same LAN (network) A wants to send datagram

to B and Brsquos MAC address not in Arsquos ARP table

A broadcasts ARP query packet containing Bs IP address Dest MAC address = FF-

FF-FF-FF-FF-FF all machines on LAN

receive ARP query B receives ARP packet

replies to A with its (Bs) MAC address frame sent to Arsquos MAC

address (unicast)

A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) soft state information

that times out (goes away) unless refreshed

ARP is ldquoplug-and-playrdquo nodes create their ARP

tables without intervention from net administrator

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 44: 3rd Edition, Chapter 5

5 DataLink Layer 5-44

ARP traceFrame 203 (42 bytes on wire 42 bytes captured)Address Resolution Protocol (request) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode request (0x0001) Sender MAC address DellComp_5e40b9 (00065b5e40b9) Sender IP address 12811924581 (12811924581) Target MAC address 000000_000000 (000000000000) Target IP address 128119245254 (128119245254)

Frame 204 (60 bytes on wire 60 bytes captured)Address Resolution Protocol (reply) Hardware type Ethernet (0x0001) Protocol type IP (0x0800) Opcode reply (0x0002) Sender MAC address DigitalE_00e80b (aa000400e80b) Sender IP address 128119245254 (128119245254) Target MAC address DellComp_5e40b9 (00065b5e40b9) Target IP address 12811924581 (12811924581)

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 45: 3rd Edition, Chapter 5

5 DataLink Layer 5-45

Routing to another LANwalkthrough send datagram from A to B via R assume A knows B IP address

Two ARP tables in router R one for each IP network (LAN)

In routing table at source Host find router 111111111110 In ARP table at source find MAC address E6-E9-00-17-BB-4B etc

A

RB

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 46: 3rd Edition, Chapter 5

5 DataLink Layer 5-46

A creates datagram with source A destination B A uses ARP to get Rrsquos MAC address for 111111111110 A creates link-layer frame with Rs MAC address as dest

frame contains A-to-B IP datagram Arsquos adapter sends frame Rrsquos adapter receives frame R removes IP datagram from Ethernet frame sees its

destined to B R uses ARP to get Brsquos MAC address R creates frame containing A-to-B IP datagram sends to B

A

RB

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 47: 3rd Edition, Chapter 5

5 DataLink Layer 5-47

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 48: 3rd Edition, Chapter 5

5 DataLink Layer 5-48

Ethernetldquodominantrdquo wired LAN technology cheap - $20 for 1000Mbs first widely used LAN technology Simpler cheaper than token LANs and ATM Kept up with speed race 10 Mbps ndash 10 Gbps

Metcalfersquos Ethernetsketch

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 49: 3rd Edition, Chapter 5

5 DataLink Layer 5-49

Ethernet Bus implementations

Early days ndashthe vampire tap

Later ldquothinnetrdquo(coax with Tconnectors)

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 50: 3rd Edition, Chapter 5

5 DataLink Layer 5-50

Star topology

Twisted pair is better (trust me) 10baseT introduced in early 90s never went

back Connection choices hub or switch

hub orswitch

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 51: 3rd Edition, Chapter 5

5 DataLink Layer 5-51

HubsHubs are essentially physical-layer repeaters

bits coming from one link go out all other links at the same rate (or bits get scrambledhellip) no frame buffering no CSMACD at hub adapters detect collisions

twisted pair

hub

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 52: 3rd Edition, Chapter 5

5 DataLink Layer 5-52

Meeting room analogy

Bus conference room

Hub conference call

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 53: 3rd Edition, Chapter 5

5 DataLink Layer 5-53

Ethernet Frame Structure

Sending adapter encapsulates IP datagram (or other network layer protocol packet) in Ethernet frame

Preamble 7 bytes with pattern 10101010 followed by one

byte with pattern 10101011 used to synchronize receiver sender clock

rates

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 54: 3rd Edition, Chapter 5

5 DataLink Layer 5-54

Ethernet Frame Structure (more) Addresses 6 bytes

if adapter receives frame with matching destination address or with broadcast address (eg ARP packet) it passes data in frame to net-layer protocol

otherwise adapter discards frame

Type indicates the higher layer protocol (mostly IP but others may be supported such as Novell IPX and AppleTalk)

CRC checked at receiver if error is detected the frame is simply dropped

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 55: 3rd Edition, Chapter 5

5 DataLink Layer 5-55

Unreliable connectionless service Connectionless No handshaking between

sending and receiving adapter Unreliable receiving adapter doesnrsquot send

acks or nacks to sending adapter stream of datagrams passed to network layer can

have gaps gaps will be filled if app is using TCP otherwise app will see the gaps

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 56: 3rd Edition, Chapter 5

5 DataLink Layer 5-56

Ethernet uses CSMACD

No slots adapter doesnrsquot

transmit if it senses that some other adapter is transmitting that is carrier sense

transmitting adapter aborts when it senses that another adapter is transmitting that is collision detection

Before attempting a retransmission adapter waits a random time that is random access

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 57: 3rd Edition, Chapter 5

5 DataLink Layer 5-57

Ethernet CSMACD algorithm

1 Adaptor receives datagram from net layer amp 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 012hellip2m-1 Adapter waits K512 bit times and returns to Step 2

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 58: 3rd Edition, Chapter 5

5 DataLink Layer 5-58

Ethernetrsquos CSMACD (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 heavy load random wait

will be longer first collision choose K

from 01 delay is K 512 bit transmission times

after second collision choose K from 0123hellip

after ten collisions choose K from 01234hellip1023

Seeinteract with Javaapplet on AWL Web sitehighly recommended

Q where have we seen exponential backoff before

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 59: 3rd Edition, Chapter 5

5 DataLink Layer 5-59

CSMACD efficiency Tprop = max prop between 2 nodes in LAN

ttrans = time to transmit max-size frame

Efficiency goes to 1 as tprop goes to 0

Goes to 1 as ttrans goes to infinity

Much better than ALOHA but still decentralized simple and cheap

transprop tt 51

1efficiency

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 60: 3rd Edition, Chapter 5

5 DataLink Layer 5-60

10BaseT and 100BaseT 10100 Mbps rate latter called ldquofast ethernetrdquo T stands for Twisted Pair Nodes connect to a hub ldquostar topologyrdquo 100

m max distance between nodes and hub

twisted pair

hub

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 61: 3rd Edition, Chapter 5

5 DataLink Layer 5-61

Manchester encoding

Used in 10BaseT 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-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 62: 3rd Edition, Chapter 5

5 DataLink Layer 5-62

Gbit Ethernet

uses standard Ethernet frame format allows for point-to-point links and shared

broadcast channels in shared mode CSMACD is used short

distances between nodes required for efficiency

uses hubs called here ldquoBuffered Distributorsrdquo Full-Duplex at 1 Gbps for point-to-point links 10 Gbps now

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 63: 3rd Edition, Chapter 5

5 DataLink Layer 5-63

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Interconnections Hubs and switches

57 PPP

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 64: 3rd Edition, Chapter 5

5 DataLink Layer 5-64

Interconnecting with hubs Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large

collision domain Canrsquot interconnect 10BaseT amp 100BaseT

hub

hubhub

hub

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 65: 3rd Edition, Chapter 5

5 DataLink Layer 5-65

Switch Link layer device

stores and forwards Ethernet frames examines frame header and selectively forwards

frame based on MAC dest address when frame is to be forwarded on segment uses

CSMACD 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-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 66: 3rd Edition, Chapter 5

5 DataLink Layer 5-66

Forwarding

bull How do determine onto which LAN segment to forward framebull Looks like a routing problem

hub

hubhub

switch1

2 3

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 67: 3rd Edition, Chapter 5

5 DataLink Layer 5-67

Self learning

A switch has a switch table entry in switch table

(MAC Address Interface Time Stamp) stale entries in table dropped (TTL can be 60

min) switch learns which hosts can be reached through

which interfaces when frame received switch ldquolearnsrdquo location

of sender incoming LAN segment records senderlocation pair in switch table

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 68: 3rd Edition, Chapter 5

5 DataLink Layer 5-68

FilteringForwardingWhen switch receives a frame

index switch table using MAC dest addressif 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-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 69: 3rd Edition, Chapter 5

5 DataLink Layer 5-69

Switch example

Suppose C sends frame to D

Switch receives frame from from C notes in bridge table that C is on interface 1 because D is not in table switch forwards frame into

interfaces 2 and 3

frame received by D

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEG

1123

12 3

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 70: 3rd Edition, Chapter 5

5 DataLink Layer 5-70

Switch example

Suppose D replies back with frame to C

Switch receives frame from from D notes in bridge table that D is on interface 2 because C is in table switch forwards frame only to

interface 1

frame received by C

hub

hub hub

switch

A

B CD

EF

G H

I

address interface

ABEGC

11231

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 71: 3rd Edition, Chapter 5

5 DataLink Layer 5-71

Switch traffic isolation switch installation breaks subnet into LAN

segments switch filters packets

same-LAN-segment frames not usually forwarded onto other LAN segments

segments become separate collision domains

hub hub hub

switch

collision domain collision domain

collision domain

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 72: 3rd Edition, Chapter 5

5 DataLink Layer 5-72

Switches dedicated access Switch with many

interfaces Hosts have direct

connection to switch No collisions full duplex

Switching A-to-Arsquo and B-to-Brsquo simultaneously no collisions

switch

A

Arsquo

B

Brsquo

C

Crsquo

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 73: 3rd Edition, Chapter 5

5 DataLink Layer 5-73

More on Switches

cut-through switching frame forwarded from input to output port without first collecting entire frameslight reduction in latencyWas a big deal in the days of 10Mbits

combinations of shareddedicated 101001000 Mbps interfaces

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 74: 3rd Edition, Chapter 5

5 DataLink Layer 5-74

Institutional network

hub

hubhub

switch

to externalnetwork

router

IP subnet

mail server

web server

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 75: 3rd Edition, Chapter 5

5 DataLink Layer 5-75

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

Switch

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 76: 3rd Edition, Chapter 5

5 DataLink Layer 5-76

Summary comparison

hubs routers switches

traffi c isolation

no yes yes

plug amp play yes no yes

optimal routing

no yes no

cut through

yes no yes

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 77: 3rd Edition, Chapter 5

5 DataLink Layer 5-77

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 78: 3rd Edition, Chapter 5

5 DataLink Layer 5-78

Point to Point Data Link Control one sender one receiver one link easier than

broadcast link no Media Access Control no need for explicit MAC addressing eg dialup link ISDN line

popular point-to-point DLC protocols PPP (point-to-point protocol) HDLC High level data link control (Data link

used to be considered ldquohigh layerrdquo in protocol stack

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 79: 3rd Edition, Chapter 5

5 DataLink Layer 5-79

PPP Design Requirements [RFC 1557]

Basic ldquowirerdquo functionality packet framing encapsulation of network-layer

datagram in data link frame Multi-protocol - carry network layer data of

any network layer protocol (not just IP) at same time

ability to demultiplex upwards bit transparency must carry any bit pattern in

the data field(eg ^S^Q modem flow control must not break it)

error detection (not correction)

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 80: 3rd Edition, Chapter 5

5 DataLink Layer 5-80

PPP Design Requirements (cont)

But thatrsquos not enough connection liveness detect signal link failure

to network layer network layer address negotiation endpoint

can learnconfigure each otherrsquos network address and other characteristics

Authenticationwho are you (or at least whose account do I bill for your dial-in time)

Management featuresloopback detection

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 81: 3rd Edition, Chapter 5

5 DataLink Layer 5-81

PPP non-requirements

no error correctionrecovery(modems do one layer FEC one layer packetization +

retransmission ldquounder the coversrdquo anyway other technologies are pretty reliable)

no flow control out of order delivery OK no need to support multipoint links (eg

polling)Error recovery flow control data re-ordering all relegated to higher layers

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 82: 3rd Edition, Chapter 5

5 DataLink Layer 5-82

PPP Data Frame

Flag delimiter (framing) Address ignored (historical) Control ignored (historical) Protocol upper layer protocol to which frame

delivered (eg PPP-LCP IP IPCP etc)

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 83: 3rd Edition, Chapter 5

5 DataLink Layer 5-83

PPP Data Frame

info upper layer data being carried check cyclic redundancy check for error

detection

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 84: 3rd Edition, Chapter 5

5 DataLink Layer 5-84

Byte Stuffing ldquodata transparencyrdquo requirement data field

must be allowed to include flag pattern lt01111110gt Q is received lt01111110gt data or flag

Sender adds (ldquostuffsrdquo) extra lt 01111110gt byte after each lt 01111110gt data byte

Receiver two 01111110 bytes in a row discard first

byte continue data reception single 01111110 flag byte

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 85: 3rd Edition, Chapter 5

5 DataLink Layer 5-85

Byte Stuffing

flag bytepatternin datato send

flag byte pattern plusstuffed byte in transmitted data

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 86: 3rd Edition, Chapter 5

5 DataLink Layer 5-86

PPP Data Control ProtocolBefore exchanging network-

layer data data link peers must

configure PPP link (max frame length authentication)

learnconfigure network layer information

for IP carry IP Control Protocol (IPCP) msgs (protocol field 8021) to configurelearn IP address

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 87: 3rd Edition, Chapter 5

5 DataLink Layer 5-87

Where does PPP get used

Dial-up ndash PPP over async serial over modem

ADSL ndash PPP over EthernetPPP over ATM

Backbone ndash Packet over SONET (POS) Why

Framing (dialup POS) Efficiency (POS) Authentication address negotiation (PPPoE

PPPoATM)

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 88: 3rd Edition, Chapter 5

5 DataLink Layer 5-88

Ethernet IP Address negotiation - DHCP

Problem How to configure a host with IP address Router address DNS server

The DHCP solution ask a special server

DHCP DISCOVER From 0000To broadcast

DHCP OFFER

IP address DNS default router

Q how does theoffer get back to theclient

client server

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 89: 3rd Edition, Chapter 5

5 DataLink Layer 5-89

Link Layer

51 Introduction and services

52 Error detection and correction

53Multiple access protocols

54 Link-Layer Addressing

55 Ethernet

56 Hubs and switches 57 PPP (58 ATM MPLS ndash if we

have time)

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 90: 3rd Edition, Chapter 5

5 DataLink Layer 5-90

ATM architecture

adaptation layer only at edge of ATM network data segmentationreassembly roughly analogous to Internet transport layer

ATM layer ldquonetworkrdquo layer cell switching routing

physical layer

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 91: 3rd Edition, Chapter 5

5 DataLink Layer 5-91

ATM network or link layerVision end-to-end

transport ldquoATM from desktop to desktoprdquo ATM is a network

technologyReality used to connect

IP backbone routers ldquoIP over ATMrdquo ATM as switched

link layer connecting IP routers

ATMnetwork

IPnetwork

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 92: 3rd Edition, Chapter 5

5 DataLink Layer 5-92

ATM Layer ATM cell 5-byte ATM cell header 48-byte payload

Why digitized voice - packetization delay halfway between 32 and 64 (compromise)

Cell header

Cell format

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 93: 3rd Edition, Chapter 5

5 DataLink Layer 5-93

ATM Adaptation Layer (AAL)

ATM Adaptation Layer (AAL) ldquoadaptsrdquo upper layers (IP or native ATM applications) to ATM layer below

AAL present only in end systems not in switches

AAL layer segment (headertrailer fields data) fragmented across multiple ATM cells analogy TCP segment in many IP packets

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 94: 3rd Edition, Chapter 5

5 DataLink Layer 5-94

ATM Adaptation Layer (AAL) [more]

AAL5 for data (eg IP datagrams) AAL1-4 never mindhellip

User data

User dataAAL5trailer

AAL5 PDU

ATM cellsEnd=0 End=0 End=0 End=1

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 95: 3rd Edition, Chapter 5

5 DataLink Layer 5-95

ATM Layer Virtual Circuits VC transport cells carried on VC from source to dest

call setup teardown for each call before data can flow each packet carries VC identifier (not destination ID) every switch on source-dest path maintain ldquostaterdquo for each

passing connection linkswitch resources (bandwidth buffers) may be allocated

to VC to get circuit-like perf

Permanent VCs (PVCs) long lasting connections typically ldquopermanentrdquo route between to IP routers

Switched VCs (SVC) dynamically set up on per-call basis

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 96: 3rd Edition, Chapter 5

5 DataLink Layer 5-96

ATM VCs

Advantages of ATM VC approach Switches can easily provide per-VC performance

guarantee (bandwidth delay delay jitter) ldquoEasier to switch in hardwarerdquoQ is it really

Drawbacks of ATM VC approach Inefficient support of datagram traffic one PVC between each sourcedest pair) does not

scale (N2 connections needed) SVC introduces call setup latency processing

overhead for short lived connections

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 97: 3rd Edition, Chapter 5

5 DataLink Layer 5-97

ATM ndash where is it now

DSL Why

Short answer it seemed like the thing to do at the time

Check ADSL forum TR-025 for long answer

Currently migrating to Ethernet to support higher data rates and QoS

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 98: 3rd Edition, Chapter 5

5 DataLink Layer 5-98

Multiprotocol label switching (MPLS)

initial goal speed up IP forwarding by using fixed length label (instead of IP address) to do forwarding borrowing ideas from Virtual Circuit (VC) approach but IP datagram still keeps IP address

PPP or Ethernet header

IP header remainder of link-layer frameMPLS header

label Exp S TTL

20 3 1 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 99: 3rd Edition, Chapter 5

5 DataLink Layer 5-99

MPLS capable routers

aka label-switched router forwards packets to outgoing interface based

only on label value (donrsquot inspect IP address) MPLS forwarding table distinct from IP forwarding

tables signaling protocol needed to set up forwarding

RSVP-TE forwarding possible along paths that IP alone would

not allow (eg source-specific routing) use MPLS for traffic engineering

must co-exist with IP-only routers

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 100: 3rd Edition, Chapter 5

5 DataLink Layer 5-100

R1R2

D

R3R4R5

0

1

00

A

R6

in out outlabel label dest interface 6 - A 0

in out outlabel label dest interface10 6 A 1

12 9 D 0

in out outlabel label dest interface 10 A 0

12 D 0

1

in out outlabel label dest interface 8 6 A 0

0

8 A 1

MPLS forwarding tables

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 101: 3rd Edition, Chapter 5

5 DataLink Layer 5-101

Chapter 5 Summary principles behind data link layer services

error detection correction sharing a broadcast channel multiple access link layer addressing

instantiation and implementation of various link layer technologies Ethernet switched LANS PPP virtualized networks as a link layer ATM

MPLS

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 102: 3rd Edition, Chapter 5

5 DataLink Layer 5-102

Acronyms

PPP ndash point-to-point protocol MAC ndash Media Access Control ARQ ndash ARQ (maybe Automatic Repeat Request)

means link-layer retransmission via ACKNAK MPLS ndash multi-protocol label switching CRC ndash cyclic redundancy check CSMA ndash carrier sense multiple access CD ndash with collision detection CA ndash with collision avoidance SONET ndash Synchronous Optical NETwork DHCP ndash dynamic host configuration protocol TDMA ndash time division multiple access LAN ndash local area network PVC ndash permanent virtual circuit

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms
Page 103: 3rd Edition, Chapter 5

5 DataLink Layer 5-103

More Acronyms

SVC ndash switched virtual circuit (A)DSL ndash (asymmetric) digital subscriber line HDLC ndash HDLC Generally used to refer to a

bit-synchronous protocol with a 01111110 flag byte and bit-stuffing for transparency

POS ndash packet over SONET

  • Who am I
  • Chapter 5 The Data Link Layer
  • Link Layer
  • Link Layer Introduction
  • Link layer context
  • Link Layer Services
  • Link Layer Services (more)
  • Adaptors Communicating
  • Slide 9
  • Error Detection
  • Parity Checking
  • Checksumming Cyclic Redundancy Check
  • CRC Example
  • Slide 14
  • Multiple Access Links and Protocols
  • Multiple Access protocols
  • Ideal Multiple Access Protocol
  • MAC Protocols a taxonomy
  • Traffic types another taxonomy
  • Channel Partitioning MAC protocols TDMA
  • Channel Partitioning MAC protocols FDMA
  • Random Access Protocols
  • Slotted ALOHA
  • Slide 24
  • Slotted ALOHA efficiency
  • Slotted Aloha efficiency
  • Pure (unslotted) ALOHA
  • Pure Aloha efficiency
  • CSMA (Carrier Sense Multiple Access)
  • CSMA collisions
  • CSMACD (Collision Detection)
  • CSMACD collision detection
  • ldquoTaking Turnsrdquo MAC protocols
  • Slide 34
  • Summary of MAC protocols
  • LAN technologies
  • Slide 37
  • MAC Addresses
  • MAC Addresses and ARP
  • LAN Addresses and ARP
  • LAN Address (more)
  • ARP Address Resolution Protocol
  • ARP protocol Same LAN (network)
  • ARP trace
  • Routing to another LAN
  • PowerPoint Presentation
  • Slide 47
  • Ethernet
  • Ethernet Bus implementations
  • Star topology
  • Hubs
  • Meeting room analogy
  • Ethernet Frame Structure
  • Ethernet Frame Structure (more)
  • Unreliable connectionless service
  • Ethernet uses CSMACD
  • Ethernet CSMACD algorithm
  • Ethernetrsquos CSMACD (more)
  • CSMACD efficiency
  • 10BaseT and 100BaseT
  • Manchester encoding
  • Gbit Ethernet
  • Slide 63
  • Interconnecting with hubs
  • Switch
  • Forwarding
  • Self learning
  • FilteringForwarding
  • Switch example
  • Slide 70
  • Switch traffic isolation
  • Switches dedicated access
  • More on Switches
  • Institutional network
  • Switches vs Routers
  • Summary comparison
  • Slide 77
  • Point to Point Data Link Control
  • PPP Design Requirements [RFC 1557]
  • PPP Design Requirements (cont)
  • PPP non-requirements
  • PPP Data Frame
  • Slide 83
  • Byte Stuffing
  • Slide 85
  • PPP Data Control Protocol
  • Where does PPP get used
  • Ethernet IP Address negotiation - DHCP
  • Slide 89
  • ATM architecture
  • ATM network or link layer
  • ATM Layer ATM cell
  • ATM Adaptation Layer (AAL)
  • ATM Adaptation Layer (AAL) [more]
  • ATM Layer Virtual Circuits
  • ATM VCs
  • ATM ndash where is it now
  • Multiprotocol label switching (MPLS)
  • MPLS capable routers
  • MPLS forwarding tables
  • Chapter 5 Summary
  • Acronyms
  • More Acronyms