Performance Analysis of Inter-Domain Path Computation Methodologies draft-dasgupta-ccamp-path-comp-analysis-00.txt Sukrit Dasgupta, Jaudelice C. de Oliveira.

Slides:

Advertisements

Similar presentations

Interconnection Networks: Flow Control and Microarchitecture.

Advertisements

pathChirp Efficient Available Bandwidth Estimation

Page 1 iPOP2009, Tokyo, Japan Selecting Domain Paths in Inter-Domain MPLS-TE and GMPLS Adrian Farrel, Old Dog Consulting Daniel King, Old Dog Consulting.

Micro-loop Prevention Methods draft-bryant-shand-lf-conv-frmwk-00.txt draft-zinin-microloop-analysis-00.txt.

Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.

CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.

Composite Link Framework Issues. Functional requirement #1 The solution SHALL provide a means to summarize routing advertisements regarding the characteristics.

1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.

SplitStream: High- Bandwidth Multicast in Cooperative Environments Monica Tudora.

Bilal Gonen University of Alaska Anchorage Murat Yuksel University of Nevada, Reno.

End-to-End Available Bandwidth: Measurement Methodology, Dynamics, and Relation with TCP Throughput Manish Jain Constantinos Dovrolis SIGCOMM 2002 Presented.

A Study of Multiple IP Link Failure Fang Yu

SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,

Inter-Domain Path Computation in MPLS Authors: Faisal Aslam, Zartash Afzal Uzmi, Adrian Farrel, and Michal Pioro Zartash Afzal Uzmi Department of Computer.

© Manasa Quantifying Metrics for Resilient and Survivable Networks EECS 801 Graduate Reading © 2008–Manasa K 6 June 2008 Manasa K Department of Electrical.

End-to-End Analysis of Distributed Video-on-Demand Systems Padmavathi Mundur, Robert Simon, and Arun K. Sood IEEE Transactions on Multimedia, February.

Restoration Routing in MPLS Networks Zartash Afzal Uzmi Computer Science and Engineering Lahore University of Management Sciences.

Yashar Ganjali, and Abtin Keshavarzian Presented by: Isaac Keslassy Computer Systems Laboratory Department of Electrical Engineering Stanford University.

© Manasa Resilience of Flooding Protocol – A Case Study EECS 801 Graduate Reading © 2008–Manasa K Aug Manasa K Department of Electrical Engineering.

MPLS Local Restoration using Optimized Aggregate Information Zartash Afzal Uzmi Computer Science and Engineering Lahore University of Management Sciences.

Selection Metrics for Multi-hop Cooperative Relaying Jonghyun Kim and Stephan Bohacek Electrical and Computer Engineering University of Delaware.

SAVE: Source Address Validity Enforcement Protocol Jun Li, Jelena Mirković, Mengqiu Wang, Peter Reiher and Lixia Zhang UCLA Computer Science Dept 10/04/2001.

End-to-End Analysis of Distributed Video-on-Demand Systems P. Mundur, R. Simon, and A. K. Sood IEEE Transactions on Multimedia, Vol. 6, No. 1, Feb 2004.

Yashar Ganjali Joint work with: Abtin Keshavarzian June 4, 2003 Single-Path vs. Multi-Path Routing in Ad Hoc Networks.

Comparison of MSTP and (G)ELS Benchmarking Carrier Ethernet Technologies Workshop Session AI.1: Scientific and Technical Results Krakow, Poland April 30,

Identifying High Throughput Paths in Mesh Networks : A Model-based Approach Theodoros Salonidis (Thomson) Michele Garetto (University of Torino)

Low Latency Wireless Video Over Networks Using Path Diversity John Apostolopolous Wai-tian Tan Mitchell Trott Hewlett-Packard Laboratories Allen.

1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:

SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,

EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,

IETF 69, PCE WG, Chicago Encoding of Objective Functions in PCE Communication and Discovery Protocols draft-leroux-pce-of-01.txt J.L. Le Roux (France Telecom)

Lecture 15. IGP and MPLS D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.

IETF 68, MPLS WG, Prague P2MP MPLS-TE Fast Reroute with P2MP Bypass Tunnels draft-leroux-mpls-p2mp-te-bypass-01.txt J.L. Le Roux (France Telecom) R. Aggarwal.

Aadil Zia Khan and Shahab Baqai LUMS School of Science and Engineering QoS Aware Path Selection in Content Centric Networks Fahad R. Dogar Carnegie Mellon.

Performance Evaluation of ATM Shortcuts in Overlaid IP/ATM Networks Jim Kurose Don Towsley Department of Computer Science Univ. of Massachusetts, Amherst.

Page th IETF – Philadelphia, March 2008 Signaling Extensions for Wavelength Switched Optical Networks Greg

Network Survivability Against Region Failure Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on Ran Li, Xiaoliang.

Load Balancing in Protection Switching of Optical Networks Hongkyu Jeong, Gyu-Myoung Lee Information and Communications Univ. (ICU) Student ID : ,

Comparison of Public End-to-End Bandwidth Estimation tools on High-Speed Links Alok Shriram, Margaret Murray, Young Hyun, Nevil Brownlee, Andre Broido,

CS 8501 Networks-on-Chip (NoCs) Lukasz Szafaryn 15 FEB 10.

PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.

S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.

1 IETF- 56 – TE WG- SAN FRANCISCO Inter-AS MPLS Traffic Engineering draft-vasseur-inter-AS-TE-00.txt Jean-Philippe Vasseur – Cisco Systems Raymond Zhang.

Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.

69th IETF Chicago July 2007 An analysis of scaling issues in MPLS-TE backbone networks Seisho Yasukawa, Adrian Farrel, and Olufemi Komolafe draft-yasukawa-mpls-scaling-analysis-04.txt.

Slide #1 Performance Evaluation of Routing Protocol for Low Power and Lossy Networks (RPL) draft-tripathi-roll-rpl-simulation-04 IETF Virtual Interim WG.

IETF-70th Vancouver1 Extensions to GMPLS RSVP-TE for Bidirectional Lightpath with the Same Wavelength draft-xu-rsvpte-bidir-wave-01 Sugang Xu, Hiroaki.

IETF-74, San Francisco, March 2009 PCE Working Group Meeting IETF-74, March 2009, San Francisco Online Agenda and Slides at:

1 A Multi-Rate Routing Protocol with Connection Entropy for MANETs Cao Trong Hieu, Young Cheol Bang, Jin Ho Kim, Young An Kim, and Choong Seon Hong Presenter:

Inter-area MPLS TE Architecture and Protocol Extensions

69th IETF, Chicago, July 2007 PCE Working Group Meeting IETF-69, July 2007, Chicago Online Agenda and Slides at: bin/wg/wg_proceedings.cgi.

66th IETF, Montreal, July 2006 PCE Working Group Meeting IETF-66, July 2006, Montreal A Backward Recursive PCE-based Computation (BRPC) procedure to compute.

Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar,

Forward-Search P2P TE LSP Inter- Domain Path Computation draft-chen-pce-forward-search-p2p-path-computation Huaimo Chen

Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.

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-deoliveira-diff-te-preemption-02.txt J. C. de Oliveira, JP Vasseur, L. Chen, C. Scoglio Updates: –Co-author: JP Vasseur –New preemption criterion.

1 On the Interaction between Dynamic Routing in the Native and Overlay Layers Infocom2006 Srinivasan Seetharaman and Mostafa Ammar College of Computing.

67th IETF - San Diego, CA, USA November 8, 2006 PCECP Requirements for support of Global Concurrent Optimization Y. Lee, Huawei, D. King, Aria Networks,

Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting

Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting

Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting

An analysis of scaling issues in MPLS-TE backbone networks

Distributed Control Plane

draft-lazzeri-pce-residual-bw-00

School of Electrical Engineering and Computer Science

pathChirp Efficient Available Bandwidth Estimation

pathChirp Efficient Available Bandwidth Estimation

Towards Predictable Datacenter Networks

Presentation transcript:

Performance Analysis of Inter-Domain Path Computation Methodologies draft-dasgupta-ccamp-path-comp-analysis-00.txt Sukrit Dasgupta, Jaudelice C. de Oliveira Dept. of Electrical and Computer Engineering Drexel University JP Vasseur Cisco Systems

69th IETF: draft-dasgupta-ccamp-path-comp-analysis-00.txt 2 Motivation Identify performance metrics for comparison –Path cost –Signaling Failure –Crankback Signaling (RFC4920) –Failed TE-LSP/Bandwidth on link failure –TE-LSP/Bandwidth setup capacity Quantify these metrics on realistic topologies and traffic loads using simulations Useful data to share with the community Not to draw any conclusion per say

69th IETF: draft-dasgupta-ccamp-path-comp-analysis-00.txt 3 Topologies and TE-LSP Sizes MESHSYM

69th IETF: draft-dasgupta-ccamp-path-comp-analysis-00.txt 4 Scenarios Analyzed TE-LSP setup –Per-domain method (PD-Setup) –(PCE) BRPC method (PCE-Setup) Link Failures in the network –Per-domain method (PD-Failure) –(PCE) BRPC method (PCE-Failure) Results presented here are for MESH Results for SYM in the draft and are similar

69th IETF: draft-dasgupta-ccamp-path-comp-analysis-00.txt 5 Path Cost 1. Max path cost for a TE-LSP in the simulation 2. Average of all path costs for a TE-LSP in the simulation 1. Max path cost distribution2. Average path cost distribution PCE-Failure PD-Failure PD-Setup PCE-Setup Percentage of TE-LSPs Max path cost Avg path cost PD-Failure PCE-Failure

69th IETF: draft-dasgupta-ccamp-path-comp-analysis-00.txt 6 Signaling Failure Number of signaling failures experienced while setting up/rerouting a TE-LSP over the duration of the simulation PD-Failure PD-Setup PCE-Failure Percentage of TE-LSPs Signaling Failures

69th IETF: draft-dasgupta-ccamp-path-comp-analysis-00.txt 7 Crankback Signaling 1. Total number of crankbacks while setting up/rerouting a TE-LSP over the duration of the simulation 2. Sum of link costs the crankback signal traverses = proportional delay during setup 1. Number of crankbacks distribution2. Delay from crankback distribution PD-Failure Percentage of TE-LSPs Number of crankbacks Delay from crankback

69th IETF: draft-dasgupta-ccamp-path-comp-analysis-00.txt 8 Failed TE-LSP/Bandwidth on link failure TE-LSPs where no route is found after a link on its route fails MESH SYM Number of TE-LSPs Bandwidth in Mbps

69th IETF: draft-dasgupta-ccamp-path-comp-analysis-00.txt 9 Conclusion Several significant metrics for performance analysis are identified Metrics quantified under realistic scenarios Important insight into the two path computation methodologies Useful data for the community