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.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

APNOMS2003Fujitsu Laboratories Ltd.1 A QoS Control Method Cooperating with a Dynamic Load Balancing Mechanism Akiko Okamura, Koji Nakamichi, Hitoshi Yamada.
The strength of routing Schemes. Main issues Eliminating the buzz: Are there real differences between forwarding schemes: OSPF vs. MPLS? Can we quantify.
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Understanding MPLS TE Components.
Jaringan Komputer Lanjut Packet Switching Network.
Designing An g Ad-hoc Network for Multimedia Communication Chung-Wei Lee & Jonathan C.L. Liu Presented By: Mahendra Kumar.
1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
OLD DOG CONSULTING Traffic Engineering or Network Engineering? The transition to dynamic management of multi-layer networks Adrian Farrel Old Dog Consulting.
Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.
Jan 13, 2006Lahore University of Management Sciences1 Protection Routing in an MPLS Network using Bandwidth Sharing with Primary Paths Zartash Afzal Uzmi.
Restoration Routing in MPLS Networks Zartash Afzal Uzmi Computer Science and Engineering Lahore University of Management Sciences.
Path Protection in MPLS Networks Ashish Gupta Design and Evaluation of Fault Tolerance Algorithms with Performance Constraints.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
ASWP – Ad-hoc Routing with Interference Consideration Zhanfeng Jia, Rajarshi Gupta, Jean Walrand, Pravin Varaiya Department of EECS University of California,
1 Node Selection For a Fault- Tolerant Streaming Service On A Peer-to-Peer Network Hyunjoo Kim, Sooyong Kang and Yeom H.Y.
MPLS Local Restoration using Optimized Aggregate Information Zartash Afzal Uzmi Computer Science and Engineering Lahore University of Management Sciences.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Path Protection in MPLS Networks Using Segment Based Approach.
Dynamic routing – QoS routing Load sensitive routing QoS routing.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Scalable Construction of Resilient Overlays using Topology Information Mukund Seshadri Dr. Randy Katz.
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
MATE: MPLS Adaptive Traffic Engineering Anwar Elwalid, et. al. IEEE INFOCOM 2001.
Implement a QoS Algorithm for Real-Time Applications in the DiffServ-aware MPLS Network Zuo-Po Huang, *Ji-Feng Chiu, Wen-Shyang Hwang and *Ce-Kuen Shieh.
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
Package Transportation Scheduling Albert Lee Robert Z. Lee.
The Research of Applying Random Early Blocking strategy to Dynamic Lightpath Routing National Yunlin University of Science & Technology.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Topology Design for Service Overlay Networks with Bandwidth Guarantees Sibelius Vieira* Jorg Liebeherr** *Department of Computer Science Catholic University.
Helsinki 19 May 2006 Fine Protection of Data-Paths in Multi-Layer Networks Based on the GMPLS paradigm G.Oriolo, Università Tor Vergata, Roma joint work.
A Fair and Dynamic Load Balancing Mechanism F. Larroca and J.L. Rougier International Workshop on Traffic Management and Traffic Engineering for the Future.
Network Aware Resource Allocation in Distributed Clouds.
MPLS and Traffic Engineering Ji-Hoon Yun Computer Communications and Switching Systems Lab.
Topology aggregation and Multi-constraint QoS routing Presented by Almas Ansari.
A novel approach of gateway selection and placement in cellular Wi-Fi system Presented By Rajesh Prasad.
Workshop PRIXNET Distributed Virtual Circuit Switching protocol with auction pricing Loubna ECHABBI Dominique BARTH Laboratoire PRISM.
Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.
Group 3 Sandeep Chinni Arif Khan Venkat Rajiv. Delay Tolerant Networks Path from source to destination is not present at any single point in time. Combining.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Optimization of Wavelength Assignment for QoS Multicast in WDM Networks Xiao-Hua Jia, Ding-Zhu Du, Xiao-Dong Hu, Man-Kei Lee, and Jun Gu, IEEE TRANSACTIONS.
Data Communications and Networking Chapter 11 Routing in Switched Networks References: Book Chapters 12.1, 12.3 Data and Computer Communications, 8th edition.
PIT and Cache Dynamics in CCN. Objects & Conclusion Cache-PIT dynamics in CCN Cache and PIT aggregation effect save bandwidth consumption As network load.
Federico Chiariotti Chiara Pielli Andrea Zanella Michele Zorzi QoE-aware Video Rate Adaptation algorithms in multi-user IEEE wireless networks 1.
10/6/2003Kevin Su Traffic Grooming for Survivable WDM Networks – Shared Protection Kevin Su University of Texas at San Antonio.
Traffic grooming in WDM Networks Dynamic Traffic Grooming in WDM Mesh Networks Using a Novel Graph Model by Hongyue Zhu, Hui Zang, Keyao Zhu, and Biswanath.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Scaling Properties of the Internet Graph Aditya Akella, CMU With Shuchi Chawla, Arvind Kannan and Srinivasan Seshan PODC 2003.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
1 Dynamic RWA Connection requests arrive sequentially. Setup a lightpath when a connection request arrives and teardown the lightpath when a connection.
Author Utility-Based Scheduling for Bulk Data Transfers between Distributed Computing Facilities Xin Wang, Wei Tang, Raj Kettimuthu,
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
QoS-specified Traffic Grooming Algorithm in WDM Mesh Networks Bing Xiang, Hongfang Yu, Sheng Wang, Lemin Li Communications, Circuits and Systems, 2004.
Partially Overlapped Channels Not Considered Harmful Arunesh Mishra, Vivek Shrivastava, Suman Banerjee, William Arbaugh (ACM SIGMetrics 2006) Slides adapted.
66th IETF, Montreal, July 2006 PCE Working Group Meeting IETF-66, July 2006, Montreal A Backward Recursive PCE-based Computation (BRPC) procedure to compute.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Dynamic Resource Allocation for Classes of Prioritized Session and Data Requests in Preemptive Heterogeneous Networks Presented by Xiangfei Zhu
Performance Analysis of Inter-Domain Path Computation Methodologies draft-dasgupta-ccamp-path-comp-analysis-00.txt Sukrit Dasgupta, Jaudelice C. de Oliveira.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—5-1 Customer-to-Provider Connectivity with BGP Connecting a Multihomed Customer to Multiple Service.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
William Stallings Data and Computer Communications
Confluent vs. Splittable Flows
New Directions in Routing
Ant-link Agents for Load Balancing in Telecommunications Networks
Data and Computer Communications
Offset-Time-Based QoS Scheme
QoS routing Finding a path that can satisfy the QoS requirement of a connection. Achieving high resource utilization.
Presentation transcript:

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 added Minimize blocking probability –Simulation results based on periodic link fault events Jaudelice C. de Oliveira Drexel University JP Vasseur Cisco Systems, Inc

IETF’58draft-deoliveira-diff-te-preemption-02.txt2 Preemption Criteria Preempt the LSPs that have the least priority (preemption priority). –The QoS of high priority traffics would be better satisfied and the cascading effect would be limited. Preempt the least number of LSPs. –The number of LSPs that need to be rerouted would be lower. Preempt the least amount of bandwidth that still satisfies the request. –Resource utilization is improved. Preempt LSPs that minimize the blocking probability –Minimize risk that preempted TE LSP cannot be rerouted.

IETF’58draft-deoliveira-diff-te-preemption-02.txt3 Preemption Cascading Preemption Cascading effect : –The decision of preempting an LSP may cause other preemptions in the network. –Different cascading levels may be achieved by the preemption of a single LSP. Cascading levels: –When an LSP is preempted and rerouted without causing any further preemption, the cascading is said to be of level 0. –When a preempted LSP is rerouted and in order to be setup in the new route it also causes the preemption of other LSPs, the cascading is said to be of level 1, and so on. Preemption cascading is not desirable and therefore policies that minimize it are of interest. Typically, this can result in severe network instabilities.

IETF’58draft-deoliveira-diff-te-preemption-02.txt4 Preemption Policies Preemption Policies with preemption criteria considered in a given order of importance: –P: Sorts candidate LSPs by priority only. –PN: Sorts the LSPs by priority, and for cases in which the priority is the same, orders those by decreasing bandwidth selects larger LSPs for preemption in order to minimize number of preempted LSPs –PB: Sorts the LSPs by priority, and for LSPs with the same priority, sort those by crescent bandwidth selects smaller lower priority LSPs in order to reduce bandwidth wastage

IETF’58draft-deoliveira-diff-te-preemption-02.txt5 Preemption Policies Preemption Policies with preemption criteria considered (Heuristic) in a customized weighted balance: –HPB: The heuristic with priority and bandwidth wastage as the most important criteria. –HBlock: The heuristic considering the minimization of blocking probability and priority. –HNB: The heuristic with number of LSPs preempted and wasted bandwidth in consideration.

IETF’58draft-deoliveira-diff-te-preemption-02.txt6 Simulations Random topology (150 nodes): –Average connectivity: 3 –10% of the nodes have connectivity 6 –10% of the links are OC3, 70% are OC48, and 20% are OC192 –T: total number of TE LSPs in the network (T = 18,306 LSPs) Two classes of TE LSPs: Voice/AToM:Data(Internet/VPN): Number20% of T 80% of T 4%8% 20%40% Priority0, 1, and Size as uniform distribution between: 30M and 50M20M and 50M15M and 40M10M and 20M1M and 20M1K and 1M Priority and size distributions for Voice/AToM and Internet/VPN LSPs.

IETF’58draft-deoliveira-diff-te-preemption-02.txt7 Simulation results Simulation results for constant network failure: 1 random failure every hour. HeuristicOther algorithms HPBHBlockHNBPPNPB Need to be Rerouted532 Preempted Rerouted Rejected Maximum Cascading Wasted Bandwidth Average (Mbps) Worst Case (Mbps) Preempted Priority Average Worst Case Extra Hops in new Route Average Worst Case

IETF’58draft-deoliveira-diff-te-preemption-02.txt8 Conclusions Cascading is not an issue when priority is taken into account by preemption policy Heuristic configured to minimize blocking probability (HBlock) –Small LSPs with low priority were selected for preemption on normally loaded links Several LSPs were selected for preemption, but the rate of LSPs that were not successfully rerouted was the lowest. Since the LSPs are “small,” it is easier to find a new route in the network –Fewer (larger) LSPs with low priority were selected on congested links fewer larger LSPs are selected improving load balance –The resource wastage was the overall lowest The heuristic is very flexible and can be configured according to the network provider’s best interest regarding the considered criteria