© 2010 Open Grid Forum STP and TF how they work Tomohiro Kudoh.

Slides:



Advertisements
Similar presentations
NSI wg Architecture Elements John Vollbrecht Internet2.
Advertisements

Information model for G.709 Optical Transport Network (OTN) draft-bccg-ccamp-otn-g709-info-model-03 CCAMP WG, IETF 79 th Beijing.
Lawrence Berkeley National LaboratoryU.S. Department of Energy | Office of Science Network Service Interface (NSI) Inder Monga Co-chair, Network Services.
Optical networks: Basics of WDM
© 2006 Open Grid Forum Network Service Interface in a Nut Shell GEC 19, Atlanta, GA Presenter: Chin Guok (ESnet) Contributors: Tomohiro Kudoh (AIST), John.
Ethernet and switches selected topics 1. Agenda Scaling ethernet infrastructure VLANs 2.
- A subscriber served by switch A wants to reach a service provided by lines starting with 800 (e.g. reserve a rental car) - The subscriber dials the company's.
Chapter 9 Graph algorithms. Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
The importance of switching in communication The cost of switching is high Definition: Transfer input sample points to the correct output ports at the.
William Stallings Data and Computer Communications 7 th Edition Chapter 2 Protocols and Architecture.
Comparison of MSTP and (G)ELS Benchmarking Carrier Ethernet Technologies Workshop Session AI.1: Scientific and Technical Results Krakow, Poland April 30,
COE 342: Data & Computer Communications (T042) Dr. Marwan Abu-Amara Chapter 2: Protocols and Architecture.
1 K. Salah Module 4.3: Repeaters, Bridges, & Switches Repeater Hub NIC Bridges Switches VLANs GbE.
Server Assisted TRILL Edge Linda Dunbar
Connecting LANs, Backbone Networks, and Virtual LANs
1 Introducing the Specifications of the Metro Ethernet Forum.
MODULE IV SWITCHED WAN.
National Science Foundation Arlington, Virginia January 7-8, 2013 Tom Lehman University of Maryland Mid-Atlantic Crossroads.
Integrated Dynamic IP and Wavelength Routing in IP over WDM Networks Murali Kodialam and T. V. Lakshman Bell Laboratories Lucent Technologies IEEE INFOCOM.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Implement Spanning Tree Protocols LAN Switching and Wireless – Chapter 5.
Topology Level: Prep-I Topic: Computer Networks Ms. Fouzia Yousuf October 25, 2010.
William Stallings Data and Computer Communications 7 th Edition Data Communications and Networks Overview Protocols and Architecture.
Switched network.
1 LAN design- Chapter 1 CCNA Exploration Semester 3 Modified by Profs. Ward and Cappellino.
1 IEX8175 RF Electronics Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.
Univ. of TehranAdv. topics in Computer Network1 Advanced topics in Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.
Connect. Communicate. Collaborate BANDWIDTH-ON-DEMAND SYSTEM CASE-STUDY BASED ON GN2 PROJECT EXPERIENCES Radosław Krzywania (speaker) PSNC Mauro Campanella.
NSI Topology Wishes OGF Lyon Sep 2011 Jerry Sobieski.
© 2009 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved. © The McGraw-Hill Companies, Inc. Internetworking, WANs, and Dynamic Routing.
1 Circuit switch controller: Routing and signaling Malathi Veeraraghavan University of Virginia Circuit switch –Routing –Signaling Difference in use of.
Connect. Communicate. Collaborate Stitching framework for AutoBAHN Victor Reijs, HEAnet TNC2007, May 23 rd, 2007
© 2006 Open Grid Forum Network Services Interface OGF 32, Salt Lake City Guy Roberts, Inder Monga, Tomohiro Kudoh 16 th July 2011.
CISCO PACKET TRACER By:- Ankita Rawat Sohit Mehta Sukhwinder Singh.
Unit III Bandwidth Utilization: Multiplexing and Spectrum Spreading In practical life the bandwidth available of links is limited. The proper utilization.
1 Switching and Forwarding Sections Connecting More Than Two Hosts Multi-access link: Ethernet, wireless –Single physical link, shared by multiple.
© 2006 Open Grid Forum Network Services Interface Document roadmap, April 2014 Guy Roberts, Chin Guok, Tomohiro Kudoh.
Data Link Protocols Relates to Lab 2.
1 Network Services Interface Connection Service v2.0 Tomohiro Kudoh (AIST) (OGF NSI-WG)
NSI Service Definition Federation of providers A group of network providers get together and decide that they wish to offer a multi-domain connection services.
1 Network Services Interface An Interface for Requesting Dynamic Inter- datacenter Networks Tomohiro Kudoh (AIST) Guy Roberts (DANTE) Inder Monga (ESnet)
Network No network resources exist outside a network Transport resources inside network –Link, Nodes, ports – are used to create connections between network.
© 2007 Open Grid Forum NSI CS Protocol State Machine Message Handling OGF 37.
© 2006 Open Grid Forum Network Services Interface Policy-based routing enforcement John MacAuley, ESnet 4 th February 2015.
© 2006 Open Grid Forum NML Progres OGF 28, München.
© 2006 Open Grid Forum A hierarchical, NSI compatible, topology proposal for NML Jerry Sobieski NORDUnet Presented at OGF 34.
Lawrence Berkeley National LaboratoryU.S. Department of Energy | Office of Science Network Service Interface: Concepts and Architecture Inder Monga Guy.
NSI Topology v2.0 Version 1.2 John MacAuley, ESNET September 22, 2014 Uppsala.
Chapter 3: Link Aggregation
Implement Spanning Tree Protocols
Dynamic Circuit Networks Topology Description Issues
(OGF NSI-WG co-chairs)
Switch Setup Connectivity to Other locations Via MPLS/LL etc
DISA under NSA-LUCITE Contract
NML-WG: Monday brainstorming
SUPA/YMCA (Yang Models for Configuration and topology Abstraction)
NSI Topology Thoughts on how topology fits into the NSI architecture
NSI wg Architecture Elements
Availability Query / Internal Topology
Implement Spanning Tree Protocols
Proposal for SwitchingService (SS)
Implement Spanning Tree Protocols
The University of Adelaide, School of Computer Science
IT Essentials 5.1 LAN Basics.
CCNA 3 v3 JEOPARDY Module 8 CCNA3 v3 Module 8 K. Martin.
Advanced Computer Networks
The University of Adelaide, School of Computer Science
Data Communications and Networking
Additional Example 2: Graphing Ordered Pairs Graph and label each point on a coordinate grid. A. L (3, 5) Start at (0, 0)
Implement Spanning Tree Protocols
Connecting Devices Hosts and networks do not normally operate in isolation Connecting devices connect hosts together to make a network or connect networks.
Presentation transcript:

© 2010 Open Grid Forum STP and TF how they work Tomohiro Kudoh

© 2010 Open Grid Forum STP is a point to which a network provides connection service Each STP belongs to just one network All the edge points to which a network wants to provide a connection service should be STPs. An STP connected to another network or end node should be paired with the corresponding STP of the connected network/node. A network can make STPs which are not connected to other network/node. In other words: (John’s perspective) A network has edges and the edge points are called STPs. When networks or end nodes connect to each other they connect STPs. 2

© 2010 Open Grid Forum Case 1: link is owned and managed(1) 3 Switch 1 Switch 2 Slot 1 Slot 2Slot 3 Switch 1 Network Boundary

© 2010 Open Grid Forum Case 1: link is owned and managed(2) 4 Switch 1 Switch 2 Slot 1 Slot 2Slot 3 Switch 1 Network B Network A Network C Here, three STPs are mapped to a physical port (c.f. VLANs) STP

© 2010 Open Grid Forum Case 1: link is owned and managed(3) 5 Network B Network A Network C TF (admission control only) TF

© 2010 Open Grid Forum Case 2: link belongs to one of the networks(1) 6 Switch 1 Switch 2 Slot 1 Slot 2Slot 3 Switch 1 Network Boundary

© 2010 Open Grid Forum Case 2: link belongs to one of the networks(2) 7 Switch 1 Switch 2 Slot 1 Slot 2Slot 3 Switch 1 Network B Network A

© 2010 Open Grid Forum Case 2: link belongs to one of the networks(2) 8 Network B Network A TF

© 2010 Open Grid Forum Case 3: link is not owned and managed(1) 9 Switch 1 Switch 2 Slot 1 Slot 2Slot 3 Switch 1 Network Boundary

© 2010 Open Grid Forum Case 3: link is not owned and managed(2) 10 Switch 1 Switch 2 Slot 1 Slot 2Slot 3 Switch 1 Network A Network B

© 2010 Open Grid Forum Case 3: link is not owned and managed(3) 11 Network A Network B TF Logically equivalent to “Case 2”

© 2010 Open Grid Forum STP and SDP 12 Network ANetwork B SDP is a pair of STPs of network A and B STP of a network

© 2010 Open Grid Forum 13 Network A Network B Switch 1 Switch 2 Slot 1 Slot 2Slot 3 Port 8 Port 13 Port 2 Port 7 Switch 1 GbE, VLAN 1-8 can be used 10GbE, No VLAN Network Boundary Sample configuration network A and B are Connected using one GbE (green) and one 10GbE (red) VLAN 1-8 on the green cable, no VLAN on the red cable

© 2010 Open Grid Forum STP: X1 STP: X2 STP: X1/1 STP: X1/2 STP: X1/8 Network ANetwork B Logical transport view and internal mappings Logical view (topology) Network A internal mapping: Switch 1/Port8 : X1 Switch1/Port8/VLAN1:: X1/1 Switch 1/Port8/VLAN8: X1/8 Switch 2/Port13: X2 Network B internal mapping: Switch 1/Slot1/Port2: YI Switch 1/Slot1/Port2 /VLAN1: Ya Switch 1/Slot1/Port2 /VLAN8: Yh Switch 1/Slot2/Port7: YJ STP:X1, YI : GbE STP X1/1 – X1/8, Ya-Yh : VLAN on GbE STP X2, YJ: 10GbE STP: YI STP: YJ STP: Ya STP: Yb STP: Yh Note: STP names are just symbols (labels) and do not necessarily correspond to physical implementation such as VLANs.

© 2010 Open Grid Forum How it works Only logical topology (left hand side of the previous slide) is advertised to requesters (assume network A and B have edge A and Z respectively) Requester NSA divides connection (A-Z )to (A-X1/2) and (Yb-Z), and requests these to network A and B respectively. Network A receives the connection request (A-X1/2) Then Network A internally translates X1/2 to Switch1/Port8/VLAN2 Checks its own calendar for availability of the internal connection, and grants the request. (Of course, similar translation should be done for A too.) Network B does the same thing for the request (Yb-Z) When the reserved time arrives: Network A provisions physical connection:(A-Switch1/Port8/VLAN2) Network B provisions physical connection:(Switch1/Slot1/Port2/VLAN2-Z) In this way, connection (A-Z) is successfully provisioned. 15

© 2010 Open Grid Forum STP (revisited) (1) STP is an logical label which can be used in a connection request to designate a termination point of intra-network connection. For a case, "VLANS on Ethernets on SONET on Waves," if requesting a wavelength is allowed, the wavelength should be an STP. Same for SONET or Ethernet. In such cases, STPs are hierarchically multiplexed. 16

© 2010 Open Grid Forum An STP is a label which is associated with a physical entity such as [switch 1, port3, vlan 2]. Intra-network connection request designates a pair of STPs. In other words, when requesting a connection, only an STP can be used to designate an edge of the connection. All possible STP should be listed and somehow advertised (in reality, wildcard like representation should be allowed) When provisioned, an STP instance is generated from a STP. SDP is a conceptual name of a pair of STPs of two networks. The pairing should be decided in advance by (out of NSI) negotiation between two networks. SDP does not necessarily have an identifier. The information which will be advertised by a network is: 1. A list of STP of the network 2. A list of STP of other networks which are paired to its STPs. (i.e. STPs at the other end of SDPs). 3. Transfer Function matrix of the network 17 STP (revisited) (2)

© 2010 Open Grid Forum Another example 18 The paired STPs, (a2, b1) is an SDP By requesting connect(a1, a2) to network A connect(b1, b2) to network B a1-b2 is connected. NetworkA advertises: 1.I have a1 and a2. 2.a2 is connected to b1 of networkB 3.TF: I can connect a1 and a2 NetworkB advertises: 1.I have b1 and b2. 2.b1 is connected to a2 of networkA 3.TF: I can connect b1 and b2 By gathering these information from networks, topology information sufficient for discovery can be constructed. Network ANetwork B TF a1a2b1b2 SDP