m_04dce

Data Center
Ethernet
Raj Jain
Washington University in Saint Louis
Saint Louis, MO 63130
Jain@cse.wustl.edu
These slides and audio/video recordings of this class lecture are at:
http://www.cse.wustl.edu/~jain/cse570-15/
Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain
4-1
Overview
1. Residential vs. Data Center Ethernet

2. Review of Ethernet Addresses, devices, speeds,
algorithms
3. Enhancements to Spanning Tree Protocol
4. Virtual LANs
5. Data Center Bridging Extensions
4-2
Quiz: True or False?
Which of the following statements are generally true?
T F
p p Ethernet is a local area network (Local < 2km)
p p Token ring, Token Bus, and CSMA/CD are the three most
common LAN access methods.
p p Ethernet uses CSMA/CD.
p p Ethernet bridges use spanning tree for packet forwarding.
p p Ethernet frames are 1518 bytes.
p p Ethernet does not provide any delay guarantees.
p p Ethernet has no congestion control.
p p Ethernet has strict priorities.
4-3
Residential vs. Data Center Ethernet
Residential Data Center
 Distance: up to 200m r No limit
 Scale:
 Few MAC addresses r Millions of MAC Addresses
 4096 VLANs r Millions of VLANs Q-in-Q
 Protection: Spanning tree r Rapid spanning tree, …
(Gives 1s, need 50ms)
 Path determined by r Traffic engineered path
spanning tree
 Simple service r Service Level Agreement.
Rate Control.
 Priority r Need per-flow/per-class QoS
 Aggregate QoS
 No performance/Error r Need performance/BER
monitoring (OAM)
4-4
IEEE 802 Address Format
r 48-bit:1000 0000 : 0000 0001 : 0100 0011
: 0000 0000 : 1000 0000 : 0000 1100
= 80:01:43:00:80:0C
Organizationally Unique
Identifier (OUI) 24 bits assigned by
Individual/ Universal/ OUI Owner
Group Local
1 1 22 24
 Multicast = “To all bridges on this LAN”
 Broadcast = “To all stations” (Note: Local bit is set)
= 111111....111 = FF:FF:FF:FF:FF:FF
4-5
IEEE Standards Numbering System
 IEEE 802.* and IEEE 802.1* standards (e.g.,
IEEE 802.1Q-2011) apply to all IEEE 802 technologies:
 IEEE 802.3 Ethernet
 IEEE 802.11 WiFi
 IEEE 802.16 WiMAX
802 Overview and Architecture

802.2 Logical Link Control
802.1 Bridging
802.1 Management
802.10 Security
802.3 802.11 802.17
Ethernet … WiFi … Resilient …
Packet
Ring (RPR)
4-6
IEEE Standards Numbering (Cont)
 IEEE 802.3* standards apply only to Ethernet,
e.g., IEEE802.3ba-2010
 Standards with all upper case letters are base standards
E.g., IEEE 802.1AB-2009
 Standards with lower case are additions/extensions/revisions.
Merged with the base standard in its next revision.
e.g., IEEE 802.1w-2001 was merged with IEEE 802.1D-2004
 Standards used to be numbered, sequentially, e.g., IEEE
802.1a, …, 802.1z, 802.1aa, 802.1ab, …
 Recently they started showing base standards in the additions,
e.g., IEEE 802.1Qau-2010

4-7
Names, IDs, Locators
Name: John Smith
ID: 012-34-5678
Locator:
1234 Main Street
Big City, MO 12345
USA
 Locator changes as you move, ID and Names remain the same.
 Examples:
 Names: Company names, DNS names (Microsoft.com)
 IDs: Cell phone numbers, 800-numbers, Ethernet addresses, Skype ID,

VOIP Phone number
 Locators: Wired phone numbers, IP addresses

4-8
Interconnection Devices
Extended LAN
=Broadcast
LAN= domain
H H B H H
Collision Router
Domain
Application Application
Gateway
Transport Transport
Network Router Network
Datalink Bridge/Switch Datalink
Physical Repeater/Hub Physical
4-9
Interconnection Devices (Cont)
 Repeater: PHY device that restores data and collision signals
 Hub: Multiport repeater + fault detection and recovery
 Bridge: Datalink layer device connecting two or more collision
domains. MAC multicasts are propagated throughout
“extended LAN.”
 Router: Network layer device. IP, IPX, AppleTalk.
Does not propagate MAC multicasts.
 Switch: Multiport bridge with parallel paths
 These are functions. Packaging varies.

4-10
Ethernet Speeds
 IEEE 802.3ba-2010 (40G/100G) standard
 10Mbps, 100 Mbps, 1 Gbps versions have both CSMA/CD and
Full-duplex versions
 No CSMA/CD in 10G and up
 No CSMA/CD in practice now even at home or at 10 Mbps
 1 Gbps in residential, enterprise offices
 1 Gbps in Data centers, moving to 10 Gbps and 40 Gbps
 100G in some carrier core networks
100G is still more expensive than 10×10G
 Note: only decimal bit rates are used in networking
No cheating like binary byte values used in storage
1 Gbps = 109 b/s, Buy 256 GB Disk = 238.4 GB storage
Ref: http://en.wikipedia.org/wiki/100_Gigabit_Ethernet
4-11
Link Aggregation Control Protocol (LACP)
Switch 2A
Switch 1 Switch 2 Switch 1
Switch 2B
 IEEE 802.1AX-2008/IEEE 802.3ad-2000
 Allows several parallel links to be combined as one link
3×1Gbps = 3 Gbps
 Allows any speed links to be formed
 Allows fault tolerance
 Combined Link remains connected even if one of the
member links fails
 Several proprietary extensions. E.g., aggregate links to two
switches which act as one switch.
Ref: Enterasys, “Enterasys Design Center Networking – Connectivity and Topology Design Guide,” 2013,
http://www.enterasys.com/company/literature/datacenter-design-guide-wp.pdf
4-12
Spanning Tree Algorithm
 Helps form a tree out of a mesh topology
 All bridges multicast to “All bridges”
 My ID. 64-bit ID = 16-bit priority + 48-bit
MAC address.
 Root ID
 My cost to root
 The bridges update their info using Dijkstra’s
algorithm and rebroadcast
 Initially all bridges are roots but eventually
converge to one root as they find out the lowest
Bridge ID.
 On each LAN, the bridge with minimum cost to the
root becomes the Designated bridge
 All ports of all non-designated bridges are blocked.
4-13
Spanning Tree Example
101 105 107 101 105 107

Root
102 104 106 103 102 104 106 103
Ref: Cisco, “Understanding Spanning-Tree Protocol Topology Changes,”

http://www.cisco.com/en/US/tech/tk389/tk621/technologies_tech_note09186a0080094797.shtml
4-14
Homework 4
 Which links in the following diagram will be blocked by
spanning tree? Justify your answer.
101 102
104 103

4-15
Enhancements to STP
 A topology change can result in 1 minute of traffic loss with
STP  All TCP connections break
 Rapid Spanning Tree Protocol (RSTP)
IEEE 802.1w-2001 incorporated in IEEE 802.1D-2004
 One tree for all VLANs  Common spanning tree
 Many trees  Multiple spanning tree (MST) protocol
IEEE 802.1s-2002 incorporated in IEEE 802.1Q-2005
 One or more VLANs per tree.

4-16
MSTP (Multiple Spanning Tree)
Switch 1 Switch 2
Switch 3
 MSTP (Multiple STP)

IEEE 802.1s-2002 incorporated in IEEE 802.1Q-2005
 Each tree serves a group of VLANs.
 A bridge port could be in forwarding state for some VLANs
and blocked state for others.

4-17
IS-IS Protocol
 Intermediate System to Intermediate System (IS-IS) is a
protocol to build routing tables. Link-State routing protocol =>
Each nodes sends its connectivity (link state) information to all
nodes in the network
 Dijkstra’s algorithm is then used by each node to build its
routing table.
 Similar to OSPF (Open Shortest Path First).
 OSPF is designed for IPv4 and then extended for IPv6.
IS-IS is general enough to be used with any type of addresses
 OSPF is designed to run on the top of IP
IS-IS is general enough to be used on any transport
 Adopted by Ethernet
Ref: http://en.wikipedia.org/wiki/IS-IS
4-18
Shortest Path Bridging
 IEEE 802.1aq-2012
 Allows all links to be
used  Better CapEx
 IS-IS link state protocol
Switch Switch Aggregation
(similar to OSPF) is used
to build shortest path
trees for each node to
Switch Switch Switch Switch Access
every other node within
the SPB domain
 Equal-cost multi-path Server1 Server2 Server3 Server4
(ECMP) used to
distribute load
Ref: http://en.wikipedia.org/wiki/Shortest_Path_Bridging
4-19
What is a LAN?
Server Client 1 Bridge Client n Router
LAN 1 LAN 2
Router
 LAN = Single broadcast domain = Subnet

 No routing between members of a LAN
 Routing required between LANs

4-20
What is a Virtual LAN
 Physical View
Users Switches Servers Switches
Routers
r Logical View Marketing LAN

Engineering LAN Router
Manufacturing LAN
http://www.cse.wustl.edu/~jain/cse570-15/
Washington University in St. Louis ©2015 Raj Jain
4-21
Virtual LAN
R
S S S
R
 Virtual LAN = Broadcasts and multicast

goes only to the nodes in the virtual LAN
 LAN membership defined by the network manager
 Virtual

4-22
Types of Virtual LANs
 Layer-1 VLAN = Group of Physical ports
 Layer-2 VLAN = Group of MAC addresses
 Layer-3 VLAN = IP subnet
Switch VLAN VLAN1

Port 1 2 VLAN1 VLAN2
A1 
A1B234565600 21B234565600 23.45.6
D34578923434 634578923434
1345678903333 8345678903333
A2  3438473450555 9438473450555
4387434304343 5387434304343 VLAN2
A3  4780357056135 6780357056135
4153953470641 9153953470641
B1  3473436374133
3403847333412
0473436374133
8403847333412
IPX
B2  3483434343143
4343134134234
8483434343143
0343134134234
4-23
IEEE 802.1Q-2011 Tag
 Tag Protocol Identifier (TPI)
 Priority Code Point (PCP): 3 bits = 8 priorities 0..7 (High)
 Canonical Format Indicator (CFI): 0  Standard Ethernet,
1  IBM Token Ring format (non-canonical or non-standard)
 CFI now replaced by Drop Eligibility Indicator (DEI)
 VLAN Identifier (12 bits  4095 VLANs)
 Switches forward based on MAC address + VLAN ID
Unknown addresses are flooded.
Untagged
DA SA T/L Data CRC
Frame
32b IEEE 802.1Q-2011 Header
Tagged DA SA TPI Priority CFI/DEI VLAN ID T/L Data CRC
Frame
48b 48b 16b 3b 1b 12b 16b 32b
Ref: Canonical vs. MSB Addresses, http://support.lexmark.com/index?page=content&id=HO1299&locale=en&userlocale=EN_US
Ref: G. Santana, “Data Center Virtualization Fundamentals,” Cisco Press, 2014, ISBN:1587143240
4-24
Link Layer Discovery Protocol (LLDP)
 IEEE 802.1AB-2009
 Neighbor discovery by periodic advertisements
 Every minute a LLC frame is sent on every port to neighbors
 LLDP frame contains information in the form of
Type-Length-Value (TLV)
 Types: My Chassis ID, My Port ID, Time-to-live, Port
description (Manufacturer, product name, version),
Administratively assigned system name, capabilities, MAC
address, IP Address, Power-via-MDI, Link aggregation,
maximum frame size, …
DA SA Len LLC Type Len Value … Type Len Value CRC
Ref: Extreme Networks, “Link Layer Discovery Protocol (LLDP),” http://www.extremenetworks.com/libraries/products/LLDP_TB.pdf
Ref: M. Srinivasan, “Tutorial on LLDP,” http://www.eetimes.com/document.asp?doc_id=1272069
Ref: http://en.wikipedia.org/wiki/Link_Layer_Discovery_Protocol
4-25
Data Center Bridging
 Goal: To enable storage traffic over Ethernet
 Four Standards:
 Priority-based Flow Control (IEEE 802.1Qbb-2011)
 Enhanced Transmission Selection (IEEE 802.1Qaz-2011)
 Congestion Control (IEEE 802.1Qau-2010)
 Data Center Bridging Exchange (IEEE 802.1Qaz-2011)
Ref: M. Hagen, “Data Center Bridging Tutorial,” http://www.iol.unh.edu/services/testing/dcb/training/DCB-Tutorial.pdf

4-26
Ethernet Flow Control: Pause Frame
Switch 1 Switch 2
Pause
 Defined in IEEE 802.3x-1997. A form of on-off flow control.

 A receiving switch can stop the adjoining sending switch by
sending a “Pause” frame.
Stops the sender from sending any further information for a
time specified in the pause frame.
 The frame is addressed to a standard (well-known) multicast
address. This address is acted upon but not forwarded.
 Stops all traffic. Causes congestion backup.
Ref: http://en.wikipedia.org/wiki/Ethernet_flow_control
4-27
Priority-based Flow Control (PFC)
Priority 0
Priority 1
Pause
…
…
Priority 7
 IEEE 802.1Qbb-2011
 IEEE 802.1Qbb-2011 allows any single priority to be stopped.
Others keep sending
Ref: J. L. White, “Technical Overview of Data Center Networks,” SNIA, 2013, http://www.snia.org/sites/default/education/
tutorials/2012/fall/networking/JosephWhite_Technical%20Overview%20of%20Data%20Center%20Networks.pdf
4-28
Enhanced Transmission Selection
 IEEE 802.1Qaz-2011
 Goal: Guarantee bandwidth for applications sharing a link
 Traffic is divided in to 8 classes (not priorities)
 The classes are grouped.
 Standard requires min 3 groups: 1 with PFC (Storage with low
loss), 1 W/O PFC (LAN), 1 Strict Priority (Inter-process
communication and VOIP with low latency) LAN
Groups Group 1 Group 2 Group 3 Best Effort
Storage
Classes 0 1 2 3 4 5 6 7 Low Loss
Inter-Process
Comm+VOIP
Low Delay
4-29
ETS (Cont)
Transmit Queue 0
50 50 50
Class Group 3 Transmit Queue 1 20
10 10
Transmit Queue 2
Transmit Queue 3
Class Group 2 Transmit Queue 4
50 50
20 30 20 30
Transmit Queue 5
Class Group 1 Transmit Queue 6
Transmit Queue 7 20 20 30 20 20 30
t=1 t=2 t=3 t=1 t=2 t=3
 Bandwidth allocated per class group in 1% increment but 10%
precision (±10% error).
 Max 75% allocated Min 25% best effort
 Fairness within a group
 All unused bandwidth is available to all classes wanting more
bandwidth. Allocation algorithm not defined.
 Example: Group 1=20%,http://www.cse.wustl.edu/~jain/cse570-15/
Group 2=30%
4-30
A ETS Fairness Example
 Max-Min Fairness: Giving more to any one should not require
decreasing to someone with less allocation (Help the poorest first)
 Example: In a 3-class group bridge, Groups 1 and 2 have a minimum
guaranteed bandwidth of 20% and 30%, respectively.
In a particular time slot, the traffic demands for group 1, 2, and 3 are
30%, 50%, 50%, respectively. How much should each group get?
 Iteration 1: Group 1 = 20, Group 2= 30,
Unallocated = 50, Unsatisfied groups = 3
Fair allocation of unallocated bandwidth = 50/3 per group
 Iteration 2: Group 1 = 20+10 (can’t use more), Group 2=30+50/3,
Group 3=50/3
Total Used = 280/3, Unallocated = 20/3, Unsatisfied groups =2,
Fair share of unallocated bandwidth = 10/3 per group
 Iteration 3: Group 1 = 30, Group 2= 30+50/3+10/3,
Group 3 = 50/3+10/3
Total Used = 100, Unallocated
Washington University in St. Louis
= 0  Done.
http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain
4-31
Tabular Method for Max-Min Fairness
Iteration 1 2 3 Total Unused # Unsatisfied
Demand 30 60 30 120
1 Guaranteed 20 30 0 50 50
Allocation
Total Used 20 30 0 50 50 3
2 Additional 16.7 16.7 16.7
Allocation
Total Used 30 46.7 16.7 93.3 6.7 2
3 Additional 0 3.3 3.3
Allocation
Total Used 30 50 20 100 0 2
 Iterations end when either unused capacity or # of unsatisfied

groups is zero.

4-32
Quantized Congestion Notification (QCN)
Source Switch Switch Destination
Switch Destination
 IEEE 802.1Qau-2010 Dynamic Congestion Notification

 A source quench message is sent by the congested switch direct to the
source. The source reduces its rate for that flow.
 Sources need to keep per-flow states and control mechanisms
 Easy for switch manufacturers but complex for hosts.
Implemented in switches but not in hosts  Not effective.
 The source may be a router in a subnet and not the real source
 Router will drop the traffic. QCN does not help in this case.
Ref: I. Pepelnjak, “DCB Congestion Notification (802.1Qau),” http://blog.ipspace.net/2010/11/data-center-bridging-dcb-congestion.html
4-33
DCBX
 Data Center Bridging eXchange, IEEE 802.1Qaz-2011
 Uses LLDP to negotiate quality metrics and capabilities for
Priority-based Flow Control, Enhanced Transmission
Selection, and Quantized Congestion Notification
 New TLV’s
 Priority group definition
 Group bandwidth allocation
 PFC enablement per priority
 QCN enablement
 DCB protocol profiles
 FCoE and iSCSI profiles

4-34
Summary
1. Ethernet’s use of IDs as addresses makes it very easy to move

systems in the data center  Keep traffic on the same Ethernet
2. Spanning tree is wasteful of resources and slow.
Ethernet now uses shortest path bridging (similar to OSPF)
3. VLANs allow different non-trusting entities to share an
Ethernet network
4. Data center bridging extensions reduce the packet loss by
enhanced transmission selection and Priority-based flow
control
4-35
List of Acronyms
 BER Bit Error Rate
 BPDU Bridge Protocol Data Unit
 CD Collision Detection
 CFI Canonical Format Indicator
 CRC Cyclic Redundancy Check
 CSMA Carrier Sense Multiple Access with Collision Detection
 DA Destination Address
 DCB Data Center Bridging
 DCBX Data Center Bridging eXtension
 DEI Drop Eligibility Indicator
 DNS Domain Name System
 ECMP Equal-cost multi-path
 ETS Enhanced Transmission Selection
 GB Giga Byte
4-36
List of Acronyms (Cont)
 ID Identifier
 IP Internet Protocol
 IEEE Institution of Electrical and Electronics Engineers
 IS-IS Intermediate System to Intermediate System
 iSCSI Internet Small Computer System Interface
 LACP Link Aggregation Control Protocol
 LAN Local Area Network
 LLC Logical Link Control
 LLDP Link Layer Discovery Protocol
 MAC Media Access Control
 MDI Medium Dependent Interface
 MSB Most significant byte first
 MST Multiple Spanning Tree
 MSTP Multiple Spanning Tree Protocol
 OAM Operations, Administration, and Management
4-37
 OSPF Open Shortest Path First
 OUI Organizationally Unique Identifier
 PCP Priority Code Point
 PFC Priority-based Flow Control
 PHY Physical layer
 QCN Quantized Congestion Notification
 QoS Quality of Service
 RSTP Rapid Spanning Tree Protocol
 SA Source Address
 SNIA Storage Networking Industries Association
 SPB Shortest Path Bridging
 STP Spanning Tree Protocol
 TCP Transmission Control Protocol
 TLV Type-Length-Value
 TPI Tag Protocol Identifier
 VLAN Virtual Local Area Network
 VM Virtual machinehttp://www.cse.wustl.edu/~jain/cse570-15/
4-38
 VOIP Voice over IP
 WAN Wide Area Network
 WiFi Wireless Fidelity
 WiMAX Wireless Interoperability for Microwave Access

4-39
Reading List
 G. Santana, “Data Center Virtualization Fundamentals,” Cisco Press, 2014,
ISBN:1587143240
 Enterasys, “Enterasys Design Center Networking - Connectivity and
Topology Design Guide,” 2013,
http://www.enterasys.com/company/literature/datacenter-design-guide-
wp.pdf
 Cisco, “Understanding Spanning-Tree Protocol Topology Changes,”
http://www.cisco.com/en/US/tech/tk389/tk621/technologies_tech_note0918
6a0080094797.shtml
 Cisco, Understanding Rapid Spanning Tree Protocol (802.1w),
http://www.cisco.com/en/US/tech/tk389/tk621/technologies_white_paper09
186a0080094cfa.shtml
 Canonical vs. MSB Addresses,
http://support.lexmark.com/index?page=3Dcontent&id=3DHO1299&locale
=3Den&userlocale=3DEN_US
 Extreme Networks, “Link Layer Discovery Protocol (LLDP),”
http://www.extremenetworks.com/libraries/products/LLDP_TB.pdf

4-40
Reading List (Cont)
 M. Srinivasan, “Tutorial on LLDP,”
http://www.eetimes.com/document.asp?doc_id=3D1272069
 P. Thaler, et al, “IEEE 802.1Q” IETF 86 tutorial, March 10, 2013,
http://www.ietf.org/meeting/86/tutorials/86-IEEE-8021-Thaler.pdf
 M. Hagen, “Data Center Bridging Tutorial,”
http://www.iol.unh.edu/services/testing/dcb/training/DCB-Tutorial.pdf
 J. L. White, “Technical Overview of Data Center Networks,” SNIA, 2013,
http://www.snia.org/sites/default/education/tutorials/2012/fall/networking/Jo
sephWhite_Technical%20Overview%20of%20Data%20Center%20Networ
ks.pdf
 I. Pepelnjak, “DCB Congestion Notification (802.1Qau),”
http://blog.ipspace.net/2010/11/data-center-bridging-dcb-congestion.html

4-41
Wikipedia Links
 http://en.wikipedia.org/wiki/10-gigabit_Ethernet
 http://en.wikipedia.org/wiki/100_Gigabit_Ethernet
 http://en.wikipedia.org/wiki/Data_center
 http://en.wikipedia.org/wiki/Data_center_bridging
 http://en.wikipedia.org/wiki/Data_link_layer
 http://en.wikipedia.org/wiki/EtherChannel
 http://en.wikipedia.org/wiki/Ethernet
 http://en.wikipedia.org/wiki/Ethernet_flow_control
 http://en.wikipedia.org/wiki/Ethernet_frame
 http://en.wikipedia.org/wiki/Ethernet_physical_layer
 http://en.wikipedia.org/wiki/EtherType
 http://en.wikipedia.org/wiki/Fast_Ethernet
 http://en.wikipedia.org/wiki/Gigabit_Ethernet

4-42
Wikipedia Links (Cont)
 http://en.wikipedia.org/wiki/IEEE_802.1aq
 http://en.wikipedia.org/wiki/IEEE_802.1D
 http://en.wikipedia.org/wiki/IEEE_802.1Q
 http://en.wikipedia.org/wiki/IEEE_802.3
 http://en.wikipedia.org/wiki/IEEE_P802.1p
 http://en.wikipedia.org/wiki/IS-IS
 http://en.wikipedia.org/wiki/Link_Aggregation
 http://en.wikipedia.org/wiki/Link_Aggregation_Control_Protocol
 http://en.wikipedia.org/wiki/Link_layer
 http://en.wikipedia.org/wiki/Link_Layer_Discovery_Protocol
 http://en.wikipedia.org/wiki/Logical_link_control
 http://en.wikipedia.org/wiki/MAC_address
 http://en.wikipedia.org/wiki/MC-LAG

4-43
Wikipedia Links (Cont)
 http://en.wikipedia.org/wiki/Media_Independent_Interface
 http://en.wikipedia.org/wiki/Minimum_spanning_tree
 http://en.wikipedia.org/wiki/Network_switch
 http://en.wikipedia.org/wiki/Organizationally_unique_identifier
 http://en.wikipedia.org/wiki/Port_Aggregation_Protocol
 http://en.wikipedia.org/wiki/Priority-based_flow_control
 http://en.wikipedia.org/wiki/RSTP
 http://en.wikipedia.org/wiki/Shortest_Path_Bridging
 http://en.wikipedia.org/wiki/Spanning_tree
 http://en.wikipedia.org/wiki/Spanning_Tree_Protocol
 http://en.wikipedia.org/wiki/Subnetwork_Access_Protocol
 http://en.wikipedia.org/wiki/Virtual_LAN

4-44

m_04dce

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

m_04dce

Uploaded by

Copyright:

Available Formats

Data Center

1. Residential vs. Data Center Ethernet

802 Overview and Architecture

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

 IDs: Cell phone numbers, 800-numbers, Ethernet addresses, Skype ID,

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

101 105 107 101 105 107

102 104 106 103 102 104 106 103

Ref: Cisco, “Understanding Spanning-Tree Protocol Topology Changes,”

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

 MSTP (Multiple STP)

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

 LAN = Single broadcast domain = Subnet

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

Users Switches Servers Switches

r Logical View Marketing LAN

 Virtual LAN = Broadcasts and multicast

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

Switch VLAN VLAN1

 Enhanced Transmission Selection (IEEE 802.1Qaz-2011)

 Congestion Control (IEEE 802.1Qau-2010)

 Data Center Bridging Exchange (IEEE 802.1Qaz-2011)

Ref: M. Hagen, “Data Center Bridging Tutorial,” http://www.iol.unh.edu/services/testing/dcb/training/DCB-Tutorial.pdf

 Defined in IEEE 802.3x-1997. A form of on-off flow control.

Class Group 1 Transmit Queue 6

 Iterations end when either unused capacity or # of unsatisfied

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

Source Switch Switch Destination

 IEEE 802.1Qau-2010 Dynamic Congestion Notification

 Group bandwidth allocation

 PFC enablement per priority

 DCB protocol profiles

 FCoE and iSCSI profiles

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

1. Ethernet’s use of IDs as addresses makes it very easy to move

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse570-15/ ©2015 Raj Jain

You might also like