Stable Load Control with Load Prediction in Multipath Packet Forwarding IlKyu Park, Youngseok Lee, and Yanghee Choi Proc. 15 th IEEE Int l conf. on Information.

Slides:

Advertisements

Similar presentations

MPLS and GMPLS Li Yin CS294 presentation.

Advertisements

QoS Strategy in DiffServ aware MPLS environment Teerapat Sanguankotchakorn, D.Eng. Telecommunications Program, School of Advanced Technologies Asian Institute.

APNOMS2003Fujitsu Laboratories Ltd.1 A QoS Control Method Cooperating with a Dynamic Load Balancing Mechanism Akiko Okamura, Koji Nakamichi, Hitoshi Yamada.

Japan Telecom Information & Communication Labs

Traffic Engineering over MPLS

Quality-of-Service Routing in IP Networks Donna Ghosh, Venkatesh Sarangan, and Raj Acharya IEEE TRANSACTIONS ON MULTIMEDIA JUNE 2001.

© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Introducing the TE Concept.

Restoration by Path Concatenation: Fast Recovery of MPLS Paths Anat Bremler-Barr Yehuda Afek Haim Kaplan Tel-Aviv University Edith Cohen Michael Merritt.

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 Class3: Network Design Modeling Yong Liu 09/19/2007.

CPSC Topics in Multimedia Networking A Mechanism for Equitable Bandwidth Allocation under QoS and Budget Constraints D. Sivakumar IBM Almaden Research.

Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.

High Performance Router Architectures for Network- based Computing By Dr. Timothy Mark Pinkston University of South California Computer Engineering Division.

October 8, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Basics Zartash Afzal Uzmi Computer Science and Engineering Department.

December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.

1IMIC, 8/30/99 Constraint-Based Unicast and Multicast: Practical Issues Bala Rajagopalan NEC C&C Research Labs Princeton, NJ

A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.

Traffic Engineering and Routing Hansen Bow. Topics Traffic Engineering with MPLS Issues Concerning Voice over IP Features of Netscope QoS Routing for.

RRAPID: Real-time Recovery based on Active Probing, Introspection, and Decentralization Takashi Suzuki Matthew Caesar.

Dennis Ippoliti 12/6/ MULTI-PATH ROUTING A packet by packet multi-path routing approach.

A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.

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.

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.

MPLS networking at PSP Co Multi-Protocol Label Switching Presented by: Hamid Sheikhghanbari 1.

Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.

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.

An Analytical Approach for the Two-Tier Resource Management Model IPS-MOME March 2004 Y. Rebahi.

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

Integrated Dynamic IP and Wavelength Routing in IP over WDM Networks Murali Kodialam and T. V. Lakshman Bell Laboratories Lucent Technologies IEEE INFOCOM.

A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.

Multi-Protocol Label Switching University of Southern Queensland.

MPLS and Traffic Engineering Ji-Hoon Yun Computer Communications and Switching Systems Lab.

Quick-Start for TCP and IP A.Jain, S. Floyd, M. Allman, and P. Sarolahti ICSI, April 2006 This and earlier presentations::

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

QoS Routing Using Traffic Forecast - A Case Study of Time-Dependent Routing Yuekang Yang Chung-Horng Lung Dept. of Systems and Computer Engineering, Carleton.

Opportunistic Traffic Scheduling Over Multiple Network Path Coskun Cetinkaya and Edward Knightly.

1 MPLS: Progress in the IETF Yakov Rekhter

MPLS Some notations: LSP: Label Switched Path

Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.

Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.

Supporting DiffServ with Per-Class Traffic Engineering in MPLS.

(Slide set by Norvald Stol/Steinar Bjørnstad

HELSINKI UNIVERSITY OF TECHNOLOGY Visa Holopainen 1/18.

MATE: MPLS Adaptive Traffic Engineering Anwar Elwalid Cheng Jin Steven Low Indra Widjaja Bell Labs Michigan altech Fujitsu 2006.

Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.

TeXCP: Protecting Providers’ Networks from Unexpected Failures & Traffic Spikes Dina Katabi MIT - CSAIL nms.csail.mit.edu/~dina.

1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.

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

Fabric: A Retrospective on Evolving SDN Presented by: Tarek Elgamal.

Jia Uddin Embedded System Lab.  MPLS  IMANET  IMANET network model  Proposed model of IMANET with MPLS  Conclusion.

MPLS Introduction How MPLS Works ?? MPLS - The Motivation MPLS Application MPLS Advantages Conclusion.

A Secure Routing Protocol with Intrusion Detection for Clustering Wireless Sensor Networks International Forum on Information Technology and Applications.

1 Flow-Aware Networking Introduction Concepts, graphics, etc. from Guide to Flow-Aware Networking: Quality-of-Service Architectures and Techniques for.

How I Learned to Stop Worrying About the Core and Love the Edge

Potential Areas of Research Activity – March 2000

ECE 544: Traffic engineering (supplement)

Computer Data Communications

A Study of Group-Tree Matching in Large Scale Group Communications

TCP Congestion Control

Lei Chen and Wendi B. Heinzelman , University of Rochester

On-Time Network On-chip

TCP Congestion Control

Queue Dynamics with Window Flow Control

Multi-hop Coflow Routing and Scheduling in Data Centers

TCP Congestion Control

Backbone Traffic Engineering

Congestion Control for Multipoint Communications in ATM Networks

QoS routing Finding a path that can satisfy the QoS requirement of a connection. Achieving high resource utilization.

Presentation transcript:

Stable Load Control with Load Prediction in Multipath Packet Forwarding IlKyu Park, Youngseok Lee, and Yanghee Choi Proc. 15 th IEEE Int l conf. on Information Networking

Introduction(1/2) Multi Protocol Label Switching(MPLS) Explicit Routing(ER) Traffic Engineering(TE) Constrained-based Routing(CBR)

Introduction(2/2) Multipath forwarding Multipath establishment Load distribution Link-state acquirement

Multipath forwarding with dynamic load control(1/2) Multipath establishment Forwarding mechanism with ER ECMP Equal Cost MultiPath MPLS Arbitrary path forwarding Fast path forwarding

Multipath forwarding with dynamic load control(2/2) Traffic Mapping Packet level v.s. flow level Hashing-based packet mapping Exchange of Link-state information Load (received and dropped packets) Residual bandwidth QOSPF

Load Control with Dynamic Network State The goal is to minimize the number of congested links and idle links. Features of the distributed approach Lower control overhead Better scalability Inaccuracy of Link-state Instability of link load

Instability of Dynamic Load Control The exchange of link-state is required for load distribution. Overhead v.s. Accuracy Global synchronization Link oscillate between underutilized state and congested state.

Stable Load Control with Prediction Load prediction is required to eliminate load oscillation. Observed increasing speed of link load is used to estimate present link load. Threshold T is deployed for deciding to increase/decrease load on links. Source traffic change can not be detected but diminish by extending link-state exchange period.

The Proposed Algorithm PL: Previous load CL: Current load EL: Estimated load

The Proposed Algorithm For each path with load higher than T, its resulting path load ratio is set to (current load ratio)*T/L. Total residual bandwidth is checked if it can accommodate the excess load. The excess load is added to the path with load lower than T by the factor of (T-CL)/(EL-CL).

Simulation Environment 6 CBR sources 4 LSPs α =0.3 T=80%

Deviation of Load between Links Prediction -> deviation- Load+ -> deviation-

Dropping Rate Prediction -> loss rate- Load+ -> comparable

Discussions Issues Management of multipath forwarding Accurate Prediction of link load Handling imprecision of state information Related Solutions Active negotiation Controlling load locally by routers own Exchanging link-state conditionally Two-level link-state aggregation