Path Computation Element Metric Protocol (PCEMP) (draft-choi-pce-metric-protocol-02.txt) Jun Kyun Choi and Dipnarayan Guha

Slides:



Advertisements
Similar presentations
APNOMS03 1 A Resilient Path Management for BGP/MPLS VPN Jong T. Park School of Electrical Eng. And Computer Science Kyungpook National University
Advertisements

RSVP-TE Extensions for SRLG Configuration of FA
Protocol Extension Requirement for Cooperation between PCE and Distributed Routing Controller in GMPLS Networks draft-zhaoyl-pce-dre-01.txt Yongli Zhao,
Deployment of MPLS VPN in Large ISP Networks
1 Introduction to Mobile IPv6 IIS5711: Mobile Computing Mobile Computing and Broadband Networking Laboratory CIS, NCTU.
MIP Extensions: FMIP & HMIP
Transitioning to IPv6 April 15,2005 Presented By: Richard Moore PBS Enterprise Technology.
Distributed mobility management in the context of the MEDIEVAL project MEVICO Final Seminar, part 2 23 rd November 2012 Carlos J. Bernardos, UC3M
Dynamic Tunnel Management Protocol for IPv4 Traversal of IPv6 Mobile Network Jaehoon Jeong Protocol Engineering Center, ETRI
Problem Statement and Architecture for Information Exchange Between Interconnected Traffic Engineered Networks draft-farrel-interconnected-te-info-exchange-03.txt.
ITU-T Workshop “NGN and its Transport Networks“ Kobe, April 2006 International Telecommunication Union ITU-T Introduction to the Path Computation.
IPv4 and IPv6 Mobility Support Using MPLS and MP-BGP draft-berzin-malis-mpls-mobility-00 Oleg Berzin, Andy Malis {oleg.berzin,
Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol –Datagram format.
1IMIC, 8/30/99 Constraint-Based Unicast and Multicast: Practical Issues Bala Rajagopalan NEC C&C Research Labs Princeton, NJ
1IETF-59 MANET WG Ad Hoc IP Address Autoconfiguration Jaehoon Jeong ETRI 3 rd February 2004 draft-jeong-adhoc-ip-addr-autoconf-01.txt.
Routing.
Draft-li-l2vpn-ccvpn-arch-00IETF 88 L2VPN1 An Architecture of Central Controlled Layer 2 Virtual Private Network (L2VPN) draft-li-l2vpn-ccvpn-arch-00 Zhenbin.
Draft-li-rtgwg-cc-igp-arch-00IETF 88 RTGWG1 An Architecture of Central Controlled Interior Gateway Protocol (IGP) draft-li-rtgwg-cc-igp-arch-00 Zhenbin.
Copyright © 2012, QoS-aware Network Operating System for Software Defined Networking with Generalized OpenFlows Kwangtae Jeong, Jinwook Kim.
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
Network-based IP VPNs using Virtual Routers Tim Hubbard.
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 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 4 Advanced Internetworking Computer Networks, 5th Edition.
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.
TCP/IP Protocol Suite 1 Chapter 14 Upon completion you will be able to: Unicast Routing Protocols: RIP, OSPF, and BGP Distinguish between intra and interdomain.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,
Autonomicity in Virtual Private Network provisioning for enterprises GLOBECOM Workshops (GC Wkshps), 2010 IEEE.
1 Multi Protocol Label Switching Presented by: Petros Ioannou Dept. of Electrical and Computer Engineering, UCY.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
March 12, 2008© Copyright 2008 John Buford SAM Overlay Protocol draft-buford-irtf-sam-overlay-protocol-01.txt John Buford, Avaya Labs Research IETF 71.
1 Module 4: Implementing OSPF. 2 Lessons OSPF OSPF Areas and Hierarchical Routing OSPF Operation OSPF Routing Tables Designing an OSPF Network.
#1 EETS 8316/NTU CC725-N/TC/ Routing - Circuit Switching  Telephone switching was hierarchical with only one route possible —Added redundant routes.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
6TSCH Webex 05/24/2013. Agenda BoF recap[5min] Webinar announcement[5min] Centralized routing requirements draft [10min + 5min Q&A] updated TSCH draft[5min]
A policy-based per-flow mobility management system design
PCE Traffic Engineering Database Requirements draft-dugeon-pce-ted-reqs-01.txt O. Dugeon, J. Meuric (France Telecom / Orange) R. Douville (Alcatel-Lucent)
IETF 66 L1VPN Basic Mode Draft draft-ietf-l1vpn-basic-mode-00.txt Don Fedyk (Editor) Yakov Rekhter (Editor)
Routing protocols. Static Routing Routes to destinations are set up manually Route may be up or down but static routes will remain in the routing tables.
Internet Protocols. ICMP ICMP – Internet Control Message Protocol Each ICMP message is encapsulated in an IP packet – Treated like any other datagram,
Dynamic Routing Protocols II OSPF
4: Network Layer4b-1 OSPF (Open Shortest Path First) r “open”: publicly available r Uses Link State algorithm m LS packet dissemination m Topology map.
PCE 64 th IETF PCE Policy Architecture draft-berger-pce-policy-architecture-00.txt Lou Berger Igor Bryskin Dimitri Papadimitriou.
66th IETF, Montreal, July 2006 PCE Working Group Meeting IETF-66, July 2006, Montreal A Backward Recursive PCE-based Computation (BRPC) procedure to compute.
Extensions to PCEP for Hierarchical Path Computation Elements PCE draft-zhang-pcep-hierarchy-extensions-00 Fatai Zhang Quintin Zhao.
The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS & GMPLS draft-ietf-pce-hierarchy-fwk-00.txt.
The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS & GMPLS draft-king-pce-hierarchy-fwk-01.txt.
Draft-li-idr-cc-bgp-arch-00IETF 88 IDR1 An Architecture of Central Controlled Border Gateway Protocol (BGP) draft-li-idr-cc-bgp-arch-00 Zhenbin Li, Mach.
82 nd Taipei Protection Mechanisms for LDP P2MP/MP2MP LSP draft-zhao-mpls-mldp-protections-00.txt Quintin Zhao, Emily Chen, Huawei.
XRBLOCK IETF 85 Atlanta Network Virtualization Architecture Design and Control Plane Requirements draft-fw-nvo3-server2vcenter-01 draft-wu-nvo3-nve2nve.
Requirements for the Resilience of Control Plane in GMPLS (draft-kim-ccamp-cpr-reqts-00.txt) Young Hwa Kim CCAMP WG (59 th IETF) Apr.04,
Dynamic Routing Protocols II OSPF
Applicability Statement for Layer 1 Virtual Private Networks (L1VPNs) Basic Mode draft-takeda-l1vpn-applicability-basic-mode-00.txt Deborah Brungard (AT&T)
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
Greg Bernstein Young Lee
PCE Applicability for Inter-Layer MPLS and GMPLS Traffic Engineering draft-oki-pce-inter-layer-app-00.txt Mar. 20, 2006 Eiji Oki (NTT) Jean-Louis Le.
Routing BY, P.B.SHANMATHI.
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
ICMP ICMP – Internet Control Message Protocol
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
L1VPN Working Group Scope
Routing.
TE Topology and Tunnel Modeling for Transport Networks draft-bryskin-teas-te-topo-and-tunnel-modeling Igor Bryskin (Huawei Technologies) Xufeng Liu (Jabil)
Dynamic Routing Protocols II OSPF
Label Switched VPNs – Scalability and Performance Analysis
Computer Networks Protocols
Routing.
Computer Networks Protocols
Presentation transcript:

Path Computation Element Metric Protocol (PCEMP) (draft-choi-pce-metric-protocol-02.txt) Jun Kyun Choi and Dipnarayan Guha PCE WG (63 rd. IETF) August 2, 2005 Paris, France

63 rd. IETF(PCE WG) (2/8) ▣ What is the PCEMP? ◈ It’s a protocol for a generic computational model that is used as an application path computation framework for any PCE “peer” in inter-domain scenarios. ◈ Drives the PCE “peer network” by soft-configuration on supporting network peers. ▣ How does it work? ◈ Maintains a “state” of adjacency by data-driven mapping of external routing information on node routing tables ◈ Soft-configuration, in this context, is defined as a mechanism that splits the network tree into a combination of sparse sub-trees for fast computation. ◈ The network architecture is optimally partitioned into a set of PCEDAs (PCE Domain Areas), which can be one or more Autonomous Systems, inter- domains etc. Some FAQs about PCEMP

63 rd. IETF(PCE WG) (3/8) ▣ Support for peer adjacency through non-participating interior nodes ◈ Protocol is generic, PCEMP maintains adjacencies over inter-domains and multi-layer networks by considering them as opaque ◈ Data-driven mechanism for protocol FSM execution is flow based  no additional configuration updates necessary to PCEs attached to networks ▣ Partitioning the virtual network into PCE Domain Areas (PCEDAs) ◈ In-line with the protocol architecture that provides branch-wise granularity in data protection within an autonomous system ◈ In the peer service model, the provider partitions the TE links within the provider network per client solicitation, and discloses per client TE link info to corresponding clients  Partitioning into PCEDAs with PCEMP is a direct driver to this Main features of PCEMP

63 rd. IETF(PCE WG) (4/8) ▣ Common Header ◈ Mode of using PCEMP – path computation and/or path computation/communication ▣ Establish ◈ Request Path Computation (Sync/Async modes), prioritization of path computation ▣ Respond ◈ Returns path / nature of path computation ▣ Error ◈ Returns path computation failure reason, currently supports a negotiate object for responder ▣ Teardown ◈ Explicit path computation delete request / change in path computation style ▣ ACK ◈ Test alive process PCEMP message formats

63 rd. IETF(PCE WG) (5/8) BcN REN (old KOREN) 허브 Client Edge CE node1 PE router: PCEMP peer ICU Gateway ICU Client Network High Speed Internet Backbone PCEMP Tunnel ETRI Gateway ICU PCEMP Test-Bed ETRI Network ETRI Client Network P router: PCEMP peer Client Edge CE node2 PE router: PCEMP peer PCEMP peer auto configuration PCEMP peer auto configuration / /32 Test setup for PCEMP deployment (work-in-progress)

63 rd. IETF(PCE WG) (6/8) PCE WG protocol standardization pointers ▣ PCEMP is a generic routing and path computation protocol targeted towards inter-domain PCE peers that runs on any PCE unit that is capable of computing a path based on an ordered graph ▣ This draft proposes to elucidate protocol independent metrics defining path quality measurement criteria, algorithm complexity and scalability criteria related to path computation techniques through the PCEMP and is in line with the PCE WG Charter ▣ This draft is an independent effort in the PCE WG and comes out with results very much in striking alignment with the protocol requirements spec

63 rd. IETF(PCE WG) (7/8) ▣ Authors’ standardization works in the PCE WG ◈ Jun Kyun Choi, Dipnarayan Guha et al., “Path Computation Element Metric Protocol (PCEMP)”, IETF internet draft, August ◈ Jun Kyun Choi, Dipnarayan Guha et al., “Framework of PCEMP based Layer 1 Virtual Private Network”, IETF internet draft, August ◈ Jun Kyun Choi, Dipnarayan Guha et al., “Fast End-to-End Restoration Mechanism with SRLG using Centralized Control, IETF internet draft, February txt ◈ Jun Kyun Choi, Dipnarayan Guha et al., “Fast IPv6 PCE peer advertisement using PCEMP”, IETF internet draft, August ▣ Public demo of PCEMP deployment software ◈ IEEE ICACT 2005, Phoenix Park, Republic of Korea, February 23, 2005 ◈ IEEE INFOCOM 2005, Miami, FL, U.S.A., March 15, 2005 ◈ Work-in-progress at the BcN Engineering Research Center, Broadband Network Laboratory, ICU, Republic of Korea Related works and PCEMP deployment

63 rd. IETF(PCE WG) (8/8) THANK YOU Thank You