TRILL issue: Using Pseudonode Nicknames for Ingress RBridge Radia Perlman Hongjun Zhai Fangwei Hu 1November 2011.

Slides:



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

Radia Perlman Intel Labs
TRILL ESADI draft-hu-trill-rbridge-esadi-00 Hongjun Zhai (ZTE) Fangwei hu (ZTE) Radia Perlman (Intel Labs) Donald Eastlake 3 rd (Huawei) July 20111TRILL.
Communication Networks Recitation 3 Bridges & Spanning trees.
Introduction to Computer Networks Spanning Tree 1.
December 2007TRILL WG Vancouver1 TRILL issue: Pseudonodes Radia Perlman
Overview of TRILL Active-Active Goals, Challenges, and Proposed Solutions Radia Perlman 1November 2013.
COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
TRILL Cloudlet Radia Perlman Donald Eastlake 3 rd Fangwei Hu August 20121TRILL: Cloudlet.
Nirmala Shenoy, Daryl Johnson, Bill Stackpole, Bruce Hartpence Rochester Institute of Technology 1.
Directory Assisted TRILL Encapsulation by non-TRILL nodes (Directory Reliant Smart End Node) Linda Dunbar Donald Eastlake Radia Perlman Igor Gashinsky.
March 2007TRILL WG, IETF Prague1 TRILL issue: Multicast Input Link Filtering Radia Perlman
Bridging. Bridge Functions To extend size of LANs either geographically or in terms number of users. − Protocols that include collisions can be performed.
Single Area Border RBridge Nickname for TRILL Multilevel draft-zhang-trill-multilevel-single-nickname-00.txt Mingui Zhang, Donald Eastlake, Radia Perlman.
Centralized Replication for BUM traffic in active-active edge connection draft-hao-trill-centralized-replication-02 Weiguo Hao Huawei Yizhou Li Huawei.
TRILL: Traffic engineering draft-hu-trill-traffic-engineering-00.txt Fangwei Hu Jacni Qin
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.
Sept 21, 2004CS573: Network Protocols and Standards1 Reconfigurations Network Protocols and Standards Autumn
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
CSCI 4550/8556 Computer Networks Comer, Chapter 11: Extending LANs: Fiber Modems, Repeaters, Bridges and Switches.
1 Interconnecting LAN segments Repeaters Hubs Bridges Switches.
MULTICASTING Network Security.
Sept 14, 2004CS573: Network Protocols and Standards1 Spanning Tree Algorithm Network Protocols and Standards Autumn
Rbridges: Transparent Routing Radia Perlman
Chapter 27 Q and A Victor Norman IS333 Spring 2015.
Revision of the Appointed Forwarder RFC draft-eastlake-trill-rfc txt Donald E. Eastlake, 3 rd March 2015 Appointed.
1 Computer Networks LAN Bridges and Switches. 2 Where are we?
TRILL over IP draft-ietf-trill-over-ip-01.txt IETF 91, Honolulu Margaret Wasserman Donald Eastlake, Dacheng Zhang.
TRILL OAM draft-eastlake-trill-rbridge-channel-00 draft-bond-trill-rbridge-oam-01 draft-manral-trill-bfd-encaps-01 Donald Eastlake 3 rd Huawei Technologies.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing
Multicast Routing Protocols NETE0514 Presented by Dr.Apichan Kanjanavapastit.
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.
1 Spanning Tree Algorithm Advanced Computer Networks.
March th IETF - Prague1 TRILL Working Group From draft 03 to draft 04 Dinesh Dutt, Cisco Silvano Gai, Nuova Radia Perlman, Sun.
IP Multicast Lecture 3: PIM-SM Carl Harris Communications Network Services Virginia Tech.
Base Protocol Spec Radia Perlman
Chapter 22 Network Layer: Delivery, Forwarding, and Routing Part 5 Multicasting protocol.
TRILL Base Protocol Clarifications and Corrections November 20111TRILL: Clear Correct Donald E. Eastlake, 3 rd (Huawei) Mingui Zhang (Huawei) Anoop Ghanwani.
1 Multilevel TRILL draft-perlman-trill-rbridge-multilevel-00.txt Radia Perlman Intel Labs March 2011.
Ethernet (LAN switching)
November 2010Future TRILL Work1 Future TRILL Work 2 Donald Eastlake 3 rd 155 Beaver Street Milford, MA USA
TRILL OAM & BFD draft-eastlake-trill-rbridge-bfd-00.txt Donald E. Eastlake 3 rd 155 Beaver Street Milford, MA USA November 20101TRILL OAM & BFD Vishwas.
Rbridges: Transparent Routing Radia Perlman
Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1.
TRILL remaining issues Radia Perlman
TRILL OAM - Update, Status and Next Steps 84 th IETF, Vancouver, Canada.
1 Data Link Layer Lecture 23 Imran Ahmed University of Management & Technology.
M. Veeraraghavan (originals by J. Liebeherr) 1 Need for Routing in Ethernet switched networks What do bridges do if some LANs are reachable only in multiple.
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
5: DataLink Layer 5a-1 Bridges and spanning tree protocol Reference: Mainly Peterson-Davie.
PIM-BIDIR RP Resiliency Jeffrey Zhang, Kurt Windisch, Jaroslaw Adam Gralak Juniper Networks 88 th IETF, Vancouver.
1 Chapter 3: Packet Switching (Switched LANs) Dr. Rocky K. C. Chang 23 February 2004.
RBridges: Operations, Administration, and Maintenance (OAM) Support David Bond, Vishwas Manral UNH-IOL, IP Infusion draft-bond-trill-rbridge-oam-00 1.
CEN 5501C - Computer Networks - Spring UF/CISE - Newman1 Computer Networks Chapter 4 – Source Routing Bridges.
March th IETF - Prague1 TRILL Working Group Changes from draft-trill-rbridge-protocol-02.txt to draft-trill-rbridge-protocol-03.txt Dinesh Dutt,
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,
L3VPN WG2012-Jul-301 Bidirectional P-tunnels in MVPN Bidirectional P-tunnel: MP2MP LSP per RFC 6388 PIM MDT per RFC 5015, GRE Encapsulation Accommodated.
TRILL OAM- Status, Updates and Next Steps Tissa Senevirathne November, 2012 Version 3.1.
Ethernet switches and IP routers
CS 3700 Networks and Distributed Systems
Step-by-step explanation what happens if a L3 device is connected via a L2 vPC: Packet arrives at R R does lookup in routing table and sees 2 equal paths.
Spanning Tree Algorithm
Month 2002 doc.: IEEE /xxxr0 November 2004 Routing and Rbridges
CS 3700 Networks and Distributed Systems
RBridge Channel Tunnel Protocol
CS 4700 / CS 5700 Network Fundamentals
Routing and Switching Essentials v6.0
Source Routing Bridges
CS 4700 / CS 5700 Network Fundamentals
Presentation transcript:

TRILL issue: Using Pseudonode Nicknames for Ingress RBridge Radia Perlman Hongjun Zhai Fangwei Hu 1November 2011

Issue If the Appointed forwarder on a link changes from R1 to R2, remote RBridge endnode caches will be incorrect 2November 2011

Endnode cache wrong if AF changes shared link R1 R2R3 R8 rest of campus S1 Endnode cache S1/17 S2/38 S3/17 S2 S3 3November 2011

Solution: Use pseudonode nickname for ingress shared link R1 R2R3 R8 rest of campus Endnode cache S1/92 S2/92 S3/92 S1 S2 S3 4November 2011

Some subtleties Interaction with access links (links that are supposed to only be leaves…no inter-RB traffic…no inter-RB links advertised) –Can be done by not using a pseudonode (and having all RBs on the link claim they are using nickname “92”) –Or a pseudonode with nickname 92, and “overload” bit set, so paths through 92 not formed 5November 2011

Access link: need to forward rcv’d pkt addressed to “92” to AF shared link R1 R2R3 R8 rest of campus Endnode cache S1/92 S2/92 S3/92 S1 S2 S3 If R8 sends to “92”, pkt might reach non-AF Only AF can decapsulate! 6November 2011

Special case: might have “link aggregation port group” There’s a feature where a bridge B has two “up-links” to the RBs, only forwarding on one up-link (chosen at random), and never forwarding between the up-links But there wouldn’t be any AF’s in that case, and the RBs wouldn’t see each other’s Hellos 7November 2011

But in general case, need to forward on last hop to AF 8November 2011

Or not use pseudonode nickname on access links shared link R1 R2R3 R8 rest of campus S1 Endnode cache S1/17 S2/38 S3/17 S2 S3 9November 2011

Another subtlety: Reusing nickname when DRB changes 10November 2011

Reuse nickname if DRB changes DRB needs to tell other RBs what the pseudonode nickname is (in Hellos) If new DRB comes up, perhaps old RBs that remember the pseudonode nickname should tell the new DRB (in Hellos) what the pseudonode nickname was 11November 2011

But what if the link partitions into two links? Can the new DRB even tell the difference between a link partitioning and the DRB dying? 12November 2011

Issue: LAN partition vs DRB dies shared link R1 R2R3 R8 rest of campus S1 S2 S3 Endnode cache S1/92 S2/92 S3/92 13November 2011

Issue: DRB dies: Reuse “92” shared link R1 R2R3 R8 rest of campus S1 S2 S3 Endnode cache S1/92 S2/92 S3/92 14November 2011

Issue: LAN partition: Can R3 reuse “92”? Both R1 and R3 will want 92 shared link R1 R2R3 R8 rest of campus S1 S2 S3 Endnode cache S1/92 S2/92 S3/92 15November 2011

Recommendation Be optimistic and reuse the nickname If it’s really a partition, LSPs will resolve it Whoever has higher priority gets to keep it No reason why it’s better for old DRB to keep it rather than new one –in either case, some endnodes will have incorrect entries in distant RBridges 16November 2011

Another issue If nickname changes, alerting distant RBs that their endnode cache is now wrong –Either tell them to delete entries associated with nickname “92”, or tell them “entries that were 92 should now be 51” 17November 2011

Subtle issue: RPF check 18November 2011

Multidestination frames, pseudonode nickname, and the RPF check shared link L R1 R2R3 R Assume R3 is AF Chooses tree T4: S1 S2 S3 19November 2011

If “92” really was ingress, R8 will rcv packet via R1 shared link L R1 R2R3 R Assume R3 is AF Chooses tree T4: S1 S2 S3 20November 2011

How to simulate “92” ingressing the frame The AF has to be the one to encapsulate the frame And send it back onto the link But that’s not the same as “receiving the packet on the tree” So assume R3 is AF, and look at previous slide… R3 should encapsulate the frame, send it onto the link, but not forward it further until it receives the frame on a port in the tree 21November 2011

If “92” really was ingress, R8 will rcv packet via R1 shared link L R1 R2R3 R Assume R3 is AF Chooses tree T4: R6 S1 S2 S3 22November 2011

In that case, RPF check just works If those rules followed –AF encapsulates, and forwards back onto link –And only forwards encapsulated pkt on tree if pkt received on port in the tree No matter who is AF, packet looks like it comes from the pseudonode And will be received via only one path 23November 2011

So the RPF check will always be OK shared link R1 R2R3 R R8 will always receive packets from pseudonode 92, tree T4, via R1 RPF: 92 S1 S2 S3 24November 2011

Note double multidestination traffic on L Twice as much multicast traffic on L –native, and encapsulated –in both directions (first hop and last hop) This is a problem even without pseudonode nickname And can’t be avoided 25November 2011

Access links shared link R1 R2R3 R RPF: 92 without pseudonode nickname, no problem: ingress=AF’s nickname with: if R3 is AF, and that link is not in the tree, R3 must encapsulate and transmit onto L even though spec says not to ever send encapsulated traffic on an access link S1 S2 S3 26November 2011

Potential solution R3 should not volunteer to be an AF on L if R3’s port to L is not in any tree Else (R3’s port to L is in at least one tree) R3 should only ingress on behalf of L for trees that R3’s port to L is on 27November 2011