IEEE 802.1aq control of the Mac-in-Mac Hash/TTL B-VID(s) Jan 2011 Peter Ashwood-Smith

Slides:



Advertisements
Similar presentations
EE384y: Packet Switch Architectures
Advertisements

Virtual Trunk Protocol
1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.
OSPF 1.
1/13/2009January Interim New Orleans aq Shortest Path Bridging Recap Don Fedyk János Farkas
MSTP Reflection VectorIEEE March 2005 Atlanta 1 MSTP Reflection Vector Norman Finn, Cisco Systems.
Ben Mack-Crane 9-Feb-141. bp-sajassi-cfm-0711-v01.pdf Flow-Level CFM: CFM functions performed on the user flows. Network-Level CFM: CFM functions performed.
Nov 2009IEEE 802.1aq Atlanta IEEE 802.1aq Shortest Path Bridging Equal Cost Tree (ECT) Framework Proposal Peter Ashwood-Smith incorporating graphics by:
ECMP for 802.1Qxx Proposal for PAR and 5 Criteria Version 2 16 people from ECMP ad-hoc committee.
DRNI – Intra-DAS Link Version 01 Stephen Haddock July 20,
Copyright © 2004 Juniper Networks, Inc. Proprietary and Confidentialwww.juniper.net 1 79th IETF - Beijing VPLS PE Model with E-Tree Support Yuanlong Jiang.
Energy-Efficient Distributed Algorithms for Ad hoc Wireless Networks Gopal Pandurangan Department of Computer Science Purdue University.
and 6.855J Spanning Tree Algorithms. 2 The Greedy Algorithm in Action
Credit hours: 4 Contact hours: 50 (30 Theory, 20 Lab) Prerequisite: TB143 Introduction to Personal Computers.
ZMQS ZMQS
Shortest Path Bridging IEEE 802
INTERNET PROTOCOLS Class 9 CSCI 6433 David C. Roberts Entire contents copyright 2011, David C. Roberts, all rights reserved.
Ken C. K. Lee, Baihua Zheng, Huajing Li, Wang-Chien Lee VLDB 07 Approaching the Skyline in Z Order 1.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Logically-Centralized Control COS 597E: Software Defined Networking.
Chapter 1: Introduction to Scaling Networks
FIFO Queues CSE 2320 – Algorithms and Data Structures Vassilis Athitsos University of Texas at Arlington 1.
What is access control list (ACL)?
OpenFlow Global Configuration
Scaling The Edge Bridge Address Table In Datacenter Networks June-2012.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v MPLS VPN Technology Introducing MPLS VPN Architecture.
1 DRNI Examples and DAS position Maarten Vissers Version 01.
BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS Budapest University of Technology and Economics Verification of RSTP Convergence and Scalability by Measurements.
Squares and Square Root WALK. Solve each problem REVIEW:
© 2010 Goodrich, Tamassia Graphs1 Graph Data Structures ORD DFW SFO LAX
IPv6 Routing.
Route Optimisation RD-CSY3021.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Implement VTP LAN Switching and Wireless – Chapter 4.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—2-1 Extending Switched Networks with Virtual LANs Introducing VLAN Operations.
Ethernet Data Center Routing Challenges and 802.1aq/SPB new work PETER ASHWOOD-SMITH
Cisco Confidential 1 bz-nfinn-soln-station-subset-0113-v02.pdf Solutions for P802.1Qbz / P802.11ak: Station subset issue Norman Finn January, 2013 Version.
Week 1.
1 12/18/ :21 Chapter 12Bridges1 Rivier College CS575: Advanced LANs Chapter 12: Bridges.
Connecting LANs, Backbone Networks, and Virtual LANs
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Link-State Routing Protocols Routing Protocols and Concepts – Chapter.
© 2007 Cisco Systems, Inc. All rights reserved.ICND2 v1.0—4-1 Single-Area OSPF Implementation Implementing OSPF.
Part 2: Preventing Loops in the Network
IETF 73 November aq Shortest Path Bridging Overview for IETF Don Fedyk Editor 802.1aq.
1 CCNA 3 v3.1 Module 7. 2 CCNA 3 Module 7 Spanning Tree Protocol (STP)
STP Spanning tree protocol. Trunk port : A trunk port is a port that is assigned to carry traffic for all the VLANs that are accessible by a specific.
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
Revision of the Appointed Forwarder RFC draft-eastlake-trill-rfc txt Donald E. Eastlake, 3 rd March 2015 Appointed.
VLAN Trunking Protocol (VTP) W.lilakiatsakun. VLAN Management Challenge (1) It is not difficult to add new VLAN for a small network.
TRansparent Interconnection of Lots of Links (TRILL) March 11 th 2010 David Bond University of New Hampshire: InterOperability.
1 LAN switching and Bridges. 2 Outline Interconnection devices Bridges/LAN switches vs. Routers Bridges Learning Bridges Transparent bridges.
IEEE Plenary San Francisco
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning-Tree Protocol Cisco Networking Academy.
10/13/2015© 2008 Raymond P. Jefferis IIILect 07 1 Internet Protocol.
GMPLS Control of Ethernet IVL Switches draft-fedyk-gmpls-ethernet-ivl-00 GELS BOF, IETF 64 Don Fedyk, Dave Allan,
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning Tree Protocol.
DetNet Data Plane using PseudoWires Jouni Korhonen Shahram Davari Norm Finn IETF#94, Yokohama.
1 Version 3.0 Module 7 Spanning Tree Protocol. 2 Version 3.0 Redundancy Redundancy in a network is needed in case there is loss of connectivity in one.
CCNP 3: Chapter 3 Implementing Spanning Tree. Overview Basics of implementing STP Election of Root Bridge and Backup Enhancing STP RSTP MSTP EtherChannels.
1 VLANs Relates to Lab 6. Short module on basics of VLAN switching.
(ed) Peter Ashwood-Smith
Bridges and Extended LANs
NVO3 VDP Gap Analysis VM to NVE Specific Control Plane Requirements Paul Bottorff (HP) Joseph Pelissier (Cisco) Patricia Thaler (Broadcom)
November 2006IETF TRILL WG1 TRILL Working Group draft-gai-perlman-trill-encap-00.txt as modified by Radia Ed Bowen, IBM Dinesh Dutt, Cisco Silvano Gai,
The Load Balancing Schemes Observations
Lecture#10: LAN Redundancy
Configuring Catalyst Switch Operations
Migrating Your Network to Avaya Fabric Connect
Intra-Domain Routing Jacob Strauss September 14, 2006.
MPLS Basics 2 2.
NT2640 Unit 9 Activity 1 Handout
IS-IS VPLS for Data Center Network draft-xu-l2vpn-vpls-isis-02
Presentation transcript:

IEEE 802.1aq control of the Mac-in-Mac Hash/TTL B-VID(s) Jan 2011 Peter Ashwood-Smith

2 Background 802.1aq creates new behavior for a B-VID. Traffic on a B-VID within an 802.1aq domain travels shortest path towards its B-DA, very different than normal PBB use. –No learning/Output by computation –Ingress Check/Discard if incorrect Therefore 802.1aq has mechanisms to ensure B-VID function is agreed to within the 802.1aq domain. To change the function, add or delete a new B- VID 802.1aq has mechanisms to advertise and verify consistency.

3 Background The function of a B-VID is defined with a tuple: {, } The is further broken down into a world wide unique OUI and local index aq currently defines 17 values all with the OUI. These are indexes Index 0 is for a shared tree (CIST) while indexes are for SPF trees with different tie breakers.

4 Tuples are exchanged and verified :1 :2:3 :4 :5:6 B-VID,ECT-ALGORITHM tuples Are exchanged in hellos and checked for consistency. B-VID,ECT-ALGORITHM tuples are also advertised in LSPs. Inconsistency is only permitted if a tuple is not in use. We can therefore introduce a new B-VID, ECT-ALGORITHM and temporary inconsistency is allowed until we start using it. We can therefore remove all services from a B-VID, ECT-ALGORITHM and then start to delete it and inconsistency is allowed while I delete it. Migration to a new B-VID, ECT-ALGORITHM or away from one then only requires edge by edge re-provisioning, can be done over days/weeks.

5 Algorithm to B-VID association in Hello |Type= SPB-B-VID| = | Length | (1 byte) | ECT - VID Tuple (1) (6 bytes) | | | | ECT - VID Tuples (N) (6 bytes) | | ECT - Algorithm (32 bits) | | Base VID (12 bits) |U|M|RES|

6 Algorithm to B-VID association in LSP |Type = SPB-Inst| = | Length | (1 byte) | CIST Root Identifier (4 bytes) | | CIST Root Identifier (cont) (4 bytes) | | CIST External ROOT Path Cost (4 bytes) | | Bridge Priority | (2 bytes) |R R R R R R R R R R R|V| SPSOURCEID | | Num of Trees | (1 bytes) | VLAN-ID (1) Tuples (8 bytes) | | VLAN-ID (N) Tuples (8 bytes) |

7 TLV – SPB-Service Instance |Type = SPBM-SI | = | Length | (1 byte) | B-MAC ADDRESS | | B-MAC ADDRESS (6 bytes) | Res. | Base-VID (12 bits) | |T|R| Reserved | ISID #1 | |T|R| Reserved | ISID #2 | |T|R| Reserved | ISID #n | A service is assigned to an ALGORITHM indirectly through association with a Base-VID. The Base-VID of course is part of an ALGORITH,VID tuple.

8 Suggested approach for ECMP Assuming an 802.1aq network running some number of ECT-ALGORITHMS. A new B-VID, ECT-ALGORITHM tuple is assigned and advertised normally. The new B-VID, ECT-ALGORITHM would cause hash based forwarding/TTL decrement for UNICAST traffic only. Migration to/from this B-VID would be identical to any other B-VID running an AQ forwarding plane.

9 Possible ECMP encodings ECT-ALGORITHMUCAST BEHAVIORMCAST BEHAVIOR C2-00CIST C2-01SPF low path id C2-02SPF low mask 0xFF …. …… C2-10SPF low mask 0xEE C2-11ECMP hash alg#1SPF low path id C2-12ECMP hash alg#1SPF low mask 0xFF ……… C2-20ECMP hash alg#1SPF low mask 0xEE C2-21ECMP hash alg#2SPF low path id C2-22ECMP hash alg#2SPF low mask 0xFF ……… C2-30ECMP hash alg#2SPF low mask 0xEE

10