Split Brain Detection Version 00 Nigel Bragg September 4 th, 2012 1.

Slides:



Advertisements
Similar presentations
Keiji Maekawa Graduate School of Informatics, Kyoto University Yasuo Okabe Academic Center for Computing and Media Studies, Kyoto University.
Advertisements

DRNI – Intra-DAS Link Version 01 Stephen Haddock July 20,
Link Selection and OAM Version 01 Stephen Haddock July 18,
G : DCM Signaling Mechanism Using GMPLS RSVP-TE ITU-T Workshop on IP-Optical, Chitose, Japan 7/11/2002 Dimitrios Pendarakis, Tellium, Inc. ITU-T.
1 DRNI Examples and DAS position Maarten Vissers Version 01.
LACP Project Proposal.
1 DRNI and Distributed Protection Examples Maarten Vissers v01 Based on slides presented in IW meeting in Nanjing on Thursday Sept 22.
Geneva, Switzerland, 13 July AX-REV – Link Aggregation Revision Panagiotis Saltsidis, Senior Specialist, Ericsson Joint IEEE-SA and ITU Workshop.
DNAv6 Goals JinHyeock Choi, Samsung AIT
Courtesy: Nick McKeown, Stanford
MPLS-TP PWE3 dual-homed protection (MPDP)
CSE University of Washington Multipath Routing Protocols in AdHoc Networks.
1/14 Ad Hoc Networking, Eli M. Gafni and Dimitri P. Bertsekas Distributed Algorithm for Generating Loop-free Routes in Networks With Frequently.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Spring Routing & Switching Umar Kalim Dept. of Communication Systems Engineering 06/04/2007.
16: Distributed Systems1 DISTRIBUTED SYSTEM STRUCTURES NETWORK OPERATING SYSTEMS The users are aware of the physical structure of the network. Each site.
Internetworking Fundamentals (Lecture #2) Andres Rengifo Copyright 2008.
Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Vector timestamps Global state –Distributed Snapshot Election algorithms.
Election Algorithms. Topics r Issues r Detecting Failures r Bully algorithm r Ring algorithm.
ICMP (Internet Control Message Protocol) Computer Networks By: Saeedeh Zahmatkesh spring.
Lecture 3a Mobile IP 1. Outline How to support Internet mobility? – by Mobile IP. Our discussion will be based on IPv4 (the current version). 2.
Presentation on Osi & TCP/IP MODEL
Slide /2009COMM3380 Routing Algorithms Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking BGP, Flooding, Multicast routing.
The OSI Model.
Rough Outline for a Intra-Portal Protocol Version 03 Stephen Haddock September 12,
Rough Outline for a Intra-Portal Protocol Version 02 Stephen Haddock August 23,
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 9 Virtual Trunking Protocol.
Introduction to Mobile IPv6
CSE 461 University of Washington1 Topic How do we connect nodes with a switch instead of multiple access – Uses multiple links/wires – Basis of modern.
Prepared by Engr.Jawad Ali BSc(Hons)Computer Systems Engineering University of Engineering and Technology Peshawar.
Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,
Thoughts on KeySec John Viega
September 2004Rudolf, Carlton and TGr Marian Rudolf, Alan Carlton - InterDigital doc: IEEE /1052r0.
Switching Topic 3 VTP. Agenda VTP basics Components Frames and advertisements Domains and revision numbers VTP operations VTP pruning VTP issues.
Ασύρματες και Κινητές Επικοινωνίες Ενότητα # 10: Mobile Network Layer: Mobile IP Διδάσκων: Βασίλειος Σύρης Τμήμα: Πληροφορικής.
Discussion for Distributed Aggregation Sublayer Ting Ao, Yuehua Wei, Jinghai Yu 1IEEE Plenary San Francisco 2011.
GMPLS Recovery Signaling Issues draft-rhodes-rsvp-recovery-signaling-01 Nic Neate Data Connection Ltd (DCL)
BGP Basics BGP uses TCP (port 179) BGP Established unicast-based connection to each of its BGP- speaking peers. BGP allowing the TCP layer to handle such.
Lecture 7. Building Forwarding Tables There are several methods Static Method Dynamic Methods Centralized Distributed Distance Vector Link State.
Coping with Link Failures in Centralized Control Plane Architecture Maulik Desai, Thyagarajan Nandagopal.
Redundancy. Single point of failure Hierarchical design produces many single points of failure Redundancy provides alternate paths, but may undermine.
Instructor Materials Chapter 2: Scaling VLANs
Advanced Computer Networks
CCNA 3 Chapter 10 Virtual Trunking Protocol
Interconnecting Cisco Networking Devices Part 2 (ICND2 v3.0)
Packet Switching Datagram Approach Virtual Circuit Approach
EA C451 Vishal Gupta.
Chapter 4: Network Layer
Internet Networking recitation #4
Configuring EtherChannels and Switch Troubleshooting
CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols
Chapter 2: Scaling VLANs
© 2002, Cisco Systems, Inc. All rights reserved.
802.1AX-REV – Link Aggregation Revision
Network Survivability
Chapter 3: Open Systems Interconnection (OSI) Model
Yang Zhang, Eman Ramadan, Hesham Mekky, Zhi-Li Zhang
802-1AX-2014-Cor-1-d0-5 Sponsor Ballot Comments Version 1
Commit Protocols CS60002: Distributed Systems
Process-to-Process Delivery:
Department of Computer and IT Engineering University of Kurdistan
Stephen Haddock September 13, 2012
Ethernet Network Network Interface: Heavy or Light?
Chapter 2: Scaling VLANs
TIME-SHARED LINK – DRNI LEARNING
Distance Vector Routing Protocols
Light ENNI – aka Split LAG …
Lecture 4a Mobile IP 1.
Presentation transcript:

Split Brain Detection Version 00 Nigel Bragg September 4 th,

Introduction from :- new-haddock-RNNI-split-brain-avoidance-1210-v1.pdf A split-brain situation arises when : 1.In normal operation, two (or more) devices depend upon a control path to coordinate their operation such that they function as a single virtual entity with a single identity; and 2.Upon failure of the common control path, the two (or more) devices operate independently but a)Each assumes the full functionality of the single virtual entity; and/or b)Each continues to use the identity of the single virtual entity. Split-brain issues are avoided if the solution is designed so that conditions 2a and 2b do not occur. –There are two general approaches to achieving this. 2

Approach A: Easy Split-Brain Avoidance Prevent condition 2b by: –Assuring that all devices, or all but one pre-determined device, always switch to a unique identity (different from the identity of the single virtual device) upon failure of the control path. Prevent condition 2a by either: –Assuring one and only one device assumes the full functionality of the single virtual device upon failure of the control path; or –Assuring that each device deterministically assumes a subset of the functionality that does not overlap or conflict with the subset assumed by another device. Link Aggregation, using the standard protocol without any changes running across the NNI, achieves this. Characterized as easy because this approach does not require distinguishing whether a node failure or a link failure resulted in the loss of the control path. 3

Approach B: Hard Split-Brain Avoidance Prevent condition 2b by: –Assuring that one and only one device continues to operate with the identity of the single virtual device upon failure of the control path. –Note that with hard split-brain avoidance there is always one device continuing to operate with the identity of the single virtual device, whereas with easy split-brain avoidance there may or may not be a device that continues to operate with the identity of the single virtual device. Prevention of condition 2a: –The options for prevention of condition 2a are the same for both easy and hard split-brain avoidance. This is because once the identity issue is resolved, there are many possible ways to resolve the division of functionality. Characterized as hard because this approach requires distinguishing whether a node failure or a link failure resulted in the loss of the control path. 4

The reference model :- Two Systems with Distributed Aggregation 5 System A Port System B Port Each Network Port on System A advertises: 1.Actor_System = A 2.Actor_Key = Ax 3.A Port ID for each port unique within A Each (non Gateway) Port on System C advertises: 1.Actor_System = C 2.Actor_Key = Cn 3.A Port ID for each port unique within C Where Cn is the same value on all of the ports, (possible) Network Link Intra-Portal Link (could be virtual) Emulated System C Port Each Network Port on System B advertises: 1.Actor_System = B 2.Actor_Key = Bx 3.A Port ID for each port unique within B Network Link Gateway Link (virtual) Gateway Link (virtual)

Split Brain Detection (1) It is desirable to solve the hard split brain problem to ensure that a portal continues to operate as a single virtual device whichever node within it might fail, which in turn requires that we have a robust way of determining that a node has failed, and not just been partially disconnected. Assertion it is necessary to check for node reachability by all possible paths before being entitled to regard it as dead So normal keep-alive can be limited to run on the inter-DAS link (1), but if that fails (e.g. from the PoV of A seeking to establish the reachability of B above) 1.we need to probe for network connectivity between A and B (2), and 2.we need to ascertain reachability of B via the DRNI (3) If B is unreachable by all routes, it doesnt matter if it has failed or not. 6 X X A B DRNI C XX YZ W ?

Split Brain Detection (2) If inter-DAS link (1), fails (e.g. from the PoV of A seeking to establish the reachability of B above) 1.We need to probe for network connectivity between A and B (2) – should be straightforward : –LBM from MEP(Sys ID A) MEP(Sys ID B) ? 2.We need to ascertain the reachability of B via the DRNI (3) : –it is not clear now to probe B directly from A (and be sure to use all the links (3) of the DRNI), –W may believe all links are a distributed LAG – poisoned reverse, so propose : –A could harvest from W the full list of Port IDs being offered by C : and need to request that that this information is fresh, –but the mechanism must also handle a dual-homed legacy real node W : is there a mechanism to allow this ? What then ? 7 X X A B DRNI C XX YZ W ? 2 1 3

Split Brain Detection (3) What then ? Assure that one and only one device continues to operate with the identity of the single virtual device on failure of the control path. a)If a Node sees zero connectivity to its mate Node, it picks up the DRNI identity C; b)If a Node has lost the inter-DAS link (1) and connectivity via its own network (2), but some physical connectivity to its mate is advertised by W over the DRNI (3), or that information is not available : – and so we must assume that connectivity exists, then the network behind A and B is severed : Node A reverts to its real LAG parameters as A, or would it be less disruptive to run its part of C using last agreed parameters ? c)Else use own network (2) to negotiate roles, or exchange DRCP messages 8 X X A B DRNI C XX YZ W ? o 000 a) 001 b) 010 c) 011 c)