All-Path Bridging Update IEEE Plenary meeting San Francisco 17-21 July Jun Tanaka (Fujitsu Labs. Ld.) Guillermo Ibanez (UAH) Vinod Kumar (Tejas Networks.

Slides:



Advertisements
Similar presentations
Interconnection: Switching and Bridging CS 4251: Computer Networking II Nick Feamster Fall 2008.
Advertisements

All-Path Bridging Update IEEE Plenary meeting Atlanta 7-10 Nov. Jun Tanaka (Fujitsu Labs. Ld.) Guillermo Ibanez (UAH, Madrid, Spain) Vinod Kumar (Tejas.
CCNA3 v3 Module 7 v3 CCNA 3 Module 7 JEOPARDY K. Martin.
Ethernet Automatic Protection Switching (EAPS)
L3 + VXLAN Made Practical
Switching & Operations. Address learning Forward/filter decision Loop avoidance Three Switch Functions.
SPANNING TREE PROTOCOL (STP) VARIANTS Rapid Spanning Tree Protocol (RSTP) -The reason behind the word «rapid» Multiple Spanning Tree Protocol (MSTP)
CSE 534 Fundamentals of Computer Networks Lecture 4: Bridging (From Hub to Switch by Way of Tree) Based on slides from D. Choffnes Northeastern U. Revised.
CS 4700 / CS 5700 Network Fundamentals Lecture 7: Bridging (From Hub to Switch by Way of Tree) Revised 1/14/13.
Multi-Layer Switching Layers 1, 2, and 3. Cisco Hierarchical Model Access Layer –Workgroup –Access layer aggregation and L3/L4 services Distribution Layer.
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.
Dec 6, 2007CS573: Network Protocols and Standards1 Transparent Bridging Network Protocols and Standards Winter
Jan 01, 2008CS573: Network Protocols and Standards D – Selective Multicast Network Protocols and Standards Winter
1 LAN switching and Bridges Relates to Lab 6. Covers interconnection devices (at different layers) and the difference between LAN switching (bridging)
CSE390 Advanced Computer Networks Lecture 7: Bridging (From Hub to Switch by Way of Tree) Based on slides from D. Choffnes Northeastern U. Revised Fall.
Introduction to Computer Networks 09/23 Presenter: Fatemah Panahi.
1 25\10\2010 Unit-V Connecting LANs Unit – 5 Connecting DevicesConnecting Devices Backbone NetworksBackbone Networks Virtual LANsVirtual LANs.
1 LAN switching and Bridges Relates to Lab 6. Covers interconnection devices (at different layers) and the difference between LAN switching (bridging)
Layer 2 Switch  Layer 2 Switching is hardware based.  Uses the host's Media Access Control (MAC) address.  Uses Application Specific Integrated Circuits.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—1-1 Configuring Catalyst Switch Operations Introducing Basic Layer 2 Switching and Bridging Functions.
Networking Basics CCNA 1 Chapter 8
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429 Introduction to Computer Networks Lecture 8: Bridging Slides used with permissions.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 2: LAN Redundancy Scaling Networks.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.1 Module 7 Spanning Tree Protocol.
TRansparent Interconnection of Lots of Links (TRILL) March 11 th 2010 David Bond University of New Hampshire: InterOperability.
1 CS 4396 Computer Networks Lab LAN Switching and Bridges.
Multiple Links Failover Mechanism for RPR Interconnected Rings IEEE WG Orlando, Florida USA March 11~16, 2007.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning-Tree Protocol Cisco Networking Academy.
Presented by: Philippe Klein, Broadcom SRP Redundant Multipath Stream Selection (4) IEEE AVB WG Sep 2011 phkl-srp-stream-path-selection-0911-v01.
Steffen/Stettler, , 4-SpanningTree.pptx 1 Computernetze 1 (CN1) 4 Spanning Tree Protokoll 802.1D-2004 Prof. Dr. Andreas Steffen Institute for.
1 Transparent Bridging Advanced Computer Networks.
Cisco 3 – Switching STP Perrine. J Page 110/19/2015 Chapter 8 Spanning Tree Protocol (STP) Having redundancy in a network is important, and allows the.
Floodless in SEATTLE : A Scalable Ethernet ArchiTecTure for Large Enterprises. Changhoon Kim, Matthew Caesar and Jenifer Rexford. Princeton University.
OSI Model. Switches point to point bridges two types store & forward = entire frame received the decision made, and can handle frames with errors cut-through.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429 Introduction to Computer Networks Scaling Broadcast Ethernet Some slides used with.
© 1999, Cisco Systems, Inc. 1-1 Chapter 2 Overview of a Campus Network © 1999, Cisco Systems, Inc.
Configuring Cisco Switches Chapter 13 powered by DJ 1.
Spanning Tree V1.2 Slide 1 of 1 Purpose:
Cisco Network Devices Chapter 6 powered by DJ 1. Chapter Objectives At the end of this Chapter you will be able to:  Identify and explain various Cisco.
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning Tree Protocol.
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.
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
Topic 5 Spanning tree protocol
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—1-1 Configuring Catalyst Switch Operations Identifying Problems That Occur in Redundant Switched.
5: DataLink Layer 5a-1 Bridges and spanning tree protocol Reference: Mainly Peterson-Davie.
Ch. 15 Connecting LANs.
1 LAN switching and Bridges Relates to Lab Outline Interconnection devices Bridges/LAN switches vs. Routers Bridges Learning Bridges Transparent.
Chapter-5 STP. Introduction Examine a redundant design In a hierarchical design, redundancy is achieved at the distribution and core layers through additional.
Routing Semester 2, Chapter 11. Routing Routing Basics Distance Vector Routing Link-State Routing Comparisons of Routing Protocols.
CCNA1 v3 Module 8 v3 CCNA 1 Module 8 JEOPARDY S Dow.
Some aspects to be determined in PIRC July
Revisiting Ethernet: Plug-and-play made scalable and efficient
Lab 2 – Hub/Switch Data Link Layer
Chapter 4 Data Link Layer Switching
Lab 2 – Hub/Switch Data Link Layer
DCI using TRILL Kingston Smiler, Mohammed Umair, Shaji Ravindranathan,
Lecture#10: LAN Redundancy
Intra-Domain Routing Jacob Strauss September 14, 2006.
One Upon A Time Computer Networks
LAN switching and Bridges
CS 4700 / CS 5700 Network Fundamentals
IEEE 802.1Qca Path Control and Reservation
Connecting LANs, Backbone Networks,
CCNA Routing and Switching Scaling Networks v6.0
LAN switching and Bridges
CS 4700 / CS 5700 Network Fundamentals
LAN switching and Bridges
Bridges and Link Layer Switches
Presentation transcript:

All-Path Bridging Update IEEE Plenary meeting San Francisco July Jun Tanaka (Fujitsu Labs. Ld.) Guillermo Ibanez (UAH) Vinod Kumar (Tejas Networks )

All-Path : Basic Idea Modified learning, filtering and forwarding Addressed to small and medium size networks Objectives: overcome RSTP limitations and obtain good latency paths without configuration MAC=a MAC=b x x Flooding Blocking

2015/9/232 Scope of All-Path Scalability Manageability SPB, ECMP TRILL ALL-PATH Enterprise, Campus, Small datacenter etc. Simple Less operation Natural load balance Large area, provider network Large datacenter etc. Both support, loop free, shortest path LAN MAN/WAN

2015/9/233 Issue1. Path Recovery Mechanism: When unknown unicast frame arriving at bridge with failed link, path fail message is generated per MAC entry towards source bridge, that generates corresponding ARP to re-establish tree. Question: If 10K MAC entries are existed in FDB, 10K path fail frames should be generated, is it feasible processing for local CPU, especially in high-speed link (ex. 10GE)? It can be applicable for small or medium networks if we are targeting the enterprise, campus and small datacenter etc. Moreover, a solution is proposed that minimize the frame generation.

2015/9/234 Path recovery (cont’d) MAC=a MAC=b bbb b aaaa a a flush “b” SW1SW2 SW3 SW4 SW5 SW flush message is terminated because “b” is not binded to port1 May includes two or more…ex. 100s of MAC addresses to be flushed as a list. Delete entry “b” from FDB and re-sends the flush message to SW1. When link failure is detected, MAC flush lists (187 MAC / 1500B frame) are flooded. 54 frames by a day for 10K MAC entry. Avoid unnecessary flooding, MAC list is deleted to shorten. Issues: How to prevent flush frame loss. May require CPU processing power. Experience: 15ms to flush 10K MACs in a node (1GHz MIPS Core)

2015/9/235 Issue2. Server Edge Vswitch NIC Question: If a server has two or more NICs, how to find which port is first? vswitch: only vswitch to support All-Path VEB: both VEB and vswitch to support All-Path VEPA: only external switch to support All-Path Vswitch NIC VEB NIC VEB VEPA NIC Ext. switch

2015/9/236 Issue3. Load Balance Load balance is available in natural way because high load link tend not to be selected with queuing delay. Pros: zero-configuration load balance, no extra processing effort Cons: you cannot control load balance like SPB/ECMP

2015/9/237 Report on Proposal for AVB TG May 12, Thu, morning AVB Dr. Ibanez presented the materials as used in IW session (Singapore and Santa Fe) Questions and comments –Any other metric than latency e.g. bandwidth? –Path recovery time comparing with RSTP? –Any broadcast storm occurred when link failed? –What’s the status in IW session, any PAR created? AVB status –They try to solve by their own way, using SRP. –Not only latency but also bandwidth can be used as metric –Also redundant path can be calculated