Presented by: Philippe Klein, Broadcom SRP Redundant Multipath Stream Selection (4) IEEE 802.1 AVB WG Sep 2011 phkl-srp-stream-path-selection-0911-v01.

Slides:



Advertisements
Similar presentations
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—2-1 Extending Switched Networks with Virtual LANs Introducing VLAN Operations.
Advertisements

Communication Networks Recitation 3 Bridges & Spanning trees.
4/12/2015© 2009 Raymond P. Jefferis IIILect Internet Protocol - Continued.
Introduction to Computer Networks Spanning Tree 1.
Part 2: Preventing Loops in the Network
Switching & Operations. Address learning Forward/filter decision Loop avoidance Three Switch Functions.
Bridging. Bridge Functions To extend size of LANs either geographically or in terms number of users. − Protocols that include collisions can be performed.
“Internetworking” Bridges –Transparent bridges –Source Routing - Transparent Bridges Routers (Network Layer) Brouters
Sept 21, 2004CS573: Network Protocols and Standards1 Reconfigurations Network Protocols and Standards Autumn
Dec 6, 2007CS573: Network Protocols and Standards1 Transparent Bridging Network Protocols and Standards Winter
Making bigger LANs out of small ones What technology is available to us for connecting small LANs together into larger ones?
Sept 14, 2004CS573: Network Protocols and Standards1 Spanning Tree Algorithm Network Protocols and Standards Autumn
1 K. Salah Module 4.3: Repeaters, Bridges, & Switches Repeater Hub NIC Bridges Switches VLANs GbE.
Introduction to Computer Networks 09/23 Presenter: Fatemah Panahi.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—1-1 Configuring Catalyst Switch Operations Introducing Spanning Tree Protocol.
Layer 2 Switch  Layer 2 Switching is hardware based.  Uses the host's Media Access Control (MAC) address.  Uses Application Specific Integrated Circuits.
Introduction to IT and Communications Technology Justin Champion C208 – 3292 Ethernet Switching CE
STP Part II PVST (Per Vlan Spanning Tree): A Vlan field is added to the BPDU header along with Priority & Mac. Priority is 32768, Mac Address is MAC or.
Transparent Bridging. Chapter Goals Understand transparent bridge processes of learning, filtering, forwarding, and flooding. Explain the purpose of the.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.1 Module 7 Spanning Tree Protocol.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Lecture 12: LAN Redundancy Switched Networks Assistant Professor Pongpisit.
Multiple Links Failover Mechanism for RPR Interconnected Rings IEEE WG Orlando, Florida USA March 11~16, 2007.
All-Path Bridging Update IEEE Plenary meeting San Francisco July Jun Tanaka (Fujitsu Labs. Ld.) Guillermo Ibanez (UAH) Vinod Kumar (Tejas Networks.
1 Spanning Tree Algorithm Advanced Computer Networks.
Steffen/Stettler, , 4-SpanningTree.pptx 1 Computernetze 1 (CN1) 4 Spanning Tree Protokoll 802.1D-2004 Prof. Dr. Andreas Steffen Institute for.
1 Transparent Bridging Advanced Computer Networks.
Cisco 3 – Switching STP Perrine. J Page 110/19/2015 Chapter 8 Spanning Tree Protocol (STP) Having redundancy in a network is important, and allows the.
Presented by: Philippe Klein, Broadcom Quality of Service: AVB “support” for PRI QoS IEEE AVB WG Jul 2011 phkl-srp-qos-0711-v01.
LOGO Local Area Network (LAN) Layer 2 Switching and Virtual LANs (VLANs) Local Area Network (LAN) Layer 2 Switching and Virtual LANs (VLANs) Chapter 6.
OSI Model. Switches point to point bridges two types store & forward = entire frame received the decision made, and can handle frames with errors cut-through.
Geneva, Switzerland, 13 July 2013 IEEE 802.1Qca Path Control and Reservation János Farkas, Ericsson Joint IEEE-SA and ITU Workshop on Ethernet.
Configuring Cisco Switches Chapter 13 powered by DJ 1.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning Tree Protocol.
TRILL remaining issues Radia Perlman
Spanning Tree V1.2 Slide 1 of 1 Purpose:
Cisco Network Devices Chapter 6 powered by DJ 1. Chapter Objectives At the end of this Chapter you will be able to:  Identify and explain various Cisco.
Switching Topic 6 Rapid spanning tree protocol. Agenda RSTP features – Port states – Port roles – BPDU format – Edge ports and link types – Proposals.
DetNet BoF IETF #93 DetNet Problem Statement Monday, July 20 th, 2015 Norman Finn draft-finn-detnet-problem-statement.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning Tree Protocol.
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.
1 Version 3.0 Module 7 Spanning Tree Protocol. 2 Version 3.0 Redundancy Redundancy in a network is needed in case there is loss of connectivity in one.
Kireeti Kompella draft-kompella-mpls-rmr-01
Topic 5 Spanning tree protocol
CO5023 LAN Redundancy.
Submission doc.: IEEE 11-10/1231r0 Oct 2012 Philippe Klein, BroadcomSlide 1 CSN & BSS Bridging Date: Authors:
Copyright 2003 CCNA 3 Chapter 8 Spanning Tree Protocol By Your Name.
F2F April 7, Enumeration & Connection Management presented by Chris Pane.
Coping with Link Failures in Centralized Control Plane Architecture Maulik Desai, Thyagarajan Nandagopal.
Chapter-5 STP. Introduction Examine a redundant design In a hierarchical design, redundancy is achieved at the distribution and core layers through additional.
Network Topology Computer network topology is the way various components of a network (like nodes, links, peripherals, etc) are arranged. Network topologies.
Redundancy. Single point of failure Hierarchical design produces many single points of failure Redundancy provides alternate paths, but may undermine.
RSVP Setup Protection draft-shen-mpls-rsvp-setup-protection-03
Instructor Materials Chapter 3: STP
Spanning Tree Protocol
Transparent Bridging.
Spanning Tree Algorithm
Topic: Spanning Tree Protocol
Lecture#10: LAN Redundancy
Configuring Catalyst Switch Operations
Spanning Tree Protocol
© 2002, Cisco Systems, Inc. All rights reserved.
Spanning Tree Protocol
IEEE 802.1Qca Path Control and Reservation
NT2640 Unit 9 Activity 1 Handout
Connecting LANs, Backbone Networks,
CS4470 Computer Networking Protocols
BGP Instability Jennifer Rexford
Bridges Neil Tang 10/10/2008 CS440 Computer Networks.
IETF 102 (TEAS WG) Abhishek Deshmukh (presenting) Kireeti Kompella
Presentation transcript:

Presented by: Philippe Klein, Broadcom SRP Redundant Multipath Stream Selection (4) IEEE AVB WG Sep 2011 phkl-srp-stream-path-selection-0911-v01

The Goals Multipath streams to maximize bandwidth offered by the whole network topology Stream Redundancy 2 IEEE AVB WG - Sep 2011 T BB BB L L T BB BB L L Spanning Tree BB BB L L T MSRP Streams Topology Stream follows the spanning tree Multi-path streams beyond spanning tree Stream Redundancy

Additional SRP Talker Advertise Attributes New SRP Talker Advertise Attributes: – Source Port Stream_subID (could either be the Talker ports or the first downstream bridge “splitting” the TA over multiple egress ports) – Sequence ID (“easiest” option for loop protection; small counter is good enough) – Link Cost (computed from multiple metrics, specific computation on a per profile base) or Link Metrics 3 IEEE AVB WG - Sep 2011

Additional SRP Talker Advertise Attributes (cont) New SRP Talker Advertise Attributes: – Stream Reference Counters: Stream Ref Count: indicates the number of TA with different source Port Stream_subID handled by the bridge for a given stream ID Port Ref Count: indicates the number of TA with different Stream_subID handled by a given port of the bridge for a given stream ID Propagates the highest reference counts along the path If a listener requires redundancy without single point of failure, it will select the TAs with a Stream Ref Count equal to 1. If such TAs are not received by the Listener, it indicates a network engineering issue for which the fix is beyond the scope of SRP. The same scheme applies for a single point of failure per “wire” 4 IEEE AVB WG - Sep 2011

Bridge’s TA Propagation TAs are forwarded over every bridge’s egress port (regardless of their RSTP port state) – Loop protection by blocking duplicated TAs based on sequence ID – TAs could optionally not be forwarded on ports associated to a given spanning tree, allowing traffic separation between MSRP streams and “IT traffic” Configurable bridge selection between same Stream TA based on: – Stream SubID & Link Cost (configurable computation) / Metrics (configurable precedence between metrics) – Lowest Stream Reference Count 5 IEEE AVB WG - Sep 2011

MSRP Stream Forwarding MSRP Stream Paths created with the “multipath” MSRP TA/LR scheme presented in the previous slides will be loop free beyond Spanning Trees: However to forward MSRP streams beyond these Spanning Trees without modifying current bridge implementations (which might first filter out ingress datagrams based on bridge’s port states), these streams could be associated to a “Dummy Spanning Tree” for which bridge ports will always be configured to “forwarding” state. 6 IEEE AVB WG - Sep 2011

Open Question What is the effect of a change of the accumulated latency if the path is re-selected “on the fly” (i.e. a link fails and new spanning tree is established). Does the stream fails on any change ? Is it possible to configure a threshold so that if a new path is re- selected “on the fly” the full registration does not need to take place again (in case of link failure, the upstream bridge to propagate the last stored TA on the ports of the “dummy SP”. The Listener could receive the TAs thru a different path with a different accumulated latency…) ? 7 IEEE AVB WG - Sep 2011

8 Thank you