Research & development MSTP-TE Load Balancing: Some results Benchmarking Carrier Ethernet Technologies Session AI.3 Krakow, Poland - April 30, 2008 Rémi.

Slides:



Advertisements
Similar presentations
Network Resource Broker for IPTV in Cloud Computing Lei Liang, Dan He University of Surrey, UK OGF 27, G2C Workshop 15 Oct 2009 Banff,
Advertisements

1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
1 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Confidential Session Number Presentation_ID Next Generation Network Architectures Summary John.
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Label scalability of Carrier Ethernet Benchmarking Carrier Ethernet Technologies Workshop Session.
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
Optical Networks BM-UC Davis122 Part III Wide-Area (Wavelength-Routed) Optical Networks – 1.Virtual Topology Design 2.Wavelength Conversion 3.Control and.
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
1 Efficient and Robust Streaming Provisioning in VPNs Z. Morley Mao David Johnson Oliver Spatscheck Kobus van der Merwe Jia Wang.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
Routing in WSNs through analogies with electrostatics December 2005 L. Tzevelekas I. Stavrakakis.
High Performance All-Optical Networks with Small Buffers Yashar Ganjali High Performance Networking Group Stanford University
Multiple constraints QoS Routing Given: - a (real time) connection request with specified QoS requirements (e.g., Bdw, Delay, Jitter, packet loss, path.
Load Balancing for Routing Sundar Iyer Stanford University.
1IMIC, 8/30/99 Constraint-Based Unicast and Multicast: Practical Issues Bala Rajagopalan NEC C&C Research Labs Princeton, NJ
PROFITABLE CONNECTION ASSIGNMENT IN ALL OPTICAL WDM NETWORKS VISHAL ANAND LANDER (Lab. for Advanced Network Design, Evaluation and Research) In collaboration.
1 Internet Networking Spring 2002 Tutorial 6 Network Cost of Minimum Spanning Tree.
Comparison of MSTP and (G)ELS Benchmarking Carrier Ethernet Technologies Workshop Session AI.1: Scientific and Technical Results Krakow, Poland April 30,
TCOM 540/11 TCOM 540 Session 6. TCOM 540/12 Agenda Review Session 4 and 5 assignments Multicenter local access design.
Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:
Multipath Protocol for Delay-Sensitive Traffic Jennifer Rexford Princeton University Joint work with Umar Javed, Martin Suchara, and Jiayue He
Research & development Traffic Engineering over Ethernet Bridged Networks Benchmarking Carrier Ethernet Technologies Session MII.3 Krakow, Poland - April.
Announcements List Lab is still under construction Next session we will have paper discussion, assign papers,
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
MATE: MPLS Adaptive Traffic Engineering Anwar Elwalid, et. al. IEEE INFOCOM 2001.
Routing and Routing Protocols Dynamic Routing Overview.
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.
P.1Service Control Technologies for Peer-to-peer Traffic in Next Generation Networks Part2: An Approach of Passive Peer based Caching to Mitigate P2P Inter-domain.
L14. Fair networks and topology design D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
Topology aggregation and Multi-constraint QoS routing Presented by Almas Ansari.
Budapest University of Technology and Economics Department of Telecommunications and Media Informatics Optimized QoS Protection of Ethernet Trees Tibor.
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
Paper Presentation – CS 702, Fall 2007 DPNM Lab. “On the Optimal Configuration of Metro Ethernet for Triple Play” Andras Kern, Istvan Moldovan, and Tibor.
Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.
Interaction of Overlay Networks: Properties and Implications Joe W.J. Jiang Dah-Ming Chiu John C.S. Lui The Chinese University of Hong Kong.
Minimax Open Shortest Path First (OSPF) Routing Algorithms in Networks Supporting the SMDS Service Frank Yeong-Sung Lin ( 林永松 ) Information Management.
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.
Using traveling salesman problem algorithms for evolutionary tree construction Chantal Korostensky and Gaston H. Gonnet Presentation by: Ben Snider.
1 Dr. Ali Amiri TCOM 5143 Lecture 8 Capacity Assignment in Centralized Networks.
A Multicast Mechanism in WiMax Mesh Network Jianfeng Chen, Wenhua Jiao, Pin Jiang, Qian Guo Asia-Pacific Conference on Communications, (APCC '06)
Dijkstra's algorithm For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that.
Thirault France Session 4 – Block 4.4 Barcelona May A Dynamic Programming Algorithm for the Design of dispersed generation center adapted.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Interconnect Networks Basics. Generic parallel/distributed system architecture On-chip interconnects (manycore processor) Off-chip interconnects (clusters.
Paging Area Optimization Based on Interval Estimation in Wireless Personal Communication Networks By Z. Lei, C. U. Saraydar and N. B. Mandayam.
Heterogeneous Wireless Access in Large Mesh Networks Haiping Liu, Xin Liu, Chen-Nee Chuah, Prasant Mohapatra University of California, Davis IEEE MASS.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
© 2015 Cisco and/or its affiliates. All rights reserved. Public 1 Toerless Eckert, IJsbrand Wijnands,
© 2006 Open Grid Forum Network Services Interface Policy-based routing enforcement John MacAuley, ESnet 4 th February 2015.
Impact of Interference on Multi-hop Wireless Network Performance
Lecture 14 – Queuing Networks
RT2003, Montreal Niko Neufeld, CERN-EP & Univ. de Lausanne
Great Theoretical Ideas in Computer Science
CS 4700 / CS 5700 Network Fundamentals
Frank Yeong-Sung Lin (林永松) Information Management Department
Hidden Markov Models Part 2: Algorithms
Distributed Channel Assignment in Multi-Radio Mesh Networks
Totally Disjoint Multipath Routing in Multihop Wireless Networks Sonia Waharte and Raoef Boutaba Presented by: Anthony Calce.
L12. Network optimization
CS 4700 / CS 5700 Network Fundamentals
Networked Real-Time Systems: Routing and Scheduling
Requirements for ESS mesh network development
Lecture 14 – Queuing Networks
Frank Yeong-Sung Lin (林永松) Information Management Department
Resource Pooling A system exhibits complete resource pooling if it behaves as if there was a single pooled resource. I propose ‘extent of resource pooling’
Luis J. Gonzalez UCCS – CS526
2019/9/14 The Deep Learning Vision for Heterogeneous Network Traffic Control Proposal, Challenges, and Future Perspective Author: Nei Kato, Zubair Md.
Presentation transcript:

research & development MSTP-TE Load Balancing: Some results Benchmarking Carrier Ethernet Technologies Session AI.3 Krakow, Poland - April 30, 2008 Rémi Clavier - Orange Labs COBRA Project

research & development Goals & Assumptions

research & development France Telecom Group Input data Work done in collaboration with ALF Topology Define a common "Reference Topology" Define "variations" from this topology To have a more exhaustive analysis To take into account realistic FT aggregation topologies Matrix Define a common (more or less) realistic traffic matrix including http,HSI, VoIP Pear to Pear IPTv VPNs Define variation from this Matrix To try to catch P2P / P2MP influence

research & development Experiments

France Telecom Group Some definitions For each "variation", different experiments were done CL/CO CL (as Connection Less) The Control Plane is the 802.1Q one (MSTP with 1, 3 or 6 trees) The Management plane set the MSTP's parameters of the Control Plane CO (as Connection Oriented) No Control Plane, the forwarding is positioned by the management plane LB/SP (for CO only) LB (aka Load Balancing) The tool tries to optimize (maximize) the load balancing over the full network SP (aka Shortest Path) The tool tries to optimize (minimize) the sum of the hops for all flows over the full network –A route is "acceptable" only if no link is overloaded over the full Network MU/UN MU (aka Multicast) UN ( aka Unicast)

research & development France Telecom Group Variations of the topology for the experiment V0 Reference Topology, aggregation network fully meshed All links 10 G TV dispatcher directly connected to the aggregation Network V0b Reference Topology, aggregation network fully meshed All DSLAM links 1G ; All other links (except one) of the Aggregation Network at 10G TV dispatcher directly connected to the aggregation Network V1 Reference Topology, aggregation network fully meshed All links 10 G TV dispatcher outside the aggregation Network (core network) V1b Reference Topology, aggregation network fully meshed All DSLAM links 1G ; All other links (except one) of the Aggregation Network at 10G TV dispatcher outside the aggregation Network (core network) V3 Reference Topology but Aggregation network not meshed (Ring Aggregation topology) All DSLAM links 1G ; All other links (except one) of the Aggregation Network at 10G TV dispatcher outside the aggregation Network (core network)

research & development Partial results

research & development France Telecom Group Results criteria and format Three major indicators chosen jointly with ALF (1 curve, two values) PFD curve Probability Density Function –The probability that the load (in term of capacity of the link) is inside a given interval –The CDF is the integral of the PDF and not used directly to compare results The ME value The average of the PDF function –May give information about the fact that the less loaded links are preferentially chosen The SD value The root mean square of the PDF curve –shows the dispersion of the load of links around the full network

research & development France Telecom Group V0 Analyze (to be discuss) Multicast give a non negligible gain against "multi unicast" For MU, no difference between CO and CL For UN, CO seems better than CL FT Remarks (from detailed results) 3 trees are enough (no specific gain with 6 trees) Fully Meshed Aggregation network All Links 10G TV inside aggregation Network

research & development France Telecom Group V1b Analyze No "big" difference between CO and CL LB give a better REm and a well better SD than SP in a CO context PDF curve shows that CO/SP doesn't find a correct load balancing Fully Meshed Aggregation network All Links (except one) 10G for the aggregation Networks, DSLAM links 1G TV dispatcher outside aggregation Network

research & development Let us try to conclude …... keeping the door open for discussion Let us try to conclude …... keeping the door open for discussion

research & development France Telecom Group Some precautions to consider What is a good "Load Balancing" ??? What is a good "Load Balancing" ??? Regarding the needs of the operator Regarding the needs of the operator Regarding the technical context where analyzes are done Regarding the technical context where analyzes are done Regarding … everything else Regarding … everything else What does appear in the results? What does appear in the results? The intrinsic properties of the network's technologies? The intrinsic properties of the network's technologies? … or the properties of tools used (optimizers)? … or the properties of tools used (optimizers)? Take care about results that are given for one kind of topology For one traffic matrix Although many variations are proposed

research & development France Telecom Group Preliminary conclusions With MSTP, paths are constrained to follow "trees" At first sight, this constraint could decrease load balancing performances compared to ELS networks But, with a TE tool, MSTP gives the same results as CO networks in terms of load balancing For a very loaded network and/or a network with links with different capacities of links A centralized optimization gives better results (load balancing) than optimization based solely on the calculation of a Shortest Path The centralized optimization tool gives equivalent performances for CL or CO networks with LB routing ("TE") algorithm Other "well known" properties of MSTP are not impacted by load balancing optimization Low cost "Bad" convergence time Compliant to standard Natively multicast…

research & development France Telecom Group