IEEE Infocom 2005 Demonstration ITEA TBONES Project
|
|
- Hortense Young
- 6 years ago
- Views:
Transcription
1 IEEE Infocom 2005 Demonstration ITEA TBONES Project A GMPLS Unified Control Plane for Multi-Area Networks D.Papadimitriou (Alcatel), B.Berde (Alcatel), K.Casier (IMEC), and R.Theillaud (Atos Origin)
2 ITEA TBONES Project: Demo Infocom 2005 Page 2 Hyatt Regency Hotel, Miami, FL, USA ITEA TBONES Demo Session: March 16 Demo project partners: Alcatel Bell (Belgium) Alcatel R&I (France) Atos Origin (France) University of Ghent IMEC (Belgium)
3 ITEA TBONES Project: Objectives Validation of dynamic Label Switched Path (LSP) provisioning in packet-optical multi-layer networks Traffic Engineering (TE) algorithms in single and multi-area networks Quantification of the performance (in terms of resource and speed) of constraint-based routing, pre-planned and dynamic re-routing Investigation of control plane interactions in packet-optical multi-layer networks (with specific focus on IP/MPLS) Interface with a Dimensioning Tool (DT) that calculates adequate dimensioning of the network topology according to a traffic matrix Page 3
4 ITEA TBONES Project: GMPLS Control Plane Page 4 Generalized Multi-Protocol Label Switching (GMPLS) Distributed IP-centric control plane Supports overlay and unified control plane interconnection model Control plane driven recovery (e.g. pre-planned and dynamic rerouting) Traffic Engineering (TE) for multi-area/multi-layer networks Constraint-based Routing - Operations (GMPLS) OSPF-TE 1 2 Routing Table Traffic engineering Database (TEDB) TE link Information: Distributed (piggybacked) using OSPF-TE Opaque Link State Advertisement and stored in the TE link state Database (TEDB) Operations performed by an ingress (G)MPLS capable node 4 Constrained-SPF Computation 5 Explicit Route Representation 3 6 Use Request Constraints RSVP Signaling
5 TBONES GMPLS Control Plane Emulator Page 5 Emulates the behavior of a set of nodes by instantiating for each node, a lower protocol stack and several control plane controllers. Each protocol stack implements IETF GMPLS protocol suite: Open Shortest Path First - Traffic Engineering (OSPF-TE) Resource reservation Protocol - Traffic Engineering (RSVP-TE) Each control plane controller set runs in its own process, they communicate with each other through the protocol stacks Each control plane controller consists of a set of modules: Node Emulator (NE) Signaling Controller (SIGC) TE Controller (TEC) Path Computation Controller (PCC)
6 Communication with the command engine TBONES GMPLS Control Plane Software Page 6 SPC handling, notifications Data-link failure SC handling CAC Signaling Controller Signaling Development Kit LSP database Policy provisioning and reporting Node emulation Path Computation TE Controller Controller Traffic Engineering Routing Development Kit topology & TE link database Management Plane Agent A B : A invokes a service provided by B RSVP-TE [Ethernet access] OSPF-TE TCP/UDP IP Access to simulated control channels
7 Signaling Controller (SIGC) Page 7 Processes the trigger GMPLS RSVP(-TE) signaling messages received from peering controllers Responsible for the Packet (PSC-) and Lambda (LSC-) LSP setup and release, and interacts for this purpose with the TEC The following signaling procedures are supported: Bi-directional LSPs Crankback Multi-area LSP provisioning: loose explicit routing + exclude route Failure notification Pre-planned LSP re-routing: secondary LSP activation Dynamic LSP re-routing: make-before-break LSP Hierarchy: Forwarding Adjacencies (FA-LSPs) Soft-Permanent Connections (SPCs): Explicit label control The SIGC relies on a Signaling Development Kit that maintains a database of all LSPs
8 Traffic Engineering Controller (TEC) Processes signaling information such as explicit, record and exclude routes, or constraints (suggested label, label sets, etc.) to choose on per hop basis, component TE link for each LSP Relies on a generic TE Development Kit (TEDK) that supports the communication with the lower protocol stack and its OSPF(-TE) component Maintains a TE database of all TE links (bundles and component links) advertised through OSPF(-TE) TE database is the main input to the PCC, other inputs include crankbackrelated information and signaled exclude route Note: OSPF(-TE) component maintains the routing adjacencies with peer nodes and the flooding of OSPF(-TE) Link State Advertisements (LSA) including global and per-interface mechanisms to limit the bandwidth consumed by such a flooding Updates TE link information, e.g., per-priority Unreserved and Maximum LSP bandwidth as advertised by OSPF(-TE), of each TE link used by an LSP Page 8
9 Experiments Page 9 1. TBONES software validation: OSPF(-TE), RSVP(-TE) stacks 2. TBONES software load and performance (benchmarking): OSPF(-TE), RSVP(-TE) 3. TBONES software capabilities 1. Multi-area LSP signaling (+ crankback) 2. Multi-region LSP signaling: Forwarding Adjacencies 3. Pre-planned and dynamic end-to-end LSP re-routing Pre-planned re-routing: protecting LSP resources are allocated at control plane level only and explicit action is required to activate (i.e. commit resource allocation) during the recovery phase Dynamic re-routing: switches traffic from the head-end node to an alternate LSP that is fully established only after failure occurrence
10 TBONES Test-bed Page 10 TBONES Transport plane Flow matrix description Per-layer topologies (at least the physical topology) NE Simulation (capabilities, resources, etc.) SC requests scheduler TBONES Control plane UNIX Processes Instantiated per simulated NE Control plane exchanges handling (e.g., routing and signaling) - Protocol stack implementation: OSPF(-TE), RSVP(-TE) Control plane control channels simulation (interconnection of all protocol stacks) Scheduled demands matrix (source, target, time interval) Emulator command engine XML file translation - topologies Per-layer Dimensioning Tool (DT) Dimensioning - (nodes, per-layer links) Per-layer routing (SPC) DUT Traffic Monitoring + Analyzer Control Plane Emulator_2 Ethernet Control Plane Emulator_1 Graphical Tool Dimensioning Tool
11 Oslo-9 Dublin-23 Glasgow-4 Copenhagen-5 Stockholm-11 Page 11 Area Area Amsterdam-12 London-25 Brussels-7 Paris-8 Strasbourg-22 Hamburg-18 Warsaw-27 Berlin-15 Frankfurt-20 Prague-13 Munich-21 Madrid-1 Zurich-17 Lyon-19 Bordeaux-10 Barcelona-16 Milan-50 (DUT) Vienna-14 Rome-6 Zagreb-26 Budapest-2 Belgrade-3 Athens-28
12 Experiment 1 Software Validation: OSPF-TE Page 12 Routing Adjacency (Two-way, Exstart, Full-State) between Milan (50) - Zurich (17) and Milan (50) - Munich (21) Link State Database Synchronization: LSDB Checksum per LSA (Type 1 and Type 10) per Area RIB update check after Type 1 LSA processing (Router Link State) TEDB update check after Type 10 LSA processing (TE Link State) add new TE link (e.g. FA-LSP) in Area 0 and in Area 17 re-check TEDB Re-check after LSRefreshTime (1800s) Deletion of LSA by setting MaxAge to 3600s
13 Page 13 Strasbourg-22 Zurich-17 Munich-21 Vienna-14 Transport plane topology Milan-50 (DUT) Zagreb-26 Strasbourg-22 Rome-6 Control plane (DCN) topology Zurich-17 Munich-21 Vienna-14 Milan-50 (DUT) Rome-6 Zagreb-26
14 Oslo-9 Dublin-23 Glasgow-4 Copenhagen-5 Stockholm-11 Page 14 Area Area Amsterdam-12 London-25 Brussels-7 Paris-8 Strasbourg-22 Hamburg-18 Warsaw-27 Berlin-15 Frankfurt-20 Prague-13 Munich-21 Madrid-1 Zurich-17 Lyon-19 Bordeaux-10 Barcelona-16 Milan-50 (DUT) Vienna-14 Rome-6 Zagreb-26 Budapest-2 Belgrade-3 Athens-28 ABR Internal Router
15 Experiment 1 Software Validation: OSPF-TE Page 15 Routing Adjacency (Two-way, Exstart, Full-State) Link State Database Synchronization: LSDB Checksum RIB update check after Type 3 LSA processing (Network Summary LS) From Zurich and Strasbourg toward Area 0 RIB update check after Type 4/5 LSA processing (ASBR Summary LS and AS_External LS) From Athens From Dublin From Zurich After LSRefreshTime (1800s): re-check Deletion of LSA by setting MaxAge to 3600s
16 Oslo-9 Glasgow-4 Stockholm-11 Page 16 Dublin-23 Copenhagen-5 Area Type 5 LSA AS_External_LS Area London-25 Paris-8 Brussels-7 Bordeaux-10 Amsterdam-12 Strasbourg-22 Lyon-19 Zurich-17 Hamburg-18 Frankfurt-20 Munich-21 Milan-50 (DUT) Berlin-15 Vienna-14 Prague-13 Zagreb-26 Warsaw-27 Budapest-2 Belgrade-3 Madrid-1 Barcelona-16 Rome-6 Type 5 LSA AS_External_LS Type 4 LSA ASBR_Summary_LS Athens-28 ABR Internal Router ASBR Type 5 LSA AS_External_LS
17 Experiment 1 Software Validation: RSVP-TE Page 17 Single Area (strict explicit routing) DUT as head-end of LSP (ingress): load sequential request file force same and different ERO for the set of LSPs between the same sourcedestination pair DUT as tail-end of LSP (egress): load sequential request file force same and different ERO for the set of LSPs between the same sourcedestination pair Same experiment with degree of freedom on ERO selection (either CP computes the Explicit Route or the Explicit Route is injected via the Management Plane i.e. XML file) Note: time interval from 100ms to 1000ms (increment of 100ms)
18 Experiment 1 Software Validation: RSVP-TE Page 18 Single Area (strict explicit routing) Measure (DUT as ingress) #Success events with first trial: without source crankback #Non success events after 1 trial and use source crankback #Non success events after 2 trials and use source crankback #Non success events after 3 trials and use source crankback Measure (DUT as egress) #Success events with first trial: without source crankback #Non success events after 1 trial and use source crankback #Non success events after 2 trials and use source crankback #Non success events after 3 trials and use source crankback
19 Experiment 1 Software Validation: RSVP-TE Page 19 Multi-Area (strict explicit routing) DUT as intermediate node (head-end ABR): load sequential request file force same strict ERO (in Area 0) for the set of LSPs between the same source-destination pair DUT as intermediate node (tail-end ABR): load sequential request file force same strict ERO (in Area 0) for the set of LSPs between the same source-destination pair Same experiment with degree of freedom on ERO selection (either CP computes the Explicit Route or the Explicit Route is injected via the Management Plane i.e. XML file) Note: time interval from 100ms to 1000ms (increment of 100ms)
20 Experiment 1 Software Validation: RSVP-TE Page 20 Multi-Area (loose explicit routing) Measure (DUT as intermediate node i.e. head-end ABR) #Success events with first trial: without source crankback #Non success events after 1 trial and use source crankback #Non success events after 2 trials and use source crankback #Non success events after 3 trials and use source crankback Measure (DUT as intermediate node i.e. tail-end ABR) #Success events with first trial: without intermediate/source crankback #Non success events after 1 trial and use intermediate crankback #Non success events after 2 trials and use intermediate crankback #Non success events after 3 trials and use intermediate crankback
21 Experiment 2 Software Performance: OSPF-TE Page Impact of TE routing information exchanges on performance: Type10_LSA: increase number of TE links (through setup of FA-LSPs across a particular LSC TE link) until reaching TEDB saturation 2. Impact of multi-area routing information exchanges on performance: Type3_LSA: using an increasing number of inter-area prefixes until reaching saturation Type4_/Type5 LSA: using an increasing number of Autonomous System Boundary Routers (ASBR) by injecting an increasing number of external prefixes per ASBR increase number of external prefixes per ASBR increase number of ASBR Running conditions: generate load within the network from 0% (default condition) then start from 10% until 90%, 95% and 99% - trigger on individual FA-LSP setup for saturation measurement Measure DUT (ABR) CP Process CPU and Memory usage
22 Oslo-9 Glasgow-4 Stockholm-11 Page 22 Dublin-23 Copenhagen-5 Area Area Amsterdam-12 London-25 Brussels-7 Paris-8 Strasbourg-22 Hamburg-18 Warsaw-27 Berlin-15 Frankfurt-20 Prague-13 Munich-21 Madrid-1 Zurich-17 Lyon-19 Bordeaux-10 Barcelona-16 Milan-50 (DUT) Vienna-14 Rome-6 Zagreb-26 Budapest-2 Belgrade-3 Athens-28 ABR Internal Router ASBR
23 Experiment 2 Software Performance: RSVP-TE Page 23 Single Area (strict explicit routing) Load test (in terms of maximum number of LSP) 1. starting with Min LSP Bandwidth = Max LSP Bandwidth (e.g. 1 Mbps) with Unreserved Bandwidth set to N x 10 Gbps 2. variation of the Max LSP Bandwidth value from Min LSP Bandwidth value per component TE link until Max Reservable Bandwidth value 3. Same test using inverse starting conditions Measure (DUT as ingress e.g. ASBR) #Success events with first trial CP process CPU / Memory usage Measure (DUT as egress e.g. ASBR) #Success events with first trial CP process CPU / Memory usage
24 Experiment 2 Software Performance: RSVP-TE Page 24 Single Area (strict explicit routing) DUT as head-end of LSP (ingress): load sequential request file force same and different ERO for the set of LSPs between the same sourcedestination pair DUT as tail-end of LSP (egress): load sequential request file force same and different ERO for the set of LSPs between the same sourcedestination pair Same experiment with variable degree of freedom on ERO selection Note: time interval from 100ms to 1000ms (increment of 100ms)
25 Experiment 2 Software Performance: RSVP-TE Page 25 Single Area (strict explicit routing) Measure (DUT as ingress) #Success events with first trial: without source crankback #Non success events after 1 trial and use source crankback #Non success events after 2 trials and use source crankback Path computation time: average, min/max, median DUT CP process CPU / Memory usage Measure (DUT as egress) #Success events with first trial: without source crankback #Non success events after 1 trial and use source crankback #Non success events after 2 trials and use source crankback Path computation time: average, min/max, median DUT CP process CPU / Memory usage
26 Experiment 2 Software Performance: RSVP-TE Page 26 Multi-Area (loose explicit routing) DUT as head-end of LSP (ingress): load sequential request file force same and different ERO for the set of LSPs between the same sourcedestination pair DUT as tail-end of LSP (egress): load sequential request file force same and different ERO for the set of LSPs between the same sourcedestination pair Same experiment with variable degree of freedom on ERO selection Note: time interval from 100ms to 1000ms (increment of 100ms)
27 Experiment 2 Software Performance: RSVP-TE Page 27 Multi-Area (loose explicit routing) Measure (DUT as ingress) #Success events with first trial: without source crankback #Non success events after 1 trial and use source crankback #Non success events after 2 trials and use source crankback Path computation time: average, min/max, median DUT CP process CPU / Memory usage Measure (DUT as intermediate node I.e. ABR) #Success events with first trial: without intermediate/source crankback #Non success events after 1 trial and use intermediate crankback #Non success events after 2 trials and use intermediate crankback Path computation time: average, min/max, median DUT CP process CPU / Memory usage
28 Experiments 3: TBONES software capabilities Page 28 TBONES software capabilities 1. Multi-area LSP signaling (+ crankback) 2. Multi-region LSP signaling: Forwarding Adjacencies 3. Pre-planned and dynamic end-to-end LSP re-routing Pre-planned re-routing: protecting LSP resources are allocated at control plane level only and explicit action is required to activate (i.e. commit resource allocation) during the recovery phase Dynamic re-routing: switches traffic from the head-end node to an alternate LSP that is fully established only after failure occurrence
29 Experiment 3 Multi-Region LSP Signaling Page 29 Single Area (strict explicit routing) DUT as head-end of the FA-LSP (nesting LSC LSP): load sequential request file force same and different (strict/loose) ERO for the set of PSC LSPs between the same source-destination pair DUT as tail-end of the FA-LSP (nesting LSC LSP): load sequential request file force same and different (strict/loose) ERO for the set of PSC LSPs between the same source-destination pair Same experiment with variable degree of freedom on ERO selection Note: time interval from 100ms to 1000ms (increment of 100ms)
30 Area Dublin-23 Glasgow-4 Oslo-9 Copenhagen-5 Stockholm-11 Page 30 Area Amsterdam-12 London-25 Brussels-7 Paris-8 Strasbourg-22 Hamburg-18 Warsaw-27 Berlin-15 Frankfurt-20 Prague-13 Munich-21 Madrid-1 Zurich-17 Lyon-19 Bordeaux-10 Barcelona-16 Milan-50 (DUT) Vienna-14 Rome-6 Zagreb-26 Budapest-2 Belgrade-3 Athens-28 ABR Internal Router
31 Area Dublin-23 Glasgow-4 Oslo-9 Copenhagen-5 Stockholm-11 Page 31 Area Amsterdam-12 London-25 Brussels-7 Paris-8 Strasbourg-22 Hamburg-18 Warsaw-27 Berlin-15 Frankfurt-20 Prague-13 Munich-21 Madrid-1 Zurich-17 Lyon-19 Bordeaux-10 Barcelona-16 Milan-50 (DUT) Vienna-14 Rome-6 Zagreb-26 Budapest-2 Belgrade-3 Athens-28 ABR Internal Router
32 Area Dublin-23 Glasgow-4 Oslo-9 Copenhagen-5 Stockholm-11 Page 32 Area Amsterdam-12 London-25 Brussels-7 Paris-8 Strasbourg-22 Hamburg-18 Warsaw-27 Berlin-15 Frankfurt-20 Prague-13 Munich-21 Madrid-1 Zurich-17 Lyon-19 Bordeaux-10 Barcelona-16 Milan-50 (DUT) Vienna-14 Rome-6 Zagreb-26 Budapest-2 Belgrade-3 Athens-28 ABR Internal Router
33 Experiment 3 Multi-Region LSP Signaling Page 33 Single Area (strict explicit routing) Measure (DUT as ingress) #Success events with first trial: without source crankback #Non success events after 1 trial and use source crankback #Non success events after 2 trials and use source crankback Path computation time: average, min/max, median DUT CP process CPU / Memory usage Measure (DUT as egress) #Success events with first trial: without source crankback #Non success events after 1 trial and use source crankback #Non success events after 2 trials and use source crankback Path computation time: average, min/max, median DUT CP process CPU / Memory usage
34 Experiment 3 Multi-Region LSP Signaling Page 34 Multi-Area (loose explicit routing) DUT as head-end of the FA-LSP e.g. ABR: load sequential request file force same and different (strict/loose) ERO for the set of PSC LSPs between the same source-destination pair DUT as tail-end of the FA-LSP e.g. ABR: load sequential request file force same and different (strict/loose) ERO for the set of PSC LSPs between the same source-destination pair Same experiment with variable degree of freedom on ERO selection Note: time interval from 100ms to 1000ms (increment of 100ms)
35 Area Dublin-23 Glasgow-4 Oslo-9 Copenhagen-5 Stockholm-11 Page 35 Area Amsterdam-12 London-25 Brussels-7 Paris-8 Strasbourg-22 Hamburg-18 Warsaw-27 Berlin-15 Frankfurt-20 Prague-13 Munich-21 Madrid-1 Zurich-17 Lyon-19 Bordeaux-10 Barcelona-16 Milan-50 (DUT) Vienna-14 Rome-6 Zagreb-26 Budapest-2 Belgrade-3 Athens-28 ABR Internal Router
36 Area Dublin-23 Glasgow-4 Oslo-9 Copenhagen-5 Stockholm-11 Page 36 Area Amsterdam-12 London-25 Brussels-7 Paris-8 Strasbourg-22 Hamburg-18 Warsaw-27 Berlin-15 Frankfurt-20 Prague-13 Munich-21 Madrid-1 Zurich-17 Lyon-19 Bordeaux-10 Barcelona-16 Milan-50 (DUT) Vienna-14 Rome-6 Zagreb-26 Budapest-2 Belgrade-3 Athens-28 ABR Internal Router
37 Area Dublin-23 Glasgow-4 Oslo-9 Copenhagen-5 Stockholm-11 Page 37 Area Amsterdam-12 London-25 Brussels-7 Paris-8 Strasbourg-22 Hamburg-18 Warsaw-27 Berlin-15 Frankfurt-20 Prague-13 Munich-21 Madrid-1 Zurich-17 Lyon-19 Bordeaux-10 Barcelona-16 Milan-50 (DUT) Vienna-14 Rome-6 Zagreb-26 Budapest-2 Belgrade-3 Athens-28 ABR Internal Router
38 Experiment 3 Multi-Region LSP Signaling Page 38 Multi-Area (loose explicit routing) Measure (DUT as ingress) #Success events with first trial: without source crankback #Non success events after 1 trial and use source crankback #Non success events after 2 trials and use source crankback Path computation time: average, min/max, median DUT CP process CPU / Memory usage Measure (DUT as intermediate node I.e. ABR) #Success events with first trial: without intermediate/source crankback #Non success events after 1 trial and use intermediate crankback #Non success events after 2 trials and use intermediate crankback Path computation time: average, min/max, median DUT CP process CPU / Memory usage
39 Experiment 3 Multi-Region LSP Signaling 1. Policy Based Management: FA-LSP Triggered Setup Experiment impact of triggering PSC LSP on existing FA-LSPs (during FA-LSP deletion phase) Condition: "If more than 90% of the current FA LSC TE link unreserved bandwidth is consumed and enough resources available (including FA LSC- LSP) not higher than a given percentage, e.g., 80 % Action: "Trigger setup of the FA LSC LSP" Page 39
40 Experiment 3 Pre-planned Re-routing (1) Shared link (1:N) resource at UNI Tunnel ID_1: LSP working 1 + LSP protecting 1 with LSP protecting 1 using same (shared) resources as LSP working 1 at source and dest. UNI, and different resources within the network Tunnel ID_2: LSP working 2 + LSP protecting 1 with LSP protecting 1 using same (shared) resources as LSP working 1 or 2 at source and dest. UNI, LSP working 2 resource disjoint from LSP working 1 etc. Page 40 Tunnel ID_N: LSP working N + LSP protecting 1 with LSP protecting 1 using same (shared) resources as LSP working 1 or... or N-1, or N at source and dest. UNI, and LSP working N disjoint from LSP Working 1,..., N-1 Setting 1: DUT as UNI client/network-side Setting 2: DUT as intermediate node generates Notify message towards head-end/tail-end node Running conditions: generate load within the network from 0% (default condition) then start from 10% until 90%, 95% and 99%
41 Experiment 3 Pre-planned Re-routing (1) Dimensioning Tool role: Help in pre-planning set of working and protecting LSP such that the set of working LSP and protecting LSP are mutually link/node disjoint Measurement CP process CPU / Mem. usage Generation and Processing of the Notify message (single source to single destination, single source to multiple destination incl. multiple LSPs under failure) Generation and Processing of the re-routing triggering Path message (processing overhead measurement) for secondary LSP activation Page 41
42 Experiment 3 Pre-planned Re-routing (2) Shared link (1:1)^n resource at UNI Tunnel ID_1: LSP working 1 + LSP protecting 1 with LSP protecting 1 using same (shared) resources as LSP working 1 at source and destination UNI, and different resources within the network Tunnel ID_2: LSP working 2 + LSP protecting 2 with LSP protecting 2 using same (shared) resources as LSP working 2 at source and destination UNI, LSP working 2 resource disjoint from LSP working 1 etc. Page 42 Tunnel ID_N: LSP working N + LSP protecting N with LSP protecting N using same (shared) resources as LSP working N at source and destination UNI, LSP working N resource disjoint from LSP working 1,..., N-1 Setting 1: DUT as UNI client/network-side Setting 2: DUT as intermediate node generates Notify message towards head-end/tail-end node Running conditions: generate load within the network from 0% (default condition) then start from 10% until 90%, 95% and 99%
43 Area Dublin-23 Glasgow-4 Oslo-9 Copenhagen-5 Stockholm-11 Page 43 Area Amsterdam-12 London-25 Brussels-7 Paris-8 Strasbourg-22 Hamburg-18 Warsaw-27 Berlin-15 Frankfurt-20 Prague-13 Munich-21 Madrid-1 Zurich-17 Lyon-19 Bordeaux-10 Barcelona-16 Milan-50 (DUT) Vienna-14 Rome-6 Zagreb-26 Budapest-2 Belgrade-3 Athens-28 ABR Internal Router
44 Oslo-9 Dublin-23 Glasgow-4 Copenhagen-5 Stockholm-11 Page 44 Area Area Amsterdam-12 London-25 Brussels-7 Paris-8 Strasbourg-22 Hamburg-18 Warsaw-27 Berlin-15 Frankfurt-20 Prague-13 Munich-21 Madrid-1 Zurich-17 Lyon-19 Bordeaux-10 Barcelona-16 Milan-50 (DUT) Vienna-14 Rome-6 Zagreb-26 Budapest-2 Belgrade-3 Athens-28 ABR Internal Router
45 Experiment 3 Pre-planned Re-routing (2) Dimensioning Tool role: Help in pre-planning set of working and protecting LSP such that the set of working LSP and protecting LSP are mutually link/node disjoint Measurement CP process CPU / Mem. usage Generation and Processing of the Notify message (single source to single destination, single source to multiple destination incl. multiple LSPs under failure) Generation and Processing of the re-routing trigger Path message (processing overhead measurement) for secondary LSP activation Page 45
46 Experiment 3 Dynamic Re-routing (2) Configuration Starting point: all (working) LSPs starting and terminating at the same source-destination pair (100%) or close at least (90%) End point: note: 90% means that at least 90% of the LSPs under failure are within the same source and destination pair and the other 10% are within a predetermined set of other source and destination pairs Page 46 all (working) LSPs start and terminate at different source-destination pair (0 %) Setting 1: DUT as UNI client/network-side Setting 2: DUT as intermediate node generates Notify message towards head-end/tail-end node Running conditions: generate load within the network from 0% (default condition) then start from 10% until 90%, 95% and 99%
47 Experiment 3 Dynamic Re-routing (2) Measurement CP process CPU / Mem. usage Generation and Processing of the Notify message (single source to single destination, single source to multiple destination incl. multiple LSPs under failure) Generation and Processing of the re-routing trigger Path message (processing overhead measurement) for primary LSP establishment Page 47
48 Oslo-9 Dublin-23 Glasgow-4 Copenhagen-5 Stockholm-11 Page 48 Area Area Amsterdam-12 London-25 Brussels-7 Paris-8 Strasbourg-22 Hamburg-18 Warsaw-27 Berlin-15 Frankfurt-20 Prague-13 Munich-21 Madrid-1 Zurich-17 Lyon-19 Bordeaux-10 Barcelona-16 Milan-50 (DUT) Vienna-14 Rome-6 Zagreb-26 Budapest-2 Belgrade-3 Athens-28 ABR Internal Router
49 Oslo-9 Dublin-23 Glasgow-4 Copenhagen-5 Stockholm-11 Page 49 Area Area Amsterdam-12 London-25 Brussels-7 Paris-8 Strasbourg-22 Hamburg-18 Warsaw-27 Berlin-15 Frankfurt-20 Prague-13 Munich-21 Madrid-1 Zurich-17 Lyon-19 Bordeaux-10 Barcelona-16 Milan-50 (DUT) Vienna-14 Rome-6 Zagreb-26 Budapest-2 Belgrade-3 Athens-28 ABR Internal Router
50 Oslo-9 Dublin-23 Glasgow-4 Copenhagen-5 Stockholm-11 Page 50 Area Area Amsterdam-12 London-25 Brussels-7 Paris-8 Strasbourg-22 Hamburg-18 Warsaw-27 Berlin-15 Frankfurt-20 Prague-13 Munich-21 Madrid-1 Zurich-17 Lyon-19 Bordeaux-10 Barcelona-16 Milan-50 (DUT) Vienna-14 Rome-6 Zagreb-26 Budapest-2 Belgrade-3 Athens-28 ABR Internal Router
51 Page 51
PONNI: A routing information exchange protocol for ASON 1
PONNI: A routing information exchange protocol for ASON 1 Sergio Sánchez-López, Xavier Masip-Bruin, Josep Solé-Pareta, Jordi Domingo-Pascual Advanced Broadband Communications Center (CCABA), Departament
More informationThe LSP Protection/Restoration Mechanism in GMPLS. Ziying Chen
The LSP Protection/Restoration Mechanism in GMPLS by Ziying Chen The LSP Protection/Restoration Mechanism in GMPLS by Ziying Chen A graduation project submitted to the Faculty of Graduate and Postdoctoral
More informationSession 2: MPLS Traffic Engineering and Constraint-Based Routing (CR)
MPLS Frame Relay Alliance formed in April 2003 Session 2: MPLS Traffic Engineering and Constraint-Based Routing (CR) Copyright 2003 MPLS Frame Relay Alliance Slide 2-12 MPLS Routing h The need for Traffic
More informationinternet technologies and standards
Institute of Telecommunications Warsaw University of Technology 2017 internet technologies and standards Piotr Gajowniczek Andrzej Bąk Michał Jarociński MPLS Multiprotocol Label Switching MPLS introduction
More informationBrainDumps.4A0-103,230.Questions
BrainDumps.4A0-103,230.Questions Number: 4A0-103 Passing Score: 800 Time Limit: 120 min File Version: 11.02 http://www.gratisexam.com/ A "brain dump," as it relates to the certification exams, is a source
More informationIntroduction to Segment Routing
Segment Routing (SR) is a flexible, scalable way of doing source routing. Overview of Segment Routing, page 1 How Segment Routing Works, page 2 Examples for Segment Routing, page 3 Benefits of Segment
More informationDeploying MPLS Traffic Engineering
9/27/16 Deploying MPLS Traffic Engineering Nurul Islam Roman (nurul@apnic.net) Cisco Public Agenda Technology Overview Bandwidth optimization TE for QoS Traffic Protection Inter- Domain Traffic Engineering
More informationGMPLS Overview Generalized MPLS
GMPLS Overview Generalized MPLS Hanyang Univ ( jijung@hanyang.ac.kr ) Outline GMPLS Overview Draft-ietf-ccamp-gmpls-architecture-00.txt GMPLS IGP Extension Draft-ietf-ccamp-ospf-gmpls-extensions-00.txt
More informationNetwork Configuration Example
Network Configuration Example RSVP LSP Tunnels Modified: 2016-12-14 Juniper Networks, Inc. 1133 Innovation Way Sunnyvale, California 94089 USA 408-745-2000 www.juniper.net All rights reserved. Juniper
More informationRFC 3945 GMPLS Architecture October Table of Contents
Network Working Group E. Mannie, Ed. Request for Comments: 3945 October 2004 Category: Standards Track Generalized Multi-Protocol Label Switching (GMPLS) Architecture Status of this Memo This document
More informationTestking.4A0-103,249.QA 4A Alcatel-Lucent Multi Protocol Label Switching
Testking.4A0-103,249.QA Number: 4A0-103 Passing Score: 800 Time Limit: 120 min File Version: 6.0 http://www.gratisexam.com/ 4A0-103 Alcatel-Lucent Multi Protocol Label Switching 1. These are the most accurate
More informationNetwork Configuration Example
Network Configuration Example GMPLS Modified: 2016-12-14 Juniper Networks, Inc. 1133 Innovation Way Sunnyvale, California 94089 USA 408-745-2000 www.juniper.net All rights reserved. Juniper Networks, Junos,
More informationErlang Reduced Load Model for Optical Burst Switched Grids
Erlang Reduced Load Model for Optical Burst Switched Grids Marc De Leenheer, Chris Develder, Filip De Turck, Bart Dhoedt, Piet Demeester Dept. of Information Technology - IBBT Ghent University Gaston Crommenlaan
More informationSelection of Spectral-Spatial Channels in SDM Flexgrid Optical Networks
Selection of Spectral-Spatial Channels in SDM Flexgrid Optical Networks Piotr Lechowicz, Krzysztof Walkowiak Wroclaw University of Science and Technology Mirosław Klinkowski ENGINE Centre and National
More informationVendor: Alcatel-Lucent. Exam Code: 4A Exam Name: Alcatel-Lucent Multiprotocol Label Switching. Version: Demo
Vendor: Alcatel-Lucent Exam Code: 4A0-103 Exam Name: Alcatel-Lucent Multiprotocol Label Switching Version: Demo QUESTION 1 You wish to advertise LDP labels for all local networks; which is the most effective
More informationConfiguring GMPLS with CLI
GMPLS Configuring GMPLS with CLI This section provides information to configure UNI GMPLS using the command line interface. Topics in this section include: GMPLS Configuration Overview on page 462 LMP
More informationAnycast End- to- end Resilience for Cloud Services over Virtual Op:cal Networks
Anycast End- to- end Resilience for Cloud Services over Virtual Op:cal Networks Minh Bui*, Brigi,e Jaumard *, and Chris Develder *: CSE Dept., Concordia University, Montreal, Canada : Ghent University
More informationImplementing GMPLS UNI
The Generalized Multiprotocol Label Switching (GMPLS) User Network Interface (UNI) creates a circuit connection between two clients (UNI-C) of an optical network. This connection is achieved by signaling
More informationJunos OS. RSVP LSP Tunnels Feature Guide. Release Published: Copyright 2011, Juniper Networks, Inc.
Junos OS RSVP LSP Tunnels Feature Guide Release 11.4 Published: 2011-11-08 Juniper Networks, Inc. 1194 North Mathilda Avenue Sunnyvale, California 94089 USA 408-745-2000 www.juniper.net This product includes
More informationMPLS Traffic Engineering Inter-AS TE
MPLS Traffic Engineering Inter-AS TE Last Updated: November 22, 2011 The MPLS Traffic Engineering: Inter-AS TE feature provides Autonomous System Boundary Router (ASBR) node protection, loose path reoptimization,
More informationCore Networks Evolution
Core Networks Evolution Prof. Daniel Kofman daniel.kofman@enst.fr Telecom Paris - ENST Content Any Service, Any Time, Everywhere, Everyone Towards the triple play and beyond Main trends in Core Networks
More informationPractice exam questions for the Nokia NRS II Composite Exam
Practice exam questions for the Nokia NRS II Composite Exam The following questions will test your knowledge and prepare you for the Nokia NRS II Composite Exam. Compare your responses with the Answer
More informationMPLS Multi-protocol label switching Mario Baldi Politecnico di Torino (Technical University of Torino)
MPLS Multi-protocol label switching Mario Baldi Politecnico di Torino (Technical University of Torino) http://staff.polito.it/mario.baldi MPLS - 1 From MPLS Forum Documents MPLS is the enabling technology
More informationSegment Routing On Demand SR Next Hop. Bertrand Duvivier Principal Engineer CKN, March 29 th 2016
Segment Routing On Demand SR Next Hop Bertrand Duvivier Principal Engineer CKN, March 29 th 2016 (from next slide) 2 Network Bandwidth demand in SP s Network demand double every 18 months Compute demand
More informationabout us bandwidth changes everything
about us bandwidth changes everything bandwidth changes everything We are a facilities based bandwidth infrastructure provider, delivering scalable, fibre based network solutions to our customers across
More informationRSVP-TE extensions for interdomain LSPs
Internet Engineering Task Force INTERNET-DRAFT Cristel Pelsser FUNDP Olivier Bonaventure UCL October, 2002 RSVP-TE extensions for interdomain LSPs Abstract We propose extensions to RSVP-TE to allow the
More informationMPLS Traffic Engineering Traffic Protection using Fast Re-route (FRR)
MPLS Traffic Engineering Traffic Protection using Fast Re-route (FRR) Santiago Álvarez August 2008 2007 Cisco Systems, Inc. All rights reserved. 1 MPLS TE Use Cases Strategic Bandwidth Optimization Tactical
More informationLDP Fast Reroute using LDP Downstream On Demand. 1. Problem: 2. Summary: 3. Description:
LDP Fast Reroute using LDP Downstream On Demand 1. Problem: LDP is a widely used label distribution protocol used for building end-to-end IP/MPLS LSPs across provider network. Many times critical IP applications
More informationIntroduction to OSPF
Introduction to OSPF 1 OSPF Open Shortest Path First Link state or SPF technology Developed by OSPF working group of IETF (RFC 1247) OSPFv2 standard described in RFC2328 Designed for: TCP/IP environment
More informationRouting Protocol Extension for Resilient GMPLS Multi-domain Networks
Routing Protocol Extension for Resilient GMPLS Multi-domain Networks Anna Manolova, Sarah Ruepp DTU Fotonik Oersteds plads Building 343 28 Kgs. Lyngby, Denmark {anva,srru}@fotonik.dtu.dk Telematics Engineering
More informationConfigure SR-TE Policies
This module provides information about segment routing for traffic engineering (SR-TE) policies, how to configure SR-TE policies, and how to steer traffic into an SR-TE policy. About SR-TE Policies, page
More informationImplementing Quality of Service for the Software Defined Networking Enabled Future Internet
Implementing Quality of Service for the Software Defined Networking Enabled Future Internet Sachin Sharma 1, Dimitri Staessens 1, Didier Colle 1, David Palma 2, Joao Goncalves 2, Ricardo Figueiredo 3,
More informationDeploy MPLS Traffic Engineering. APNIC Technical Workshop October 23 to 25, Selangor, Malaysia Hosted by:
Deploy MPLS Traffic Engineering APNIC Technical Workshop October 23 to 25, 2017. Selangor, Malaysia Hosted by: Acknowledgement Cisco Systems 2 Overview of MPLS TE 3 Why MPLS Traffic Engineering? Handling
More informationOn the design of MPLS-ASON/GMPLS Interconnection Mechanisms
On the design of MPLS- Interconnection Mechanisms Luis Velasco, Ricardo Romeral, Fernando Agraz, Salvatore Spadaro, Jaume Comellas, Gabriel Junyent, and David Larrabeiti Abstract In this paper we propose
More informationPrepAwayExam. High-efficient Exam Materials are the best high pass-rate Exam Dumps
PrepAwayExam http://www.prepawayexam.com/ High-efficient Exam Materials are the best high pass-rate Exam Dumps Exam : 4A0-101 Title : Alcatel-Lucent Interior Routing Protocols and High Availability Vendor
More informationMPLS-TE Configuration Application
CHAPTER 6 The contains the following tabs and subtabs: Global Tab, page 6-53 Labels Tab, page 6-54 Links Tab, page 6-55 General Subtab, page 6-56 Backup Tunnels Subtab, page 6-57 Tunnel Head Tab, page
More informationSegment Routing Commands
Segment Routing Commands address ipv4 (PCE), page 4 adjacency-sid, page 5 apply-weight ecmp-only bandwidth, page 7 attribute-set, page 8 autoroute announce, page 10 autoroute destination, page 12 clear
More informationIntroduction to IEEE 802.1Qca Path Control and Reservation
www.huawei.com Introduction to IEEE 802.1Qca Path Control and Reservation Authors: Hesham ElBakoury Version: 1.0 HUAWEI TECHNOLOGIES CO., LTD. GOAL Present the scope main concepts of the new IEEE 802.1Qca
More informationMulticast OLSP Establishment Scheme in OVPN over IP/GMPLS over DWDM
Multicast OLSP Establishment Scheme in OVPN over IP/GMPLS over DWDM Jeong-Mi Kim 1, Oh-Han Kang 2, Jae-Il Jung 3, and Sung-Un Kim 1,4 1 Pukyong National University, 599-1 Daeyeon 3-Dong Nam-Gu, Busan,
More informationMPLS Protection Switching vs. OSPF Rerouting
MPLS Protection Switching vs. OSPF Rerouting A Simulative Comparison Sandrine Pasqualini 1, Andreas Iselt 1, Andreas Kirstädter 1, and Antoine Frot 2 1 Siemens AG, Corporate Technology, Information & Communication,
More informationAlcatel-lucent EXAM - 4A Alcatel-Lucent Interior Routing Protocols and High Availability. Buy Full Product.
Alcatel-lucent EXAM - 4A0-101 Alcatel-Lucent Interior Routing Protocols and High Availability Buy Full Product http://www.examskey.com/4a0-101.html Examskey Alcatel-lucent 4A0-101 exam demo product is
More informationMulti Protocol Label Switching
MPLS Multi-Protocol Label Switching Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Network Management and QoS Provisioning - 1 MPLS: introduction
More informationIntroduction to OSPF
Introduction to OSPF ISP/IXP Workshops ISP/IXP Workshops 1999, Cisco Systems, Inc. 1 OSPF Dynamic Routing Protocol Link State technology Runs over IP, protocol 89 Designed by IETF for TCP/IP Supports VLSM
More informationMPLS Multi-Protocol Label Switching
MPLS Multi-Protocol Label Switching Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Computer Networks Design and Management - 1 MPLS: introduction
More informationDeploying MPLS Traffic Engineering
Deploying MPLS Traffic Engineering Agenda Technology Overview Bandwidth optimization TE for QoS Traffic Protection Inter-Domain Traffic Engineering General Deployment Considerations 2 Technology Overview
More informationGMPLS Configuration Commands. LMP Commands. lmp. gmpls-loopback-address. peer XRS MPLS Guide Page 493 GMPLS. Description
GMPLS GMPLS Configuration Commands LMP Commands lmp [no] lmp config>router This command creates a context for the configurartion of the Link Management Protocol (LMP) on the system. no lmp gmpls-loopback-address
More informationThe Emerging Optical Control Plane
The Emerging Optical Control Plane Traditional transport networks can be modeled as the interaction of two operating planes: a transport plane and a management plane. In this model, the transport plane
More informationInstitute of Telecommunications. Piotr Gajowniczek Andrzej Bąk Michał Jarociński
Institute of Telecommunications Warsaw University of Technology 2015 internet technologies and standards Piotr Gajowniczek Andrzej Bąk Michał Jarociński Link layer; Ethernet LAN link layer services framing,
More informationUnreserved Resource Information Advertisement Method in GMPLS
OECC 2007 Unreserved Resource Information Advertisement Method in GMPLS Masahiro Nishida Keio University No.1 Outline Background Conventional Advertisement method Proposed Advertisement method Performance
More informationCCAMP Groupe de Travail IETF 83 Paris 26 Mars 2012
draft-ali-ccamp-te-metric-recording-01.txt draft-ali-ccamp-rc-objective-function-metric-bound-01.txt draft-ali-ccamp-rsvp-te-include-route-01.txt draft-ali-ccamp-xro-lsp-subobject-01.txt CCAMP Groupe de
More informationA Segment Routing (SR) Tutorial. R. Bonica NANOG70 June 6, 2017
A Segment Routing (SR) Tutorial R. Bonica NANOG70 June 6, 2017 AKA: SPRING IETF Standardization Source Packet Routing In Networking (SPRING) WG ISIS, OSPF, IDR and MPLS WGs What is SR? A tunneling technology
More informationAn Experimental Analysis on OSPF-TE Convergence Time
An Experimental Analysis on OSPF-TE Convergence Time S. Huang* a, K. Kitayama a, F. Cugini b, F. Paolucci c, A. Giorgetti c, L. Valcarenghi c, P. Castoldi c a Osaka University, Osaka, Japan; b CNIT, Pisa,
More informationMulti Protocol Label Switching (an introduction) Karst Koymans. Thursday, March 12, 2015
.. MPLS Multi Protocol Label Switching (an introduction) Karst Koymans Informatics Institute University of Amsterdam (version 4.3, 2015/03/09 13:07:57) Thursday, March 12, 2015 Karst Koymans (UvA) MPLS
More informationDD2490 p Link-state routing and OSPF. Olof Hagsand KTH/CSC
DD2490 p4 200 Link-state routing and OSPF Olof Hagsand KTH/CSC Literature RFC 232: Browse through Section. Section 2 gives a very good understanding of OSPF issues. The example is realistic (complex) and
More informationOSPF Command Reference
OSPF OSPF Command Reference Command Hierarchies Configuration Commands on page 329 Show Commands on page 333 Clear Commands on page 333 Debug Commands on page 333 Configuration Commands config [no] ospf
More informationVendor: Alcatel-Lucent. Exam Code: 4A Exam Name: Alcatel-Lucent Interior Routing Protocols and High Availability.
Vendor: Alcatel-Lucent Exam Code: 4A0-101 Exam Name: Alcatel-Lucent Interior Routing Protocols and High Availability Version: Demo QUESTION 1 When a router receives an IP packet, but does not find a match
More informationDeploying MPLS Traffic Engineering
Deploying MPLS Traffic Engineering Agenda Technology Overview Bandwidth optimization TE for QoS Traffic Protection Inter-Domain Traffic Engineering General Deployment Considerations 2 Technology Overview
More informationInter-domain progress between US and Japan
Inter-domain progress between US and Japan Tomohiro Otani NICT Tsukuba RC, Japan KDDI R&D Laboratories, Inc. Agenda Introduction of JGN II project GMPLS E-NNI Experiment between US and Japan Standardizing
More informationFunctional validation of the cooperation between Virtual Network Topology Manager and Path Computation Element
Functional validation of the cooperation between Virtual Network Topology Manager and Path Computation Element O. Gonzalez de Dios, M. Cuaresma, S. Martinez, F. Muñoz, V. Lopez, J.P. Fernández-Palacios
More informationGMPLS The Unified Control Plane For Multi-layer Optical Transport Networks
GMPLS The Unified Control Plane For Multi-layer Optical Transport Networks 9. ITG Fachtagung des ITG-FA 5.2: Zukunft der Netze Selbstorganisation Chance und Herausforderung Dieter Beller 07-Oct-2010 Agenda
More informationChapter 16 OSPF Version 3 Commands
Chapter 16 OSPF Version 3 Commands NOTE: The OSPF version 3 configuration level is present only on HP devices that support IPv6. area Assigns OSPF version 3 areas. You can assign an IPv4 address or a number
More informationMPLS etc.. MPLS is not alone TEST. 26 April 2016 AN. Multi-Protocol Label Switching MPLS-TP FEC PBB-TE VPLS ISIS-TE MPƛS GMPLS SR RSVP-TE OSPF-TE PCEP
Multi-Protocol Label Switching MPLS-TP FEC VPLS PBB-TE MPLS etc.. MPLS is not alone LDP MPLS-TE LABEL MP-BGP LSP TAG H-VPLS 26 April 2016 AN TEST GMPLS SR T-MPLS ISIS-TE MPƛS OSPF-TE PCEP Multi-Protocol
More informationOSPFv2 Segment Routing Strict SPF
The OSPFv2 Segment Routing Strict Shortest Path First (SPF) feature provides information about the strict SPF segment identifiers (SIDs). Restrictions for, on page 1 Information About, on page 1 Enabling
More informationTest 2: NET3012 IP Architectures & Solutions Winter 2016 MPLS Modules 1-5; SA Module 1, Module 2 section1
Test 2: NET3012 IP Architectures & Solutions Winter 2016 MPLS Modules 1-5; SA Module 1, Module 2 section1 Time: 60 minutes; Test scored out of: 47 Total Marks available: 52 (Allocation of marks is shown
More informationCRE investment weakens in Q as investors struggle to find product in prime markets
2006.3 2007.1 2007.3 2008.1 2008.3 2009.1 2009.3 2010.1 2010.3 2011.1 2011.3 2012.1 2012.3 2013.1 2013.3 2014.1 2014.3 2015.1 2015.3 2016.1 Europe Capital Markets, Q1 2016 CRE investment weakens in Q1
More informationSelf-Protecting Multi-Paths A Simple and Efficient Protection Switching Mechanism
University of Würzburg Dept. of Distributed Systems Prof. Dr. P. Tran-Gia, Jens Milbrandt, Andreas Reifert Self-Protecting Multi-Paths A Simple and Efficient Protection Switching Mechanism Outline > Overview
More informationABNO: a feasible SDN approach for multivendor. optical networks. A. Aguado, V. López, J. Marhuenda, O. González de Dios and J.P. Fernández-Palacios
ABNO: a feasible SDN approach for multivendor IP and optical networks A. Aguado, V. López, J. Marhuenda, O. González de Dios and J.P. Fernández-Palacios Index Introduction 01 06 Conclusions 02 Carrier
More information4A Alcatel-Lucent. Alcatel-Lucent Interior Routing Protocols and High Availability
Alcatel-Lucent 4A0-101 Alcatel-Lucent Interior Routing Protocols and High Availability Download Full Version : http://killexams.com/pass4sure/exam-detail/4a0-101 QUESTION: 297 Click on the exhibit. In
More informationSegment Routing Configuration Guide
Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706 USA http://www.cisco.com Tel: 408 526-4000 800 553-NETS (6387) Fax: 408 527-0883 2017 Cisco Systems, Inc. All rights
More informationTechniques and Protocols for Improving Network Availability
Techniques and Protocols for Improving Network Availability Don Troshynski dtroshynski@avici.com February 26th, 2004 Outline of Talk The Problem Common Convergence Solutions An Advanced Solution: RAPID
More informationMultiprotocol Label Switching (MPLS)
Multiprotocol Label Switching (MPLS) Petr Grygárek rek 1 Technology Basics Integrates label-based forwarding paradigm with network layer routing label forwarding + label swapping similar to ATM/FR switching
More informationKTHNOC, MPLS/RSVP lab, rev: 1.7 KTHNOC. MPLS/RSVP lab. Juniper version. Group Nr. Name1. Name2. Name3. Name4. Date. Grade. Instructor s Signature
KTHNOC MPLS/RSVP lab Juniper version Group Nr Name1 Name2 Name3 Name4 Date Grade Instructor s Signature Table of Contents 1 Goals...3 2 Preparations...3 2.1RSVP concepts...3 3 Initial configuration...4
More informationComputer Network Architectures and Multimedia. Guy Leduc. Chapter 2 MPLS networks. Chapter 2: MPLS
Computer Network Architectures and Multimedia Guy Leduc Chapter 2 MPLS networks Chapter based on Section 5.5 of Computer Networking: A Top Down Approach, 6 th edition. Jim Kurose, Keith Ross Addison-Wesley,
More informationExam Questions 4A0-101
Exam Questions 4A0-101 Alcatel-Lucent Interior Routing Protocols and High Availability https://www.2passeasy.com/dumps/4a0-101/ 1.When a router receives an IP packet, but does not find a match in the routing
More informationSegment Routing Configuration Guide, Cisco IOS XE Fuji 16.7.x
Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706 USA http://www.cisco.com Tel: 408 526-4000 800 553-NETS (6387) Fax: 408 527-0883 2018 Cisco Systems, Inc. All rights
More informationA Connectionless Approach to Intra- and Inter-Domain Traffic Engineering
A Connectionless Approach to Intra- and Inter-Domain Traffic Engineering Hema T. Kaur, Shivkumar Kalyanaraman ECSE Department, Rensselaer Polytechnic Institute, Troy, NY-12180 {hema,shivkuma}@networks.ecse.rpi.edu
More informationSDN Workshop. Contact: WSDN01_v0.1
SDN Workshop Contact: training@apnic.net WSDN01_v0.1 Issue Date: [Date] Revision: [xx] Segment Routing SDN Workshop WSDN01_v0.1 Issue Date: [Date] Revision: [xx] Overview In a nutshell Introduction to
More informationOperation Manual MPLS. Table of Contents
Table of Contents Table of Contents Chapter 1 MPLS Architecture... 1-1 1.1 MPLS Overview... 1-1 1.2 MPLS Basic Concepts... 1-1 1.2.1 FEC... 1-1 1.2.2 Label... 1-1 1.2.3 LDP... 1-3 1.3 MPLS Architecture...
More informationTable of Contents 1 Static Routing Configuration RIP Configuration 2-1
Table of Contents 1 Static Routing Configuration 1-1 Introduction 1-1 Static Route 1-1 Default Route 1-1 Application Environment of Static Routing 1-1 Configuring a Static Route 1-2 Configuration Prerequisites
More informationGeneralized MPLS Introduction and Deployment
Generalized MPLS Introduction and Deployment Session BRKMPL-3010 Santiago Álvarez Distinguished Engineer saalvare@cisco.com Agenda Motivation Technology Overview Dynamic Optical Path Setup Diverse Optical
More informationGeneralized MPLS UNI Introduction and Deployment
Generalized MPLS UNI Introduction and Deployment BRKMPL-3010 Santiago Álvarez Distinguished Engineer saalvare@cisco.com Agenda Motivation Technology Overview Dynamic Optical Path Setup Diverse Optical
More informationOSPF Demand Circuit Feature
OSPF Demand Circuit Feature Document ID: 5132 Contents Introduction Prerequisites Requirements Components Used Conventions How Is OSPF over Demand Circuit Different from a Normal Circuit? Suppressed Periodic
More informationLARGE SCALE IP ROUTING LECTURE BY SEBASTIAN GRAF
LARGE SCALE IP ROUTING LECTURE BY SEBASTIAN GRAF MODULE 05 MULTIPROTOCOL LABEL SWITCHING (MPLS) AND LABEL DISTRIBUTION PROTOCOL (LDP) 1 by Xantaro IP Routing In IP networks, each router makes an independent
More informationConfiguring OSPF network management 39 Enabling message logging 39 Enabling the advertisement and reception of opaque LSAs 40 Configuring OSPF to
Contents Configuring OSPF 1 Introduction to OSPF 1 Basic concepts 1 OSPF areas 3 Router types 6 OSPF network classification 7 DR and BDR 8 OSPF packet formats 9 Supported OSPF features 17 Protocols and
More informationIntroduction to OSPF
Introduction to OSPF ISP/IXP Workshops ISP/IXP Workshops 1999, Cisco Systems, Inc. 1 Agenda OSPF Primer OSPF in Service Provider Networks OSPF BCP - Adding Networks OSPF Command Summary 2 OSPF Primer 3
More informationOSPF (Open Shortest Path First)
OSPF (Open Shortest Path First) Open : specification publicly available RFC 1247, RFC 2328 Working group formed in 1988 Goals: Large, heterogeneous internetworks Uses the Link State algorithm Topology
More informationConfigure IOS XR Traffic Controller (XTC)
IOS XR Traffic Controller (XTC) provides stateful path computation element (PCE) functionality by exting the existing IOS-XR PCE functionality with additional capabilities. The current IOS-XR PCE function
More informationMulti Topology Routing Truman Boyes
Multi Topology Routing Truman Boyes truman@juniper.net Copyright 2008 Juniper Networks, Inc. 1 Traffic Engineering Choices Today: IGP Metric Costing RSVP TE end to end Policy based routing EROs, Offline
More informationCOURSE OUTLINE: Course: CCNP Route Duration: 40 Hours
COURSE OUTLINE: Course: CCNP Route 300-101 Duration: 40 Hours CCNP Route Training Day 1: Connecting Remote Locations Principles of Static Routing Configuring an IPv4 Static Route Configuring a Static Default
More informationConfiguring CRS-1 Series Virtual Interfaces
Configuring CRS-1 Series Virtual Interfaces A virtual interface is defined as representing a logical packet switching entity within the Cisco CRS-1 Series router. Virtual Interfaces have a global scope
More informationDD2490 p Link state routing and OSPF. Olof Hagsand KTH/CSC
DD490 p4 00 Link state routing and OSPF Olof Hagsand KTH/CSC Literature RFC 3: Section except.. Section 3 (areas), but only last two paragraphs of 3.5 Link state routing Each router spreads information
More informationMULTILAYER REQUIREMENTS FOR NBI OF IP/MPLS DOMAIN CONTROLLERS
MULTILAYER REQUIREMENTS FOR NBI OF IP/MPLS DOMAIN CONTROLLERS White Paper Contents Scope... 2 NBI Requirements for IP/MPLS Domain Controller... 2 Topology and Traffic Discovery Requirements... 2 Monitoring
More informationOSPF Protocol Overview on page 187. OSPF Standards on page 188. OSPF Area Terminology on page 188. OSPF Routing Algorithm on page 190
Chapter 17 OSPF Protocol Overview The Open Shortest Path First (OSPF) protocol is an interior gateway protocol (IGP) that routes packets within a single autonomous system (AS). OSPF uses link-state information
More informationRouter Lab Reference
KTHNOC Router Lab Reference Juniper version Table of Contents 1 Introduction...3 2 Reference: Workstation...3 2.1 Configuring network access...3 2.2 Connecting to your router...4 3 Reference: Basic commands...4
More information030220PIL-WS03.ppt Copyright by NTT 2003 Page 1. IP Control Plane Generalized MPLS
B.GMPLS GMPLS 2003220 Page 1 Generalized MPLS GMPLS IP/MPLS L2SW TDM Lambda Fiber IP Control Plane Generalized MPLS GMPLS) IP Network IP Network -MPLS LSR - Optical Cross-Connect (OXC) -ATM switch -TDM
More informationConfiguring LDP with CLI
Label Distribution Protocol Configuring LDP with CLI This section provides information to configure LDP using the command line interface. Topics in this section include: LDP Configuration Overview on page
More informationExamination IP routning inom enkla datornät, DD2490 IP routing in simple networks, DD2490 KTH/CSC. Date: 20 May :00 19:00 SOLUTIONS
Examination IP routning inom enkla datornät, DD2490 IP routing in simple networks, DD2490 KTH/CSC Date: 20 May 2009 14:00 19:00 SOLUTIONS a) No help material is allowed - You are not allowed to use books
More informationПрименение MPLS в сетях связи. (Часть 3)
Применение MPLS в сетях связи. (Часть 3) Дополнительные главы Компьютерных сетей и телекоммуникаций. Васин В.В. CCIE, ECE, CCSI MPLS VPN Technology Traffic Engineering Concepts What Is Traffic Engineering?
More informationProgrammatic Interface to Routing
Programmatic Interface to Routing NANOG 61 Draft version, slides will be updated before presentation Applications and Networks Routing system players: the Application and the Network. Different interdependent
More informationBack to basics J. Addressing is the key! Application (HTTP, DNS, FTP) Application (HTTP, DNS, FTP) Transport. Transport (TCP/UDP) Internet (IPv4/IPv6)
Routing Basics Back to basics J Application Presentation Application (HTTP, DNS, FTP) Data Application (HTTP, DNS, FTP) Session Transport Transport (TCP/UDP) E2E connectivity (app-to-app) Port numbers
More information