GMPLS Hands-On Workshop Presented at NASA Ames Research Center May 30 and 31, 2007.

Slides:



Advertisements
Similar presentations
MPLS and GMPLS Li Yin CS294 presentation.
Advertisements

Research Challenges in the Emerging Hybrid Network World Tom Lehman University of Southern California Information Sciences Institute (USC/ISI)
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.
Generalized Multiprotocol Label Switching: An Overview of Signaling Enhancements and Recovery Techniques IEEE Communications Magazine July 2001.
Advance in Design and Implementation of VLSR in Support of E2E VLAN DRAGON Meeting, 2005 Xi Yang Information Sciences Institute University of Southern.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Understanding MPLS TE Components.
Lonnie Decker Multiarea OSPF for CCNA Department Chair, Networking/Information Assurance Davenport University, Michigan August 2013 Elaine Horn Cisco Academy.
DRAGON Dynamic Resource Allocation via GMPLS Optical Networks Tom Lehman University of Southern California Information Sciences Institute (USC/ISI) National.
Requirement and protocol for WSON and non-WSON interoperability CCAMP WG, IETF 81th, Quebec City, Canada draft-shimazaki-ccamp-wson-interoperability-00.
1 Interdomain Routing Protocols. 2 Autonomous Systems An autonomous system (AS) is a region of the Internet that is administered by a single entity and.
IPv4 and IPv6 Mobility Support Using MPLS and MP-BGP draft-berzin-malis-mpls-mobility-00 Oleg Berzin, Andy Malis {oleg.berzin,
MPLS additions to RSVP Tunnel identification Tunnel parameter negotiation Routing policy distribution Routing debugging information Scalability improvements.
Networks: Routing1 Network Layer Routing. Networks: Routing2 Network Layer Concerned with getting packets from source to destination Network layer must.
Presented by: Dmitri Perelman Nadav Chachmon. Agenda Overview MPLS evolution to GMPLS Switching issues –GMPLS label and its distribution –LSP creation.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
MPLS H/W update Brief description of the lab What it is? Why do we need it? Mechanisms and Protocols.
MPLS and Traffic Engineering
1IMIC, 8/30/99 Constraint-Based Unicast and Multicast: Practical Issues Bala Rajagopalan NEC C&C Research Labs Princeton, NJ
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
MPLS A single forwarding paradigm (label swapping), multiple routing paradigms Multiple link-specific realizations of the label swapping forwarding paradigm.
CSEE W4140 Networking Laboratory Lecture 5: IP Routing (OSPF and BGP) Jong Yul Kim
Network Monitoring for Internet Traffic Engineering Jennifer Rexford AT&T Labs – Research Florham Park, NJ 07932
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Announcements List Lab is still under construction Next session we will have paper discussion, assign papers,
COS 420 Day 16. Agenda Assignment 3 Corrected Poor results 1 C and 2 Ds Spring Break?? Assignment 4 Posted Chap Due April 6 Individual Project Presentations.
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
1 Multi-Protocol Label Switching (MPLS) presented by: chitralekha tamrakar (B.S.E.) divya krit tamrakar (B.S.E.) Rashmi shrivastava(B.S.E.) prakriti.
Dynamic Circuit Network Hands-On Workshop University of Nebraska-Lincoln Nebraska Student Union Lincoln, NE July 19 th and 20 th, 2008.
Circuit Services - IPTV Christian Todorov Internet2 Fall Member Meeting October 9, 2007.
Link State Routing Protocol W.lilakiatsakun. Introduction (1) Link-state routing protocols are also known as shortest path first protocols and built around.
Link-State Routing Protocols
1 Multi-Protocol Label Switching (MPLS). 2 MPLS Overview A forwarding scheme designed to speed up IP packet forwarding (RFC 3031) Idea: use a fixed length.
GMPLS Interoperability Test Event Results and Recommendations
Introduction to MPLS and Traffic Engineering Zartash Afzal Uzmi.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
National Science Foundation Arlington, Virginia January 7-8, 2013 Tom Lehman University of Maryland Mid-Atlantic Crossroads.
M.Menelaou CCNA2 ROUTING. M.Menelaou ROUTING Routing is the process that a router uses to forward packets toward the destination network. A router makes.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS Introduction Module 4: Frame Mode MPLS Implementation.
MPLS and Traffic Engineering Ji-Hoon Yun Computer Communications and Switching Systems Lab.
Connect. Communicate. Collaborate VPNs in GÉANT2 Otto Kreiter, DANTE UKERNA Networkshop 34 4th - 6th April 2006.
HOPI Update Rick Summerhill Director Network Research, Architecture, and Technologies Jerry Sobieski MAX GigaPoP and TSC Program Manager Mark Johnson MCNC.
DRAGON Dynamic Resource Allocation via GMPLS Optical Networks API Overview Jaroslav Flidr, Peter O’Neil, Chris Tracy Mid-Atlantic Crossroads.
Rick Summerhill Chief Technology Officer, Internet2 Internet2 Fall Member Meeting 9 October 2007 San Diego, CA The Dynamic Circuit.
Dynamic Circuit Services Control Plane Overview April 24, 2007 Internet2 Member Meeting Arlington, Virginia Tom Lehman University of Southern California.
A Framework for Internetworking Heterogeneous High-Performance Networks via GMPLS and Web Services Xi Yang, Tom Lehman Information Sciences Institute (ISI)
Brief Introduction to Juniper and its TE features Huang Jie [CSD-Team19]
Hybrid MLN DOE Office of Science DRAGON Hybrid Network Control Plane Interoperation Between Internet2 and ESnet Tom Lehman Information Sciences Institute.
Introduction to OSPF Nishal Goburdhan. Routing and Forwarding Routing is not the same as Forwarding Routing is the building of maps Each routing protocol.
February 13, 2007 Winter 2007 Joint Techs Minneapolis, Minnesota Dynamic Services Control Plane Overview and Status Tom Lehman University of Southern California.
June 4, 2003Carleton University & EIONGMPLS - 1 GMPLS Generalized Multiprotocol Label Switching Vijay Mahendran Sumita Ponnuchamy Christy Gnanapragasam.
1 Module 4: Implementing OSPF. 2 Lessons OSPF OSPF Areas and Hierarchical Routing OSPF Operation OSPF Routing Tables Designing an OSPF Network.
Dynamic Lightpath Services on the Internet2 Network Rick Summerhill Director, Network Research, Architecture, Technologies, Internet2 TERENA May.
Routing and Routing Protocols
June 4, 2003Carleton University & EIONGMPLS - 1 GMPLS Generalized Multiprotocol Label Switching Vijay Mahendran Sumita Ponnuchamy Christy Gnanapragasam.
Dynamic Routing Protocols II OSPF
Optical + Ethernet: Converging the Transport Network An Overview.
Introducing a New Concept in Networking Fluid Networking S. Wood Nov Copyright 2006 Modern Systems Research.
+ Routing Concepts 1 st semester Objectives  Describe the primary functions and features of a router.  Explain how routers use information.
Internet2 Dynamic Circuit Services and Tools Andrew Lake, Internet2 July 15, 2007 JointTechs, Batavia, IL.
Label Distribution Protocols LDP: hop-by-hop routing RSVP-TE: explicit routing CR-LDP: another explicit routing protocol, no longer under development.
1 Revision to DOE proposal Resource Optimization in Hybrid Core Networks with 100G Links Original submission: April 30, 2009 Date: May 4, 2009 PI: Malathi.
Multi-protocol Label Switching
The Internet2 Network and LHC Rick Summerhill Director Network Research, Architecture, and Technologies Internet2 LHC Meeting 23 October 2006 FERMI Lab,
Multi Protocol Label Switching (MPLS)
Dynamic Routing Protocols II OSPF
Routing Jennifer Rexford.
Dynamic Routing Protocols II OSPF
CHAPTER 8 Network Management
Dynamic Circuit Service Hands-On GMPLS Engineering Workshop
Presentation transcript:

GMPLS Hands-On Workshop Presented at NASA Ames Research Center May 30 and 31, 2007

Welcome! This is the 3 rd GMPLS DCS Hands-ON Workshop The objective of this workshop is two fold: –Disseminate and incubate GMPLS control plane design and engineering concepts to the R&E networking community, –Obtain direct feedback from the community on how to improve the technologies…Hopefully, to help guide future development and deployment priorities and speed adoption

Why do a workshop? Dynamic Hybrid Networks are new… –The service concepts are still evolving… –The software and hardware implementations are still evolving… –Even the standards are still evolving… –The networks that support these capabilities are few…so far. –The user base is small [for now]…. But will grow as the capabilities mature and become more ubiquitous, persistent, and robust and the utility of both connection oriented services and dynamic provisioning becomes more widely recognized and accepted. Providing hands-on experience to design and deploy these architectures is one way to broaden and promote adoption.

Agenda Day 1 –9am Overview of GMPLS –10amExercise #1: Designing the Control Plane –11amBuilding the Control Plane –12noonLunch –1pmDebugging the Control Plane –2pmExercise #2: NARB and Local-ID –5pm Adjourn –7pm Dinner Day 2 –9amExercise #3: Inter-Domain Routing and Signaling –12noonLunch –1pmExercise #4: ASTs and XML Interface –3:30PmWrap up –4pm Adjourn

Workshop Perspective In this workshop we focus on implementation –We will design and build a multi-domain GMPLS controled ethernet network –We have a mobile GMPLS test and evaluation lab consisting of 24 PCs and 12 switches We will be focused on the GMPLS control plane issues –Specifically, OSPF and RSVP –We will do a very brief and cursory review of RSVP and OSPF. For detailed information on the protocols themselves see the IETF RFCs. We will not deal with ISIS or CR/LDP or LMP –We do not cover alternate control plane models other than to note where work is being done in related emerging areas We use open source software developed by the DRAGON Project –Adapted versions of KOM-RSVP and Zebra OSPF plus new tools and features –This software is the only GMPLS software available to support dynamic ethernet services –This software is being adapted and deployed by Internet2 to support dynamic circuit services. –It is being ported to support a wide variety of vendor equipment (e.g. Force10, Extreme, Dell, Ciena, Cisco, Raptor)

A Simple GMPLS Network GRE21 GRE24 GRE23 GRE22 GRE11 GRE13 GRE NARB D13 D12 D11 D14 eth0.2.3 eth eth0.7 GRE3 GRE5 GRE2 GRE4 GRE6 D2 D4 D3 D1 D5 VLSR1-PC VLSR1-SW VLSR3-PC VLSR3-SW VLSR2-PC VLSR2-SW a a a a a a a a a a a a eth1 11.a a a a a a a a a a.5.2 eth0.2.3 eth eth0.7 GRE3 GRE5 GRE2 GRE4 GRE6 D2 D4 D3 D1 D5 VLSR1-PC VLSR1-SW VLSR3-PC VLSR3-SW VLSR2-PC VLSR2-SW a a a a a a a a a a a a eth1 11.a a a a a a a a a a.5.2 eth0.2.3 eth eth0.7 GRE3 GRE5 GRE2 GRE4 GRE6 D2 D4 D3 D1 D5 VLSR1-PC VLSR1-SW VLSR3-PC VLSR3-SW VLSR2-PC VLSR2-SW a a a a a a a a a a a a eth1 11.a a a a a a a a a a.5.2 eth0.2.3 eth eth0.7 GRE3 GRE5 GRE2 GRE4 GRE6 D2 D4 D3 D1 D5 VLSR1-PC VLSR1-SW VLSR3-PC VLSR3-SW VLSR2-PC VLSR2-SW a a a a a a a a a a a a eth1 11.a a a a a a a a a a.5.2 …(Just kidding…)

Instructors and Friends Jerry Sobieski (MAX) Chris Tracy (MAX) These people are intimately involved in numerous projects related to deploying dynamic control planes: –NSF DRAGON –Internet2 HOPI Testbed and the new Dynamic Circuit Service –DICE (Dante, Internet2, Canarie, Esnet) - International

GMPLS Snapshot G eneralized M ulti- P rotocol L abel S witching – GMPLS –Evolved from MPLS concepts, and experiences gained from deployments within the IP packet world GMPLS extends Traffic Engineering (TE) concepts to the multiple layers: –Packet Switching Capable (PSC) – standard MPLS LSPs –Layer2 switch capable (L2SC) – Ethernet and VLANs –TDM switch capable (TDM) – SONET/SDH –Lambda switching (LSC) – Wavelength –Fiber Switch capable (FSC) In the GMPLS, any network element that supports one of the above switching capabilities and participates in the GMPLS control plane protocols is refered to as a “Label Switching Router” or LSR. GMPLS Protocols: –Routing: GMPLS-OSPF-TE –Signaling: GMPLS-RSVP-TE –Link layer: LMP –ISIS and CR/LDP are also considered part of the GMPLS protocols –In this workshop we will focus only on OSPF and RSVP

OSPF – “Open Shortest Path First” OSPF is a “Link State” Routing Protocol –OSPF routers discover each other thru a HELLO protocol exchanged over OSPF interfaces –Routers identify themselves with a “router id” (typically the loopback IP address or another unique IP address is used) –OSPF routers flood Link State Announcements (LSAs) to each other that describe their connections to each other and that specify the current link state of these connections In the GMPLS and TE extensions to OSPF, the LSA contains information about the available bandwidth, routing metrics, switching capabilities, encoding types, etc. LSAs are not flooded in the direction from which they are heard –OSPF routing is often divided into “areas” to reduce or limit LSA flooding in large networks –Each OSPF router in an area has a full topological view of its area –SPF identifies the next-hop for each known destination prefix

CSPF Constrained Shortest Path First –In OSPF TE, reachability is no longer the only criteria for deciding next-hop E.g. Bandwidth available on each intemediate link could be a constraint used to identify or select a path In GMPLS, with multiple switching capabilities, there are many constraints to be considered –Path Computation is used differently for selecting circuit layout than for selecting the next-hop for shortest path packet forwarding Two identical path requests may generate two completely separate paths (unlike traditional routed IP which would select only the single “best” path for forwarding packets) Paths are not computed until or unless a path is needed. –Some GMPLS service models do propose precomputing paths (or at least next-hops) based on certain apriori assumptions about the LSP – the tradeoff is generally one of scheduled “book ahead” reservations vs fast “on-demand” provisioning.

RSVP – ReSerVation Protocol GMPLS-RSVP-TE is the signaling (provisioning) protocol used to instantiate a Label Switched Path (LSP) thru the network Five basic RSVP messages we will reference: –PATH = First message issued by the source towatrds the destination requesting a connection be established –RESV = Response from the destination towards the source accepting the connection –PATH_TEAR = Message sent to tear down an LSP –PATH_ERR = Error message sent when a PATH request is denied or encounters a problem –REFRESH = Message sent between LSRs indicating a connection is still active (prevent timeout and deletion)

Path Computation Element In GMPLS, the Path Computation Element (PCE) is separated from the routing protocol. –The routing protocol ditributes topology information and builds the topology database that contains all the [visible] resources and their state – the Traffic Engineering Data Base (TEDB) –PCE is responsible for processing the TEDB to select a path through the network that meets the constraints specified in the service request (e.g. BW, encoding, Src/Dst, Policy, etc.) In GMPLS, the path so computed is expressed as an “Explicit Route Object” (ERO). –An ERO is simply a data structure that contains a sequentially ordered list of routers (LSRs) that the path will travers from Source to Destination –A “Loose Hop” ERO specifies a partial set of transit nodes – the path may include other nodes as long as it passes through the specified nodes in order. –A “Strict Hop” ERO specifies a complete list of transit nodes – no other intervening nodes are allowed. –RSVP includes the ERO in the PATH message to pin the path through specific nodes

What is the Control Plane? The Control Plane is the network facilities and associated protocols that select, allocate/deallocate, and provision network resources to fulfil a user service request. –Typically this includes routing protocols that distribute topology and reachability information among interconnected networks and network elements –It aslo includes other function that allocate appropriate resources and put those resources into sewrvice (Path computing and signalling) With GMPLS, routing and signaling messages between LSRs do not travel along the same path as the circuit being established. –The set of facilities between LSRs that carry the data circuits themselves is called the “Data Plane” –The set of facilities between LSRs that carry the routing and signaling protocols is called the “Control Plane” It is good practice to design the control plane so as to be highly robust and impervious to effects of other network traffic. –In the olden days of SS7, the control plane was a completely congruent but separate network from the data plane for phone calls. In this workshop, we will design a control plane that is congruent with the data plane –Some exceptions will be noted for hierarchichally routed domains.

Control Plane and Data Plane CP Label Switched Paths GMPLS Protocols GMPLS Protocols Label Switched Paths Control Plane Data Plane

The Virtual Label Switching Router VLSR The DRAGON Project proposed to cover ethernet switches with PCs running the open source GMPLS protocols, and re-configuring the switches on the fly using SNMP Ethernet Switch SNMP Linux Control PC Mgmt Interface Control Plane Data Plane VLSR - conceptual Core Ethernet Switch Operations Access Switch Linux Control PC Control Links Via GRE tunnels VLSR – physical

A [Typical] Label Switching Router - LSR Label Switching Fabric Data Interfaces Switching Fabric Interface Link Control Processor Management Interface

Laying Out the Control Plane S D R1 R2 R3 R4 R5 R6 D1 D2 D3 D4 D5 D6 D7 Lay out the data plane between NEs first. –For now, we are going to ignore intervening static NEs. –Make sure all Nes and links are uniquely labeled Then, control links connect the dynamic network elements If you are including end systems in the dynamic network, you should add them where appropriate C1 C2 C3 C4 C5 C6 C7 D8 D9 C9 C8

Control Plane R1R2R3 Data plane Often, the dynamic network elements are not directly adjacent to one another – but the control structure expects them to be (at least logically adjacent) We employ Generic Routing Encapsulation (GRE) tunnels for the control links in order to create logical adjacencies –GRE Tunnels are set up between two IP hosts. (these are the “tunnel endpoints”) –They present a pseudo interface to the end host that appears to be directly linked to the remote endpoint, thus allowing a single common IP subnet to be allocated on this pseudo interface. GRE Tunnel Endpoints Control Link Endpoints

Workshop Laboratory Four “Pods”: Red, Blue, Yellow, Green Each Pod represents an independent network domain Each Pod has two End Systems: ES1 and ES2 Each Pod has three Virtual LSRs (VLSRs) –Each VLSR has a PC (for ctrl plane) and a Ethernet switch (for data plane) Each Pod has one PC for interdomain routing support of the NARB The PCs are running Debian Linux –We have installed it and all the software required to download, build, and run the DRAGON software, and to perform the workshop labs We installed the DRAGON software –/usr/local/dragon/{bin,etc,workshop}

Basic Pod Data Plane ES1ES2 End System Ethernet Switch

Pod Network Elements VLSR1-PC VLSR1-SW ES1 Virtual Label Switching Router- “VLSR” VLSR1 ES2 End System VLSR3-PC VLSR3-SW VLSR3 VLSR2 NARB Network Aware Resource Broker- “NARB”

Management Addressing Workshop Gateway Router Management VLAN n/16 “Red” pod: ASN=1 “Blue” pod: ASN=2 “Yellow” pod: ASN=3 “Green” pod: ASN=4 Management VLAN n/16 GRE = 10...n / 30 GRE7= / eth0.2.3 eth eth0.7 TEaddr = 11...n / 30 D2 D4 D3 D1 D5 VLSR1 ES1ES2 VLSR3 NARB VLSR2 eth1 Dynamic Data plane port group = g3-g24 Dynamic VLAN range = 100…200

Rack Layout VLSR1-PC VLSR1-SW GW2 SW2 NARB VLSR2-PC VLSR2-SW VLSR3-SW VLSR3-PC ES1 ES2 VLSR1-PC VLSR1-SW NARB VLSR2-PC VLSR2-SW VLSR3-SW VLSR3-PC ES1 ES2. VLSR1-SW VLSR1-PC GW1 SW1 NARB VLSR2-SW VLSR2-PC VLSR3-PC VLSR3-SW ES1 ES2 VLSR1-SW VLSR1-PC NARB VLSR2-SW VLSR2-PC VLSR3-PC VLSR3-SW ES1 ES Rack 1 Rack 2

Exercise #1 VLSRs for the Masses Diagram a control plane for each pod Fill out the template for addressing scheme Connect the dots Configure the software Set up an LSP …and if that fails…read the instructions.

Workshop Testbed “Pod” Workshop Gateway Router Management VLAN n/16 “Red” pod: ASN=1 “Blue” pod: ASN=2 “Yellow” pod: ASN=3 “Green” pod: ASN=4 Management VLAN n/16 GRE = 10...n / 30 GRE7= / eth0.2.3 eth eth0.7 GRE1 GRE3 GRE5 GRE2 GRE4 GRE6 TEaddr = 11...n / 30 D2 D4 D3 D1 D5 VLSR1-PC VLSR1-SW ES1ES2 VLSR3-PC VLSR3-SW NARB VLSR2-PC VLSR2-SW a a a a a a a a a a a a eth1 11.a a a a a a a a a a.5.2 Dynamic Data plane port group = g3-g24 Dynamic VLAN range = 100…200

Command Line Interface ports –dragond 2611 –ospfd 2604 (intra-domain) –ospfd 2614 (inter-domain) –narb 2626 –rce 2688 > telnet localhost 2611

RSVP S D R1 R2 R3 R4 R5 R6 PATH(S,D)

Review Control plane design process: –Diagram intradomain data plane, enumerate the data links –Diagram a congruent control plane, enumerate the GRE links associated with each data link –Assign IP addresses to control links, identify the tunnel end points –Assign addresses to the TE-links Implementation: –Realize the data plane –Setup the GRE tunnels –Configure the VLSRs –Configure the NARB –Test

Day 2: Inter-domain NARB –Design (and implement) the inter-domain Data plane –Layout the inter-domain control plane –Configure the inter-domain OSPFd –Describe the “abstract topology” that NARB will advertise to external peers –Test Application Specific Topologies

The NARB Server Inter-Domain adjacencies Intra-ospfd Inter-ospfd Intra-Domain adjacency rce narbd User Interface

Full Topology

Partial Topology

Edge Topology

Point Topology

Inter-Domain Logical Topology Intra-domain ctrl plane Inter-domain ctrl plane Data plane ASN 1 ASN 2 ASN 3 ASN 4 GRE21 GRE24 GRE23 GRE22 GRE11 GRE12 GRE13 GRE NARB D13 D12 D11 D

Exercise #3 Interdomain Configuration Layout of the Inter-domain data plane and control plane –Identify data paths between edge LSRs for LSP provisioning –Establish control links between edge LSRs for RSVP signaling –Establish control links between NARBs for interdomain peering Configuration of the NARB abstract topology –Suggest for this exercise we use full topology (should be present in config files – just needs verification) Test LSP setup

Exercise #4 Triangle AST Detail Intra-domain ctrl plane Inter-domain ctrl plane Data plane ASN 1 ASN 2 ASN 3 ASN 4 GRE21 GRE24 GRE23 GRE22 GRE11 GRE12 GRE13 GRE NARB D13 D12 D11 D Red-es1 Green-es1 Blue-es2 eth1.110 eth1.112 eth1.110 eth1.112 eth1.111

Application Specific Topology XML Description – – – – – – red-es1 – /30 – – red-es2 – /30 – – eth100M – l2sc – ethernet –

E-science Application: Very Long Baseline Interferometry “E-VLBI” Aggregated streams at correlator: 2005 > 2 Gbs 2007 ~ 10 Gbs to 20+ Gbs 2010 > 40+ Gbs the “baselines” Radio Telescopes source b/w: 2005 = 512 Mbs 2007 = 2 Gbs 2010 > 4+ Gbs

E-VLBI Application Specific Topology Telescopes CorrelatorC X Y Z Logical e-VLBI Topology: Physical Instantiations of the Application Specific Topology Kashima, JP Dwingeloo, NL C X Y Z Koke Park, HI Seshan, CNKashima, JP W V Westerbork,NLJodrel Bank, UK MIT Haystack, US C X Y Z Westford, US Onsala, SENASA Goddard, US

Master D dragond E F B A C Application Specific Topologies “AST” C C dragond B B A A E E * RB OK ! Begin

Dynamic ASTs Node A Link C Node B Link E Node D Hierarchical / OO ASTs

HOPI/I2 DRAGON NL SE UK DRAGON and Friends deployments: Operational contiguous GMPLS L2SC dynamic reach: JP JGN II

Current Topics in Hybrid Networking Interdomain processes were not defined in original GMPLS RFCs Interdomain activities are being jointly explored and developed with the DICE Project –DANTE, Internet2, CANARIE, Esnet – (“DICE”) Currently have consensus on the processes: –Topology distribution –Path Computation –Reservation –Instantiation

DICE Interdomain Diagram

Topology Exchange Agreement on XML Schema for Topology definition: – describes LSRs – describes interfaces on a node – describes connections between NODEs and indicate the PORT mapping –Finalized initial version expected in June07 Reservation process includes two stage commits to select a path, then confirm it. –Each domain along the path must confirm it Policy issues still to be resolved Target deliverable of October 07 –Interoperability between Internet2, GEANT, Esnet, DRAGON Work progresses…