802.17c Protected Inter-Ring Connection

Slides:



Advertisements
Similar presentations
1 Metro Ethernet Forum OAM An Update Matt Squire Hatteras Networks.
Advertisements

Communication Networks Recitation 3 Bridges & Spanning trees.
Part 2: Preventing Loops in the Network
Protocol Strategies.
IEEE 802.1D: Spanning Tree Algorithm and the Filtering Database Ben Schultz Bridge Functions Consortium UNH InterOperability Lab July, 2000.
CSCI 465 D ata Communications and Networks Lecture 20 Martin van Bommel CSCI 465 Data Communications & Networks 1.
Chapter 9 Local Area Network Technology
SPANNING TREE PROTOCOL (STP) VARIANTS Rapid Spanning Tree Protocol (RSTP) -The reason behind the word «rapid» Multiple Spanning Tree Protocol (MSTP)
LECTURE 11 CT1303 LAN. DYNAMIC MAC PROTOCOL No fixed assignment for transmission media or any network resources.. It allows transmission when needed.
Bridging. Bridge Functions To extend size of LANs either geographically or in terms number of users. − Protocols that include collisions can be performed.
802.17c Protected Inter-Ring Connection Rafi Ram - Corrigent Systems March 2007.
Synchronization in Distributed Systems. Mutual Exclusion To read or update shared data, a process should enter a critical region to ensure mutual exclusion.
THE OSI MODEL KUDIRAT FAWEHINMI COSC 541.
Connecting LANs, Backbone Networks, and Virtual LANs
Routing Concepts Warren Toomey GCIT. Introduction Switches need to know the link address and location of every station. Doesn't scale well, e.g. to several.
Institute of Computer and Communication Network Engineering OFC/NFOEC, 6-10 March 2011, Los Angeles, CA Lessons Learned From Implementing a Path Computation.
Multiple Links Failover Mechanism for RPR Interconnected Rings IEEE WG Orlando, Florida USA March 11~16, 2007.
1 CMPT 471 Networking II DHCP Failover and multiple servers © Janice Regan,
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning-Tree Protocol Cisco Networking Academy.
Router and Routing Basics
CMPT 471 Networking II Address Resolution IPv4 ARP RARP 1© Janice Regan, 2012.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 LAN Switching and Wireless Implement Spanning Tree Protocols (STP) Chapter.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 15 Connecting LANs, Backbone Networks, and Virtual LANs Copyright © The McGraw-Hill Companies,
Mike Takefman7/16/2007IEEE RPRWG PIRC Architecture July 2007 Plenary Session San Francisco Mike Takefman Cisco Systems.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
Routing and Forwarding Simulation on Paper. We will simulate: Hop by hop forwarding DV - Distance vector routing (like RIP) LS - Link State routing (like.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning Tree Protocol.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 16 Connecting LANs, Backbone Networks, and Virtual LANs.
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.
CCNP 3: Chapter 3 Implementing Spanning Tree. Overview Basics of implementing STP Election of Root Bridge and Backup Enhancing STP RSTP MSTP EtherChannels.
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
Topic 5 Spanning tree protocol
Yan Wang Proposed amendments of control frames for c Yan Wang Huawei technologies.
5: DataLink Layer 5a-1 Bridges and spanning tree protocol Reference: Mainly Peterson-Davie.
1 Chapter 3: Packet Switching (Switched LANs) Dr. Rocky K. C. Chang 23 February 2004.
802.17c Protected Inter-Ring Connection Rafi Ram - Corrigent Systems January 2007.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Implement Spanning Tree Protocols (STP) LAN Switching and Wireless – Chapter.
RPR Interconnection Topologies IEEE WG Orlando, Florida USA March 11~16, 2007.
802.17c Protected Inter-Ring Connection Rafi Ram - Corrigent Systems March 2008.
Virtual Local Area Networks In Security By Mark Reed.
802.17c Protected Inter-Ring Connection Rafi Ram - Corrigent Systems May 2007.
Instructor Materials Chapter 3: STP
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 Protocol
Chapter 12 Multiple Access.
Chapter 4 Introduction to Network Layer
CT301 LECTURE 8.
Some aspects to be determined in PIRC July
3. Internetworking (part 2: switched LANs)
Chapter 4 Data Link Layer Switching
: An Introduction to Computer Networks
What is a router? A router is a device that connects multiple computers together. Not to be confused with a switch Routers transmit packets of data across.
The Load Balancing Schemes Observations
CHAPTER 3 Architectures for Distributed Systems
Shuffle Exchange Point-to-point, Bus, Ring, Star, Mesh
Internet Networking recitation #12
Spanning Tree Protocol
Subject Name: Computer Communication Networks Subject Code: 10EC71
Spanning Tree Protocol
802.1AX-REV – Link Aggregation Revision
Chapter 4 Introduction to Network Layer
Distributed P2P File System
Remote Procedure Call (RPC)
Chapter 11 Data Link Control and Protocols.
Communication Networks NETW 501
COS 561: Advanced Computer Networks
Dr. Rocky K. C. Chang 23 February 2004
Connections Johan Lukkien
Changes to SAE State Machine
Host and Small Network Relaying Howard C. Berkowitz
Presentation transcript:

802.17c Protected Inter-Ring Connection Rafi Ram - Corrigent Systems July 2007

PIRC Suggestion Highlights Stations A & B are members of a protection group (PG) for interconnect between two rings Station A and station B are protection group members (PGM) One of the interconnected rings shall be provisioned as the “primary” ring and the other as “secondary” ring The station on the secondary ring with the lower MAC address is designated as the “0” member, and the other as the “1” member

Network Diagram Stations A & C are “peer” stations Stations B & D are “peer” stations Stations A & B are “mate” stations Stations C & D are “mate” stations Stations A & B are protection group members on the primary ring Station A is the “0” member and station B is the “1” member Stations C & D are protection group members on the secondary ring Station C is the “0” member and station D is the “1” member

Station-OK State Variable Station-OK = (adminStatus==UP) AND (mateVisable==TRUE) AND

Peer Stations Communication Peer stations exchange messages which are also used as “keep-alive” The messages consist the following information (per protection group): Station-OK state variable Peer keep-alive timer expired The peer messages are sent : periodically after a protection event after change of admin-status after peer keep-alive timer expires

Self-OK State Variable Self-OK = (my_Station-OK==TRUE) AND (my_KA_Timer_Expired==FALSE) AND (peer_Station-OK==TRUE) AND (peer_KA_Timer_Expired==FALSE)

Mate Stations Communication Mate stations exchange messages which are also used as “keep-alive” Mate stations exchange the value of the Self-OK state variable (per protection group) : The mate messages are sent : periodically after a protection event after change Self-OK state variable value The messages could be new control type or new OAM type

PIRC Stations Communication

Mate-OK State Variable Mate-OK = (mateVisable==TRUE) AND (mate_Self-OK==TRUE) AND (mate_KA_Timer_Expired==FALSE)

PGM State Machine

MAC Table Flush 802.17b – When an interconnecting station no longer appears in the topology, the MAC entries associated with that stations are deleted When a PIRC station it sends SAS_Group_Notify message when : it changes PG state to “FWD-None” it changes PG state from “FWD-All” to “FWD-mine”

myFlow(frame) Function The function could be used to implementation of the load-balancing functionality On of the possible implementations of the myFlow function could be : myFlow(frame) = (hashing(frame) modulo 2) == member-type The hashing could be on the service class and/or VLAN “member-type” equals to 0 if the station is the 0 member, and equals to 1 if the station is the 1 member

PIRC Sublayer Logic on the Path Client  MAC as State Table Row Condition Action 1 MAC is on primary ring Forward 2 PG state is “fwd-none” Discard 3 PG state is “fwd-all” 4 myFlow(frame) 5 -

PIRC Sublayer Logic on the Path Client  MAC as Pseudo-Code if (MAC is on primary ring) forward frame else if (((PG state is “fwd-mine”) and myFlow(frame)) or (PG state is “fwd-all”)) then discard frame

PIRC Sublayer Logic on the Path MAC  Client as State Table Row Condition Action 1 (MAC is on primary ring) and (RPR SA is the mate MAC address) and (PG state is “fwd-all”) Discard 2 MAC is on primary ring Forward 3 RPR SA is the mate MAC address 4 PG state is “fwd-none” 5 PG state is “fwd-all” 6 myFlow(frame) 7 -

PIRC Sublayer Logic on the Path MAC  Client as Pseudo-Code if (MAC is on primary ring) if ((PG state is “fwd-all”) and (RPR SA is the mate MAC address)) discard frame else forward frame if (RPR SA is the mate MAC address) if (((PG state is “fwd-mine”) and myFlow(frame)) or (PG state is “fwd-all”)) then

Local Tributaries at PIRC Stations According to the suggested algorithm, if the PIRC station are isolated on the primary ring, then their local tributaries are also disconnected Complicating the algorithm to allow forwarding through the secondary ring is not critical because : isolation on the primary ring is a DUAL failure if the primary ring has isolation, the local tributaries at the PIRC stations are usually not the biggest problem