Tb2377 michelet trill vs spb_final
Upcoming SlideShare
Loading in...5
×
 

Tb2377 michelet trill vs spb_final

on

  • 610 views

 

Statistics

Views

Total Views
610
Views on SlideShare
610
Embed Views
0

Actions

Likes
1
Downloads
30
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Adobe PDF

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

Tb2377 michelet trill vs spb_final Tb2377 michelet trill vs spb_final Presentation Transcript

  • © Copyright 2012 Hewlett-Packard Development Company, L.P.The information contained herein is subject to change without notice.
  • TRILL or SPBIEEE or IETFPhilippe Michelet, Director of Global Product Management,Data Center Core SwitchingJune 2012© Copyright 2012 Hewlett-Packard Development Company, L.P.The information contained herein is subject to change without notice.
  • DisclaimerRoadmap and is subject to change without notice.This document contains forward looking statements regarding future operations, productdevelopment, product capabilities and availability dates. This information is subject tosubstantial uncertainties and is subject to change at any time without prior notification.Statements contained in this document concerning these matters only reflect Hewlett Packardspredictions and / or expectations as of the date of this document and actual results and futureplans of Hewlett-Packard may differ significantly as a result of, among other things, changes inproduct strategy resulting from technological, internal corporate, market and other changes. Thisis not a commitment to deliver any material, code or functionality and should not be relied uponin making purchasing decisions.3 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • Agenda1. Problem statement2. Solution A, IEEE: PBB, PBB-TE, SPB3. Solution B, IETF: TRILL4. HPN’s position / roadmap5. Conclusion4 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • Consider Evolutions Since STPSTP like protocols – how high is your blood pressure? Limited CAPEX Links in standby mode? Teams spending weeks to Limited OPEX design the network? Network = critical Waiting tens of seconds resource between failovers ? 1000 servers, 50VMs Highly virtualized Does it scale? Can you isolate traffic Multi-tenancy between “tenants”?5 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • Legacy STP verses Modern Architectures Optimal paths Core Actual path Aggregation Edge Blocked links/idle infrastructure / no multi-pathing Complex to engineer (STP/RSTP/MSTP) Slow re-convergence after failover (best case ~1s – typically 3, worse case 45s)6 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • Requirements for a Modern Layer 2Network© Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • Modern Architecture Requirements• Arbitrary topologies• All links active, all the time• Multi-pathing/load splitting among multiple paths• Unicast, Multicast and Broadcast support• Compatible with IEEE 802.1 Ethernet networks using STP• Very minimal configuration required• Uncompromised stability8 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • IEEE: SPB (aka 802.1aq)© Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • IEEE Layer 2 Protocol History Provider Backbone Bridge IEEE 802.1ah Payload Provider Bridge IEEE 802.1ad EtherType VLANs C-TAG IEEE 802.1Q EtherType Payload S-TAG EtherType IEEE 802.1 Payload SA EtherType DA C-TAG I-TAG Payload EtherType EtherType EtherType C-TAG S-TAG B-TAG EtherType EtherType EtherType EtherType SA SA SA B-SA DA DA DA B-DA 1990 1998 2005 200810 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • Provider Backbone Bridge (PBB) Terminology PB BCB PB BEB Customer BEB BCBPB = Provider BridgeBEB = Backbone Edge Bridge: inserts/removes the PBB headerBCB = Backbone Core Bridge: similar behavior to 802.1ad bridge (aka QinQ)11 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • Quick Overview – PBB (con’t) I Component PBB • Maps S-VID to I-SIDs IEEE 802.1ah • Adds PBB header without B-TAG Payload • Forwards frames to PB network based on customer MAC addresses EtherType C-TAG B-Component EtherType S-TAG • Maps I-SIDs to B-VIDs EtherType SA • Adds B-TAGI Comp DA I-TAG • Forwards frames to core of PBB network based on backbone MAC addresses EtherType B-TAG BEB containing and I and B component is named IB-BEB EtherType B Comp B-SA BEB can also support single component B-DA • I-BEB • B-BEB12 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • Quick Overview – PBB (con’t) I-SID Table 20 VID MAC Port 100 S2 20 I-SID Table 20 Bridge Table 100 A B-MAC S10 VID MAC Port VID MAC Port 300 S20 5 100 B 20 B 100 S1 3 100 C 20 100 A 3 300 S10 6 1 S20 24 100 B B-MAC S20 S11 5 100 C B-MAC S20 20 S2 S10 10 2 6 PBB Bridge Table 3 4 VID MAC Port 300 S10 10 PBB Bridge Table VID MAC Port S1 300 S20 4 C 2 1 Learn customer MACs only at edge nodesA13 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • Quick Overview – Shortest Path Bridging (SPB)Link state control plane for IEEE networksSPBV (Shortest Path Bridging – VID) / SPBM (Shortest Path Bridging – MAC with PBB)Combines Ethernet Data Path (802.1Q or 802.1ah) with IS-IS (link state protocol)Link State protocol used for (1) discovery, (2) advertise network topology, (3) compute shortestpath trees from all bridges in the SPB RegionSPBV:Enables shortest path trees for VLAN BridgesDefines a shortest path region, which is the boundary of the shortest path topologyBuilds shortest path trees but also interworks with legacy bridges running rapid spanning tree protocol andmultiple spanning tree protocolSPBM:SPBM reuses the PBB data plane, which does not require that the Backbone Core Bridges (BCB) learn encapsulatedclient addressesThe forward and reverse paths used for unicast and multicast traffic in an IEEE 802.1aq network are symmetricEqual Cost Multi Tree (path) supported (16 initially defined, more possible)14 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • SPB - Example (1) 8 participating nodes 4 MAC = 00:00:00:00:N:00 1 2 IS-IS runs on all the links 1 1 Nodes will use their MAC addresses as IS-IS SysID to exchange link state 5 0 2 5 1 2 packet (LSPs) 3 4 4 3 1 1 7 5 2 1 2 5 1 2 2 3 3 After topology discovery the next step is distributed 5 4 2 calculation of the unicast routes for both ECMP VIDs 4 3 and population of the unicast forwarding tables (FIBs) 1 2 615 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • SPB - Example (2) Node 7 will therefore have a FIB that among other 4 things indicates: MAC 00:00:00:05:00 / VID 101 the next hop is 1 2 interface/1.Low path ID using VID 101 1 MAC 00:00:00:05:00 / VID 102 the next hop is 1 interface/2 5 0 2 5 1 2 3 4 4 3 1 1 7 5 2 1 2 5 1 2 2 3 3 Node 5 will have exactly the inverse in its FIB. 5 4 2 MAC 00:00:00:07:00 / VID 101 the next hop is 4 3 interface/1.High path ID using VID 102 MAC 00:00:00:07:00 / VID 102 the next hop is 1 2 interface/2 6 Equal Cost paths supported 16 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • SPB OAM CapabilitiesLeverages 802.1agContinuity Check (CC)Fault detection (Multicast/unidirectional heartbeat)Loopback – Connectivity checkFault verification (unicast/bi-directional request/response)Traceroute (link trace)Fault isolation (trace nodes in path to a specified node)Discovery (Y.1731/802.1ab)Service (all nodes supporting common service instance)Network (all devices common to a domain)Performance Monitoring (MEF10, MEF12, Y-1731)Capacity planningSLA Reporting17 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • SPB – Bottom line• Developed for service providers/carriers in the context of Internet L2 exchanges, Metro Ethernet, Wireless Backhaul• SPB is actively supported by Alcatel Lucent, Huawei, Avaya (ex NT) and Ciena for DC & DC to DC deployments• Leverages the industry standard Ethernet data planes – 802.1Q and 802.1ah• Supports tens of thousands of services with the 802.1ah I-SID (data path)• Leverages IS-IS link state protocol – already deployed by service providers/carriers • Multiple shortest equal cost paths for both unicast and multicast traffic L2 VPNs• Leverages the industry standard Ethernet OAM – 802.1ag18 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • IETF: TRILL© Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • TRILL: IntroductionA network where RBridges canRoute packets to their target LAN.The paths they find, to our elation,Are least cost paths to destination!With packet hop counts we now see,The network need not be loop-free!draft-ietf-trill-rbridge-protocol-16Ray Perlner, Algorhyme v220 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • TRILL - TerminologyRBridge – Routing Bridges Campus – TRILL network • Benefits of both bridges and routers • RBridges, bridges, hubs/repeaters (802.3) • Terminates STP • Bounded by end stations and routers • Replaces old bridged LAN • Invisible to IP routers • Limited to customer networks 802.1 ES1 IRB TRB ERB ES2 Ingress Transit Egress 802.1 RBridge End-station Router21 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • TRILL in ActionRbridges run IS-IS Link State protocol between each otherOptimal path found to every RbridgeSmall FDB for RBridge forwarding (100’s of RBridges)Normal learning for end-stations (or ESADI protocol)Local MAC/VLAN/portRemote MAC/VLAN/RbridgeConfidence levelDistribution trees for multicast (MCast, BCast, Unknown-uni)Pruned by VLANPruned by IP Multicast membership22 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • TRILL Packet Format Needed for compatibility with 802.1 switches Outer Mac header Outer DA is MAC address of next hop RBridgeTwo headers added to original Ethernet Outer DA 6packet Outer SA Outer SA is MAC address of sending RBridge 6Outer MAC header Transit switches rewrite outer MAC header, like routersTRILL header Outer VLAN 4 Outer VLAN is Etype (0x8100) and Designated VIDOriginal packet excludes CRC TRILL Etype 2 Trill Etype indicates that 6-byte TRILL header followsTotal 20 bytes added Outer MAC header 18 2-byte nicknames for Ingress and Egress RBridges TRILL header 6 Hop Count, Options length, Flags Original packet 60-1514 Hop Count, Flags 2 Routes packet within TRILL campus CRC 4 Egress RBr NN 2 Transit switches do 16-bit lookup and decrement hop count Ingress RBr NN 2 If hop count is 0, packet discarded TRILL Header23 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • TRILL – Distribution Trees• Used to forward multicast frames (Multicast/Broadcast/Unknown)• One tree is sufficient, but multiple trees allow load balancing• Tree computed based on link state information for a given root• All RBridges use LSPs to agree on: − Number of trees to compute − Root of tree to compute• RPF check protects against looping of multicast frames24 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • TRILL – Distribution Trees (con’t) - TRILL RBridge Core - IEEE 802.1 Switch Aggregation Edge • IS-IS (Intermediate System to Intermediate System) link state routing protocol − IS-IS runs directly at Layer 2 − Optimal paths found between RBridges25 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.25
  • IETF TRILL Forwarding Switch Interface Broadcast S20 S21 L1 L2 - TRILL RBridge S30 L3 S31 L4Switch InterfaceS1 L1 S1 S2 S20 -> broadcast S20 A->broadcast L4 L5S2 L2 L1 L8S21 L1, L5 L6 L7 Ethernet Frame L2 L3S30 L1, L5 TRILL IEEE 802.3S31 L1, L5 L1 L2 S20 -> broadcast S20 A->broadcast S21 S30 S31 A->broadcast MAC Interface 2 A Ethernet Frame 1 S20 1 flood frameandof hostlocal routing table S31 add header based on A into S1 will MAC address flood frame MAC table decap IEEE 802.3 MAC DA is broadcast S20 will flood packet A->broadcast First communication host a send arp request to resolve host c mac A B 26 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • IETF TRILL Forwarding Switch Interface - TRILL RBridge Unknown unicast S20 S21 L1 L2 S30 L3 S31 L4 Switch Interface S1 L10 S1 S2 S20 S2 L9 S20 -> broadcast A->broadcast L4 L5 L1 L8 S20 L9, L10Switch Interface L6 L7S1 L1 L2 L3 S21 L9. L10 S30 L9, L10S2 L2S21 L1, L2 L1 L2 L9S30 L1, L2 C->A S21 S30 L10 S31 S20 Broadcast -> S1 C->AS31 L1, L2 2 MAC Interface S20 MAC frame based fail, frame will S11flood frame based on local table S31 floodDA lookup willon local table be flood MAC Interface C 2 A 1 S20 will see that A is already learned and will add C in C S31 Host c will send arp reply back decap header local MAC table then to host a C->A A B 27 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice. 27
  • IETF TRILL Forwarding - TRILL RBridge Unicast Switch Interface S31 L9Switch Interface S1 S2 S30 L7S1 L1, L4 S20 -> S31 L5 S20 A->C L1 L8 S21 L6S2 L2 L6 L7 S20 L5S21 L1, L2 L2 L3S30 L1, L2S31 L1, L2 L9 S20->S31 S20 A->C S21 S30 L10 S31 A->C MAC Interface MAC Interface 2 A 1 S2 lookups S31 and to encap L9 S20 of C ECMP hashpointed toframe Mac runsis in S20 table,select path 1 C 2 C S31 A S20 A->C Host A starts sending traffic after arp resolution A B 28 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice. 28
  • Determining which one is right foryou© Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • Decision criteria Both technologies take care of the MAC explosion in the core Scalability SPB with I-SID: 16M services. Edge encapsulation with TRILL can scale similarly IS-IS computation may be faster with TRILL than with SPB – but only final implementations will Failure recovery provide the real answers (highly debated issues) Loop prevention Both standards provide solutions (SPB: do not forward to root/agreement protocol. TRILL: TTL, RPC, Loop mitigation Adjacencies check) Another highly debated issue. SPB: SPT calculated on every ingress node, more computational Multicast intensive. TRILL: typically no more than 6 trees, simpler with fewer trees Data center bridging TRILL: still work in progress (new draft). SPB: supported today Compatibility 802.1D 802.1 bridges part of the TRILL domain. SPB a mode for normal VLAN bridges (V-mode) OAM PBB/SPB leverage Ethernet OAM. Work in progress for TRILL (new draft)30 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • HP’s recommendations© Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • IRF meets modern requirements today HP 12500 80% faster vMotion Optimized network core 500x faster recovery time Up to 4-chassis IRF available now 100% higher scalability Resilient Virtual Switching Fabric IRF HP 5900/5920/58XX 50% device reduction Optimized access layer 20% lower price per port 10/40 GbE Access 300% higher scalability Support for 1,000’s of virtual/physical servers Rack servers Blades servers32 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • IRF / TRILL Comparison IRF alone: Both edge and core switches learn the customer FDB Scalability TRILL: core switches don’t learn edge MAC addresses IRF: failover typically <100ms (link failover < 1ms) Failure recovery TRILL: failover will depend on the implementation Loop prevention IRF: part of the framework Loop mitigation TRILL: TTL & RPC & Adjacencies Check IRF: leverages ASIC hashing algorithms (L2/L3/L4) Multi-pathing TRILL: not specified by the standard, but expect 8 paths in first implementations IRF: completely orthogonal property Data center bridging TRILL: still work in progress (new draft) IRF: does not require STP/RSTP/MSTP Compatibility 802.1D TRILL: 802.1 bridges part of the TRILL domain IRF: specific OAM OAM TRILL: Work in progress for TRILL (new draft)33 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • IRF/TRILL Comparison (con’t)• IRF and TRILL don’t play in the same dimension• IRF must be seen as a “clustering” technology allowing multiple devices to be seen as one logical device, removing STP, VRRP from the network, with a single IP for the management• TRILL answers positively to the following question: why can’t every single node have a tree rooted at itself, allowing (1) the optimal (shortest path) distribution of traffic (2) multi-pathing (3) failure recovery• IRF and TRILL are in fact not mutually exclusive34 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice. 34
  • Complementing TRILL with IRF HPN IRF/TRILL Data Center Fabric TRILL without IRF TRILL with IRF • High performance : unblocking CLOS network • 100% standardized TRILL, fully interoperable • Loop free, no STP • IRF reduces routing protocol (IS-IS) table size • 16 core switches, >100 10G boxes, >500 GE boxes • With 30 IRF domains (4 chassis per domain, 9 • Support or more than 20K servers boxes at the edge) • Routing nodes >600 • Only 30 routing nodes • Allows larger domains, faster failure recovery Combines best of both worlds !!!35 35 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • Conclusion© Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • Conclusion Available today HPN’s IRF technology allows large DC deployments today Active/Active links, L2 or L3, no STP/RSTP/MSTP (or VRRP) HP is committed to TRILL Roadmap (POR) Comware v7 / H2 2012 HP is committed to SPB PBB available today (12500/9500) Roadmap (POI) Comware v7 / H1 2013 IRF + TRILL Combining best of both worlds Differentiated solution Scalability, Faster Convergence, Ease of Use37 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • Tools to help our clients• Read about the FlexNetwork Architecture• Learn about Virtual Application Networks• Discover Intelligent Management Center• Read more on FlexFabric• See more about FlexCampus BYOD for education and healthcare• Learn how to simplify communication with FlexBranch• View the HPN Portfolio Matrix Guide• Learn about networking services from HP Technical Services• Learn about networking career certifications from HP ExpertONE38 © Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.
  • Thank you© Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.