1 / 8

All-Path Bridging Update

All-Path Bridging Update. Jun Tanaka (Fujitsu Labs. Ld.) Guillermo Ibanez (UAH) Vinod Kumar ( Tejas Networks ). IEEE Plenary meeting San Francisco 17-21 July . All-Path : Basic Idea. Modified learning, filtering and forwarding

palmer
Download Presentation

All-Path Bridging Update

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

  2. 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 x Blocking x MAC=a Flooding MAC=b

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

  4. 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 solutionis proposed that minimize the frame generation.

  5. Path recovery (cont’d) flush “b” flush “b” a a 2 1 1 2 SW3 SW5 flush message is terminated because “b” is not binded to port1 3 3 a a b a b a b b 1 2 1 2 1 2 1 2 SW1 SW2 SW4 SW6 flush “b” MAC=a MAC=b Delete entry “b” from FDB and re-sends the flush message to SW1. May includes two or more…ex. 100s of MAC addresses to be flushed as a list. • 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)

  6. Issue2. Server Edge VEB VEB • 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 Vswitch VEPA NIC NIC NIC NIC NIC Ext. switch

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

  8. Report on Proposal for AVB TG • May 12, Thu, morning session @ 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

More Related