TIME-SHARED LINK – DRNI LEARNING

Slides:



Advertisements
Similar presentations
Topology Discovery Requirements Loren Larsen World Wide Packets.
Advertisements

Split Brain Detection Version 00 Nigel Bragg September 4 th,
Link Selection and OAM Version 01 Stephen Haddock July 18,
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 19 Introduction to Computer Networks.
Flowspace revisited OpenFlow Basics Flow Table Entries Switch Port MAC src MAC dst Eth type VLAN ID IP Src IP Dst IP Prot L4 sport L4 dport Rule Action.
1 Interconnecting LAN segments Repeaters Hubs Bridges Switches.
Ethernet Frame PreambleDestination Address Source Address Length/ Type LLC/ Data Frame Check Sequence.
Network Redundancy Multiple paths may exist between systems. Redundancy is not a requirement of a packet switching network. Redundancy was part of the.
10/18/2007 EETS Bluetooth Bluetooth Architecture Bluetooth Applications The Bluetooth Protocol Stack The Bluetooth Radio Layer The Bluetooth Baseband.
Chapter 11 Extending LANs 1. Distance limitations of LANs 2. Connecting multiple LANs together 3. Repeaters 4. Bridges 5. Filtering frame 6. Bridged network.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning Tree Protocol.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—1-1 Configuring Catalyst Switch Operations Identifying Problems That Occur in Redundant Switched.
Spring Routing: Part I Section 4.2 Outline Algorithms Scalability.
Lec # 25 Computer Network Muhammad Waseem Iqbal. Learn about the Internetworking Devices – Repeaters – Hubs – Switches – Bridges – Routers.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing & Switching.
Supporting VUNI in DRNI Maarten Vissers v00
Network Models.
Instructor & Todd Lammle
Ch 16 Protocols and Layering
Distance Vector Routing Protocols
Semester 3, Chapter 5 Allan Johnson
MAC Address Tables on Connected Switches
Spanning Tree Protocol
802.1AX -- Link Aggregation: Editor’s Report: July 2017 Version 3
Instructor Materials Chapter 5: Ethernet
© 2002, Cisco Systems, Inc. All rights reserved.
Virtual Local Area Networks (VLANs) Part I
(How the routers’ tables are filled in)
OSPF (Open Shortest Path First)
Packet Switching Datagram Approach Virtual Circuit Approach
802-1AX-2014-Cor-1-d0-5 Sponsor Ballot Comments Version 2
Chapter 4 Data Link Layer Switching
Chapter 6 Delivery & Forwarding of IP Packets
Chapter 5: Inter-VLAN Routing
Introduction to Networking
Link Aggregation Simulator Version 1
Introduction to Networking
Lecture#10: LAN Redundancy
Spanning Tree Protocol
Routing.
Spanning Tree Protocol
Telecommunication II.
802.1AX-REV – Link Aggregation Revision
LESSON 2.1_B Networking Fundamentals Understand Switches.
RNI Requirements Imposed by PBB-TE
Distance Vector Routing Protocols
Module 8: Ethernet Switching
802-1AX-2014-Cor-1-d0-5 Sponsor Ballot Comments Version 1
Network Devices Hub Definition:
DATA COMMUNICATION Lecture-8.
Communication Networks NETW 501
Dynamic Routing and OSPF
Stephen Haddock September 13, 2012
CCNA Routing and Switching Scaling Networks v6.0
Chapter 8: Single-Area OSPF
Viet Nguyen Jianqing Liu Yaqin Tang
Connections Johan Lukkien
Overview The Internet (IP) Protocol Datagram format IP fragmentation
DRNI and Distributed Network Protection Model Evolution: Maarten  Norm  Steve Maarten Vissers v1  
Data-Centric Networking
Distance Vector Routing Protocols
Chapter 15. Connecting Devices
ECE 544 Project3 Team member.
Routing.
Connectors, Repeaters, Hubs, Bridges, Switches, Routers, NIC’s
Bridges Computer Networks.
Connectivity not actual links
Network Basics and Architectures Neil Tang 09/05/2008
© 2002, Cisco Systems, Inc. All rights reserved.
Presentation transcript:

TIME-SHARED LINK – DRNI LEARNING

From axbq-haddock-intra-das-link-0711-v02 From axbq-haddock-intra-das-link-0711-v02.pdf – the use case we are considering The difference between case 2a and 2b is that there is no predetermined link selection. When transmitting to the DRNI this means the link selected is on the first DRNI node encountered by the frame. In terms of gateway selection this means a DRNI node is the gateway for any frame received on any link that is not directly connected to the other DRNI node. When receiving from the DRNI node that receives the frame is also the gateway for that frame.

From axbq-haddock-intra-das-link-0711-v02 From axbq-haddock-intra-das-link-0711-v02.pdf - The Steady State Problem A Z 5 Y 6 DA = A, SA = Z Gateway Y must flood to IPL AND LAG - Y does not know if A is on-net or remote : - could be top left 8 DA = A – that is learned but SA = Z, and we don’t know where that is … C X B Gateway C learned Z  Gateway X learned A  7 Every frame of the A  Z conversation is propagated on-net, and also along the B  C link, thence to X where it is discarded (2nd Gateway); Every frame of the Z  A conversation is propagated on-net, and also along the Y  X link, thence to C where it is discarded (2nd Gateway); Net-net, the entire AC conversation gets replicated on the IPL / Network Link of the remote network to no purpose.

axbq-haddock-intra-das-link-0711-v02.pdf So what ? Mitigation possibilities include (in no particular order) : eliminate the IPL / Network Link timeshare mode. impose topology restrictions associated with the use of the IPL / Network Link timeshare mode e.g. only p2p service between over DRNI is supported in this mode; no MAC learning needed, simple VLAN forwarding rules “just work” others ? re-visit MAC learning synchronisation : Exchange “MACs learned from DRNI” enables Gateways to learn unicast routes for all conversations. there must be others ?

From axbq-haddock-intra-das-link-0711-v02 From axbq-haddock-intra-das-link-0711-v02.pdf - Step 2 – the problem summary A Z Y C X B Learning phase 2 Y propagates Z’s reply on learned route (via B), it must also replicate it to the DRNI (towards X), because the route could originate at S (top L), and Y is “1st Gateway” for route to S; To solve this, B must communicate to Y whence the original packet with SA = A came.

From axbq-haddock-intra-das-link-0711-v02.pdf - a possible solution. Z Y B From axbq-haddock-intra-das-link-0711-v02.pdf - a possible solution. A simple solution would be to use a modified MAC learning process : When B learns a source MAC in the normal way on any non-IPL link, it unicasts a control packet () on the IPL only, qualifying the source as { on-net, from-DRNI, local-time-out, unknown }, which is used to modify the attributes of the SA MAC also learned at Y by normal mechanisms (so MAC aging is handled by normal means). This MAC source communication does not need to be totally reliable : a lost packet results only in inefficiency, not failure (see slide 3), but transmission x 3 on first learning a MAC would be sensible, and repeating the MAC source qualification packet at infrequent intervals (e.g. MAC age-out time / 3 ?) will ensure sync in long term

REPRESENTING THE RELATIONSHIP BETWEEN DRNI (MASK) VARIABLES

Conversation_PortList[] Trying to make sense of the Conversation-sensitive frame collection and distributionVariables Port Algorithm TLV Port Conv ID Digest TLV aAggConversationAdminPort Conversation Mask TLV Port Conv Svc Map TLV Conversation_PortList[] Service ID &  Conversation-sensitive LACP aAggAdminServiceConvMap Collection_Conv_Mask per port  aggregate & Port Conversation ID  & & Actor_Oper_Port_State.Dist updateConversationMask per port  aggregate Comp_Oper_Conv_Mask receivedConversationMaskTLV ?  updateConversationMask ? Per Agg. Port Variables Port_Oper_Conv_Mask Partner_Oper_Conv_Mask Per Aggregator Variables Per Aggregator Attributes