Maximizing Restorable Throughput in MPLS Networks
|
|
- Laurence Burke
- 5 years ago
- Views:
Transcription
1 Maximizing Restorable Throughput in MPLS Networks Reuven Cohen Dept. of Computer Science, Technion Gabi Nakibly National EW Research Center 1
2 Motivation IP networks are required to service real-time applications such as phone conversation These services demand high availability and reliability, and in particular Fast restoration Guaranteed QoS even in the case of failures IP routing protocols are not able to provide these features MPLS protection mechanisms are able to provide these features by pre-establishment of backup LSPs We study the effectiveness of the various MPLS protections schemes 2
3 Outline Define the various MPLS protection schemes Define our optimization metric Define four different problem models Present algorithms for the various protections mechanisms and models Present simulations results for the various algorithms 3
4 The protection schemes we study 1. A Global Recovery scheme (GR) For each LSP we find a path between the same (S,D) pair that does not use any link of the LSP The backup path can protect against any failure along the LSP 2. A Local Recovery scheme (LR) For each link A-B we find a path that starts at A and ends between B and D Recovery is faster than GR (because it is initiated by the detecting node) However, more backup LSPs are needed for the protection of each LSP S S A B D A B D a standard MPLS scheme 4
5 The protection schemes we study (cont.) 3. A Restricted Local Recovery scheme (RLR) The backup path for link A-B is established between A and B S A B D 4. A Facility Local Recovery scheme (FLR) Same as RLR, except that the new path serves all the LSPs that use the failed link A B a standard MPLS scheme 5
6 The protection schemes we study (cont.) 5. An extended k-facility Local Recovery scheme (EkFLR) Same as FLR, except that the number of LSPs protected by each backup path is limited to k A B Hence, we can use more backup paths for the failed LSPs 6. An Unrestricted Recovery scheme (UR) The backup path for every link can use any route and can protect any number of LSPs S A B D 6
7 Our optimization criterion Most past research aims at minimizing the total bandwidth reserved for the backup LSPs (Spare Capacity Allocation). Such models consider a network with unbounded capacities, and a cost function associated with bandwidth usage. We believe that network operators struggle with a different problem: They have a network with finite link capacities and seek to maximize the traffic that can be admitted with protection. Our optimization criterion: constructing primary and backup LSPs while maximizing throughput. 7
8 Our four problem models A capacitated directed network We make the common single-failure assumption. A set of source-destination pairs with associated BW demands and profits. Splittable Each flow can be split over several primary or backup paths Each flow can be partially satisfied Unsplittable One primary LSP and one backup LSP All or nothing 8 Primary-restricted the primary LSPs are given in advance Primary + Backup We also need to establish the primary LSPs (joint optimization)
9 Our results 9 1. We show that the splittable version of the problem is in P and we offer a polynomial time algorithm for it. 2. We show that the unsplittable version of the problem is NP-complete and has no approximation algorithm with a ratio better than E ½. 3. We propose an approximation algorithm with that ratio. 4. We present efficient heuristics for the various recovery schemes. 5. We compare the various recovery schemes with respect to our throughput maximization criterion. We show that UR, GR and, LR differ only marginally in their performance. Since LR has the fastest restoration time of the three schemes, it should be the scheme of choice. We show that EkFLR with k=2 has almost the same performance as RLR and should be preferred over it. Due to its lower administrative overhead (fewer backup LSPs).
10 Complexity results - summary S-PRFP (Splitable, Primary restricted) 2. U-PRFP (Unsplitable, Primary restricted) 3. S-RFP (Splitable, joint primary/backup optimization) 4. U-RFP (Unplitable, joint primary/backup optimization)
11 primary route is already given S-PRFP The Splittable Primary-restricted Restorable Flow Problem (S-PRFP) It is in P for all recovery schemes. We showed it using the following linear program: - the fraction of flow f routed over edge e when edge e fails - the routed fraction of f Maximize the profit 11
12 S-PRFP LP common constraints The following constraints are common to all recovery schemes: 12 (C1) = flow conservation (C2) = capacity constraints (C3) = a flow is routed on its primary LSP as long as there is no failure (C4) = a flow is not routed over a failed link
13 S-PRFP The recovery-specific LP constraints for LR S A B D This rule ensures that the backup LSP will follow the primary LSP all the way from the source to A. From node A to the destination node, the backup LSP is not constrained. 13
14 S-PRFP The recovery-specific LP constraints for RLR S A B D RLR-1 is similar to LR-1, except that it also ensures that the backup LSP will follow the primary LSP from B to the destination. 14
15 S-PRFP The recovery-specific LP constraints for UR S A B D UR-1 ensures that the backup LSP will follow the primary LSP unless it fails. In case a link on the Primary LSP fails the backup LSP is unrestricted. 15
16 S-PRFP The recovery-specific LP constraints for GR S A B D 16 GR-1 ensures that the backup LSPs must be edge disjoint with the primary LSP. GR-2 and GR-3 ensures that the backup LSPs are identical for every failure.
17 S-RFP The Splittable Restorable Flow Problem (S-RFP) Joint primary and backup LSP optimization The same linear program but without the primary LSP constraint (C-3). Can only be applied to RLR scheme. 17
18 S A B D Examples for some of the constraints imposed by the LP for RLR Each link has a capacity of 10Mb/s, and each LSP needs 5Mb/s. We have 3 primary LSPs: A E, F J and K O We can backup a possible failure of C-D using C-H-I-D Then, we can backup a possible failure of M-N using M-H-I-N The LP needs to understand that there is no conflict on H-I because we protect against a single failure! A B C D E F G H I J 18 K L M N O
19 U-PRFP The Unsplittable Primary-restricted Restorable Flow Problem (U-PRFP) There are two differences between U-PRFP and S-PRFP. 1. In U-PRFP, profit can be obtained for a flow only when its entire demand is satisfied. 2. In U-PRFP, the traffic of each flow can be restored using only a single backup LSP. 19
20 U-PRFP The proof for the hardness of the Unsplittable Primary-restricted Restorable Flow Problem (U-PRFP) An approximation preserving reduction from the Unsplitable Flow Problem (UFP): The construction of G: All primary LSPs must go through (u,v) Every pair of solutions in both problems has the same value UFP does not have an approximation better than E ½ The same approximation algorithm is applicable also to U-PRFP 20
21 S-RFP The Splittable Restorable Flow Problem (S-RFP) 21 Unlike in S-PRFP, here the primary route is not given in advance Hence, the problem is at least as computationally difficult as S-PRFP We use the same linear program but without constraint (C-3). Because C-3 sticks the primary LSP to a given route This solves RLR and its related schemes (FLR and EkFLR)
22 S-RFP The Splittable Restorable Flow Problem (S-RFP) (cont.) 22 However, for GR, LR, and UR we need to use path-indexed variables, Namely, variables that indicate for each flow the routed bandwidth on every possible path in the graph. Since the number of such paths is exponential in the size of the graph, we don t have a polynomial time solution.
23 U-RFP The Unplittable Restorable Flow Problem (U-RFP) 23 U-RFP is at least as computationally harder as U-PRFP Therefore, it is not only NP-complete, but also cannot be approximated better than E ½ Like for U-PRFP, we did find an approximation with this ratio
24 U-RFP and U-PRFP A Practical Heuristics for U-RFP and U-PRFP Heuristic #1 Solve the LP without the recovery requirement. Sort the flows in non-increasing order of w f /d f (profit/bandwidth) Apply randomized rounding to select integral flows For each selected flow, verify that: 1. The flow can indeed be routed 2. A backup LSP can be found using the specific recovery scheme If both conditions are satisfied, the flow is admitted 24
25 Some simulation results We use the BRITE simulator to simulate MPLS topologies, according to the Barabasi-Albert model This model captures two important characteristics of the topology: Incremental growth Preferentail connectivity ( power-law degree distribution of the MPLS routers) We also used actual ISP topologies, taken from the RocketFuel project 25
26 The penalty of reliability in the Splittable Primaryrestricted model optimal algorithm w/ restoration optimal algorithm w/o restoration For each backup scheme we find the ratio OPT_S-PRFP/OPT_S-PFP For all schemes: it is easier to protect when load is lower As expected, UR is the best As expected, LR is better than RLR The advantage of GR over LR is interesting S S A B D GR A B D LR 26 S A B D RLR
27 When the network is smaller 27 When the network is smaller, the various schemes perform very closely, except that RLR is still inferior
28 The penalty of unsplittable backup LSPs (for primaryrestricted) We see here the penalty ratio for using unsplittable backup Recall that for splittable routing we have an optimal algorithm Two different heuristics are used for the unsplittable version We see that splittable is better by 25% for all schemes With FLR the penalty is even higher, because FLR needs to find high capacity LSPs 28
29 The penalty of unsplittable backup LSPs (for primaryrestricted) We see here the penalty ratio for using unsplittable backup As a function of the load in the network Surprisingly, the penalty decreases as the load increases. Can be explained by the fact that the primary LSPs traverse the shortest-paths. 29
30 The benefit of joint optimization (primary + backup) As expected, as the load in the network increases so does the penalty of using primary LSP set in advance. The penalty increases for network with higher average degree. 30
31 Conclusions The first comprehensive study of maximizing restorable throughput in MPLS networks We considered 4 models of the problem and 6 restoration schemes The splittable versions are in P The unsplittable versions are all NP-complete, and they cannot be approximated within E ½- LR should be the recovery scheme of choice S A B D 31
CURRENT routing schemes typically focus on discovering
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 15, NO. 2, APRIL 2007 413 Multipath Routing Algorithms for Congestion Minimization Ron Banner, Senior Member, IEEE, and Ariel Orda, Fellow, IEEE Abstract Unlike
More informationA Novel Class-based Protection Algorithm Providing Fast Service Recovery in IP/WDM Networks
A Novel Class-based Protection Algorithm Providing Fast Service Recovery in IP/WDM Networks Wojciech Molisz and Jacek Rak Gdansk University of Technology, G. Narutowicza 11/12, Pl-8-952 Gdansk, Poland
More informationToward the joint design of electronic and optical layer protection
Toward the joint design of electronic and optical layer protection Massachusetts Institute of Technology Slide 1 Slide 2 CHALLENGES: - SEAMLESS CONNECTIVITY - MULTI-MEDIA (FIBER,SATCOM,WIRELESS) - HETEROGENEOUS
More informationResource analysis of network virtualization through user and network
Resource analysis of network virtualization through user and network P.N.V.VAMSI LALA, Cloud Computing, Master of Technology, SRM University, Potheri. Mr.k.Venkatesh, Asst.Professor (Sr.G), Information
More informationMitigating Link Failures and Implementing Security Mechanism in Multipath Flows for Data Plane Resources
World Engineering & Applied Sciences Journal 7 (4): 212-219, 2016 ISSN 2079-2204 IDOSI Publications, 2016 DOI: 10.5829/idosi.weasj.2016.212.219 Mitigating Link Failures and Implementing Security Mechanism
More informationOutline. EL736 Communications Networks II: Design and Algorithms. Class3: Network Design Modelling Yong Liu 09/19/2006
EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modelling Yong Liu 09/19/2006 1 Outline Examples Basic Problems Routing Restriction 2 1 Example: Intra-Domain Traffic Engineering
More informationNetwork Adaptability under Resource Crunch. Rafael Braz Rebouças Lourenço Networks Lab - UC Davis Friday Lab Meeting - April 7th, 2017
Network Adaptability under Resource Crunch Rafael Braz Rebouças Lourenço Networks Lab - UC Davis Friday Lab Meeting - April 7th, 2017 Outline What is Resource Crunch Problem Statement Example 1 Connection
More informationApplication Provisioning in Fog Computingenabled Internet-of-Things: A Network Perspective
Application Provisioning in Fog Computingenabled Internet-of-Things: A Network Perspective Ruozhou Yu, Guoliang Xue, and Xiang Zhang Arizona State University Outlines Background and Motivation System Modeling
More informationApproximation Techniques for Utilitarian Mechanism Design
Approximation Techniques for Utilitarian Mechanism Design Department of Computer Science RWTH Aachen Germany joint work with Patrick Briest and Piotr Krysta 05/16/2006 1 Introduction to Utilitarian Mechanism
More informationA Novel Genetic Approach to Provide Differentiated Levels of Service Resilience in IP-MPLS/WDM Networks
A Novel Genetic Approach to Provide Differentiated Levels of Service Resilience in IP-MPLS/WDM Networks Wojciech Molisz, DSc, PhD Jacek Rak, PhD Gdansk University of Technology Department of Computer Communications
More informationAnalysis and Algorithms for Partial Protection in Mesh Networks
Analysis and Algorithms for Partial Protection in Mesh Networks Greg uperman MIT LIDS Cambridge, MA 02139 gregk@mit.edu Eytan Modiano MIT LIDS Cambridge, MA 02139 modiano@mit.edu Aradhana Narula-Tam MIT
More informationMathematical Tools for Engineering and Management
Mathematical Tools for Engineering and Management Lecture 8 8 Dec 0 Overview Models, Data and Algorithms Linear Optimization Mathematical Background: Polyhedra, Simplex-Algorithm Sensitivity Analysis;
More informationLecture 13: Traffic Engineering
Lecture 13: Traffic Engineering CSE 222A: Computer Communication Networks Alex C. Snoeren Thanks: Mike Freedman, Nick Feamster Lecture 13 Overview Evolution of routing in the ARPAnet Today s TE: Adjusting
More informationCQNCR: Optimal VM Migration Planning in Cloud Data Centers
CQNCR: Optimal VM Migration Planning in Cloud Data Centers Presented By Md. Faizul Bari PhD Candidate David R. Cheriton School of Computer science University of Waterloo Joint work with Mohamed Faten Zhani,
More informationConnectivity-aware Virtual Network Embedding
Connectivity-aware Virtual Network Embedding Nashid Shahriar, Reaz Ahmed, Shihabur R. Chowdhury, Md Mashrur Alam Khan, Raouf Boutaba Jeebak Mitra, Feng Zeng Outline Survivability in Virtual Network Embedding
More information6. Node Disjoint Split Multipath Protocol for Unified. Multicasting through Announcements (NDSM-PUMA)
103 6. Node Disjoint Split Multipath Protocol for Unified Multicasting through Announcements (NDSM-PUMA) 6.1 Introduction It has been demonstrated in chapter 3 that the performance evaluation of the PUMA
More informationQuality of Service (QoS) Routing. A Quick Review of NP-Completeness
Quality of Service (QoS) Routing These slides are created by Dr. Yih Huang of George Mason University. Students registered in Dr. Huang's courses at GMU can make a single machine-readable copy and print
More informationMinimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications
2566 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 18, NO. 12, DECEMBER 2000 Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications Koushik Kar,
More informationNetwork Protection Design for MPLS Networks
Network Protection Design for MPLS Networks Gaurav Agrawal, Dijiang Huang, Deep Medhi Computer Science and Electrical Engineering Department University of Missouri-Kansas City, MO 64110, USA Computer Science
More informationStrategies for Replica Placement in Tree Networks
Strategies for Replica Placement in Tree Networks http://graal.ens-lyon.fr/~lmarchal/scheduling/ 2 avril 2009 Introduction and motivation Replica placement in tree networks Set of clients (tree leaves):
More informationDeploying MPLS & DiffServ
Deploying MPLS & DiffServ Thomas Telkamp Director, Data Architecture & Technology Global Crossing Telecommunications, Inc. telkamp@gblx.net MPLS and DiffServ technologies are getting a lot of attention
More informationRouting and Traffic Engineering in Hybrid RF/FSO Networks*
Routing and Traffic Engineering in Hybrid RF/FSO Networks* Abhishek Kashyap and Mark Shayman Department of Electrical and Computer Engineering, University of Maryland, College Park MD 20742 Email: {kashyap,
More informationMitigating Link Failures & Implementing Security Mechanism in Multipath Flows for Data Plane Resources
2876 Mitigating Link Failures & Implementing Security Mechanism in Multipath Flows for Data Plane Resources Ramya M PG Scholar, Department of Computer Science, Klasalingam Institute of Technology,Krishnan
More informationArc Perturbation Algorithms for Optical Network Design
Applied Mathematical Sciences, Vol. 1, 2007, no. 7, 301-310 Arc Perturbation Algorithms for Optical Network Design Zbigniew R. Bogdanowicz Armament Research, Development and Engineering Center Building
More informationChapter 16. Greedy Algorithms
Chapter 16. Greedy Algorithms Algorithms for optimization problems (minimization or maximization problems) typically go through a sequence of steps, with a set of choices at each step. A greedy algorithm
More informationWIRELESS MESH NETWORKs (WMNs) are comprised
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 17, NO. 1, FEBRUARY 2009 267 A Channel and Rate Assignment Algorithm and a Layer-2.5 Forwarding Paradigm for Multi-Radio Wireless Mesh Networks Stefano Avallone,
More informationOptimal Network Flow Allocation. EE 384Y Almir Mutapcic and Primoz Skraba 27/05/2004
Optimal Network Flow Allocation EE 384Y Almir Mutapcic and Primoz Skraba 27/05/2004 Problem Statement Optimal network flow allocation Find flow allocation which minimizes certain performance criterion
More informationConvex Optimization CMU-10725
Convex Optimization CMU-10725 Ellipsoid Methods Barnabás Póczos & Ryan Tibshirani Outline Linear programs Simplex algorithm Running time: Polynomial or Exponential? Cutting planes & Ellipsoid methods for
More information218 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 14, NO. 1, FEBRUARY 2006
218 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 14, NO 1, FEBRUARY 2006 Survivable Virtual Concatenation for Data Over SONET/SDH in Optical Transport Networks Canhui (Sam) Ou, Student Member, IEEE, Laxman
More informationGreedy Algorithms 1. For large values of d, brute force search is not feasible because there are 2 d
Greedy Algorithms 1 Simple Knapsack Problem Greedy Algorithms form an important class of algorithmic techniques. We illustrate the idea by applying it to a simplified version of the Knapsack Problem. Informally,
More informationThroughput Guaranteed Restorable Routing Without Traffic Prediction
Throughput Guaranteed Restorable Routing Without Traffic Prediction M. Kodialam T. V. Lakshman Sudipta Sengupta Bell Laboratories, Lucent Technologies, NJ, USA Abstract Two-phase routing, where traffic
More information254 IEEE TRANSACTIONS ON RELIABILITY, VOL. 56, NO. 2, JUNE 2007
254 IEEE TRANSACTIONS ON RELIABILITY, VOL. 56, NO. 2, JUNE 2007 A Scalable Path Protection Mechanism for Guaranteed Network Reliability Under Multiple Failures Changcheng Huang, Senior Member, IEEE, Minzhe
More informationResilient IP Backbones. Debanjan Saha Tellium, Inc.
Resilient IP Backbones Debanjan Saha Tellium, Inc. dsaha@tellium.com 1 Outline Industry overview IP backbone alternatives IP-over-DWDM IP-over-OTN Traffic routing & planning Network case studies Research
More informationBW Protection. 2002, Cisco Systems, Inc. All rights reserved.
BW Protection 2002, Cisco Systems, Inc. All rights reserved. 1 Cisco MPLS - Traffic Engineering for VPNs Amrit Hanspal Sr. Product Manager MPLS & QoS Internet Technologies Division 2 Agenda MPLS Fundamentals
More informationAlgorithms for Provisioning Virtual Private Networks in the Hose Model
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 10, NO 4, AUGUST 2002 565 Algorithms for Provisioning Virtual Private Networks in the Hose Model Amit Kumar, Rajeev Rastogi, Avi Silberschatz, Fellow, IEEE, and
More informationAdaptive Load Balancing Using MPLS
Adaptive Load Balancing Using MPLS Riikka Susitaival, Jorma Virtamo and Samuli Aalto Networking Laboratory Helsinki University of Technology Content Introduction Objectives of research Proposed algorithms
More informationISIS - SR: uloop Avoidance
The feature extends the ISIS Local Microloop Protection feature thereby preventing the occurrences of microloops during network convergence after a link-down event or link-up event. Prerequisites for,
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationLink Dimensioning and LSP Optimization for MPLS Networks Supporting DiffServ EF and BE Classes
Link Dimensioning and LSP Optimization for MPLS Networks Supporting DiffServ EF and BE Classes Kehang Wu Douglas S. Reeves Capacity Planning for QoS DiffServ + MPLS QoS in core networks DiffServ provides
More information1 Variations of the Traveling Salesman Problem
Stanford University CS26: Optimization Handout 3 Luca Trevisan January, 20 Lecture 3 In which we prove the equivalence of three versions of the Traveling Salesman Problem, we provide a 2-approximate algorithm,
More informationInternet Routing - MPLS. By Richard Harris
Internet Routing - MPLS By Richard Harris MPLS Presentation Outline Introduction Problems of Internet size Methods for overcoming potential problems What is MPLS? Overview MPLS terminology MPLS Architecture
More informationTo Change Traffic Engineering, Change the Traffic Matrix
To Change Traffic Engineering, Change the Traffic Matrix Paper 155 ABSTRACT Traditional traffic engineering adapts the routing of traffic within the network to maximize performance. We propose a new approach
More informationDynamic Network Provisioning for Time-Varying Traffic
JOURNAL OF COMMUNICATIONS AND NETWORKS, VOL. X, NO. X, XXXX 2X 1 Dynamic Network Provisioning for Time-Varying Traffic Vicky Sharma, Koushik Kar, Richard La, and Leandros Tassiulas Abstract: Abstract:
More informationGreedy Algorithms CLRS Laura Toma, csci2200, Bowdoin College
Greedy Algorithms CLRS 16.1-16.2 Laura Toma, csci2200, Bowdoin College Overview. Sometimes we can solve optimization problems with a technique called greedy. A greedy algorithm picks the option that looks
More informationCSE 417 Network Flows (pt 4) Min Cost Flows
CSE 417 Network Flows (pt 4) Min Cost Flows Reminders > HW6 is due Monday Review of last three lectures > Defined the maximum flow problem find the feasible flow of maximum value flow is feasible if it
More informationInternet Measurements. Motivation
Internet Measurements Arvind Krishnamurthy Fall 2004 Motivation Types of measurements Understand the topology of the Internet Measure performance characteristics Tools: BGP Tables Traceroute measurements
More informationOn Generalized Processor Sharing with Regulated Traffic for MPLS Traffic Engineering
On Generalized Processor Sharing with Regulated Traffic for MPLS Traffic Engineering Shivendra S. Panwar New York State Center for Advanced Technology in Telecommunications (CATT) Department of Electrical
More informationCSE 417 Branch & Bound (pt 4) Branch & Bound
CSE 417 Branch & Bound (pt 4) Branch & Bound Reminders > HW8 due today > HW9 will be posted tomorrow start early program will be slow, so debugging will be slow... Review of previous lectures > Complexity
More informationMapping pipeline skeletons onto heterogeneous platforms
Mapping pipeline skeletons onto heterogeneous platforms Anne Benoit and Yves Robert GRAAL team, LIP École Normale Supérieure de Lyon January 2007 Yves.Robert@ens-lyon.fr January 2007 Mapping pipeline skeletons
More informationOn the Optimality of Link-State Routing Protocols
On the Optimality of Link-State Routing Protocols Dahai Xu, Ph.D. Florham Park AT&T Labs - Research Joint work with Mung Chiang and Jennifer Rexford (Princeton University) New Mathematical Frontiers in
More informationMigrating to IPv6 The Role of Basic Coordination
Migrating to IPv6 The Role of Basic Coordination M. Nikkhah Dept. Elec. & Sys. Eng. University of Pennsylvania R. Guérin Dept. Comp. Sci. & Eng. Washington U. in St. Louis Outline Background and Motivations
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 29 Approximation Algorithms Load Balancing Weighted Vertex Cover Reminder: Fill out SRTEs online Don t forget to click submit Sofya Raskhodnikova 12/7/2016 Approximation
More informationPrediction-Based Admission Control for IaaS Clouds with Multiple Service Classes
Prediction-Based Admission Control for IaaS Clouds with Multiple Service Classes Marcus Carvalho, Daniel Menascé, Francisco Brasileiro 2015 IEEE Intl. Conf. Cloud Computing Technology and Science Summarized
More informationInter-Datacenter Scheduling of Large Data Flows
Inter-Datacenter Scheduling of Large Data Flows Reuven Cohen Gleb Polevoy Department of Computer Science Technion Israel Institute of Technology Haifa 32000, Israel Abstract Inter-datacenter transfers
More informationDatacenter Wide- area Enterprise
Datacenter Wide- area Enterprise Client LOAD- BALANCER Can t choose path : ( Servers Outline and goals A new architecture for distributed load-balancing joint (server, path) selection Demonstrate a nation-wide
More informationCSC 373: Algorithm Design and Analysis Lecture 3
CSC 373: Algorithm Design and Analysis Lecture 3 Allan Borodin January 11, 2013 1 / 13 Lecture 3: Outline Write bigger and get better markers A little more on charging arguments Continue examples of greedy
More informationPrecomputation Schemes for QoS Routing
578 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 4, AUGUST 2003 Precomputation Schemes for QoS Routing Ariel Orda, Senior Member, IEEE, and Alexander Sprintson, Student Member, IEEE Abstract Precomputation-based
More informationMaximize Bandwidth Utilization with Juniper Networks TE++
Maximize Bandwidth Utilization with Juniper Networks TE++ Lower Operations Overhead while Simplifying Network Planning 1 Table of Contents Executive Summary... 3 Introduction: The Bandwidth Challenge...
More informationNetwork Protection with Guaranteed Recovery Times using Recovery Domains
Technical Report, July 2012 Network Protection with Guaranteed Recovery Times using Recovery Domains Greg Kuperman MIT LIDS Cambridge, MA 02139 gregk@mit.edu Eytan Modiano MIT LIDS Cambridge, MA 02139
More informationAnalysis and Algorithms for Partial Protection in Mesh Networks
Technical Report, April 2011 Analysis and Algorithms for Partial Protection in Mesh Networks Greg uperman MIT LIDS Cambridge, MA 02139 gregk@mit.edu Eytan Modiano MIT LIDS Cambridge, MA 02139 modiano@mit.edu
More informationA Comparison Of MPLS Traffic Engineering Initiatives. Robert Pulley & Peter Christensen
A Comparison Of MPLS Traffic Engineering Initiatives Robert Pulley & Peter Christensen Need for MPLS Problems in today's network QoS and CoS requirements Need for Resource Reservation Why not RSVP MPLS
More informationDoctoral Written Exam in Networking, Fall 2008
Doctoral Written Exam in Networking, Fall 2008 December 5, 2008 Answer all parts of all questions. There are four multi-part questions, each of equal weight. Turn in your answers by Thursday, December
More informationMultiple Virtual Network Function Service Chain Placement and Routing using Column Generation
Multiple Virtual Network Function Service Chain Placement and Routing using Column Generation BY ABHISHEK GUPTA FRIDAY GROUP MEETING NOVEMBER 11, 2016 Virtual Network Function (VNF) Service Chain (SC)
More informationIn this lecture we discuss the complexity of approximation problems, and show how to prove they are NP-hard.
In this lecture we discuss the complexity of approximation problems, and show how to prove they are NP-hard. 1 We will show how one can prove such results and then apply this technique to some approximation
More informationGraph Theory and Optimization Approximation Algorithms
Graph Theory and Optimization Approximation Algorithms Nicolas Nisse Université Côte d Azur, Inria, CNRS, I3S, France October 2018 Thank you to F. Giroire for some of the slides N. Nisse Graph Theory and
More information12.1 Formulation of General Perfect Matching
CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Perfect Matching Polytope Date: 22/02/2008 Lecturer: Lap Chi Lau Scribe: Yuk Hei Chan, Ling Ding and Xiaobing Wu In this lecture,
More informationQuality of Service Routing
Quality of Service Routing KNOM Tutorial 2004, Jeju, Korea, Nov. 4-5, 2004. November 5, 2004 Kwang-Hui Lee Communication Systems Lab, Changwon National University khlee@changwon.ac.kr Contents Introduction
More informationOptical Packet Switching
Optical Packet Switching DEISNet Gruppo Reti di Telecomunicazioni http://deisnet.deis.unibo.it WDM Optical Network Legacy Networks Edge Systems WDM Links λ 1 λ 2 λ 3 λ 4 Core Nodes 2 1 Wavelength Routing
More informationWDM Network Provisioning
IO2654 Optical Networking WDM Network Provisioning Paolo Monti Optical Networks Lab (ONLab), Communication Systems Department (COS) http://web.it.kth.se/~pmonti/ Some of the material is taken from the
More informationHighway Dimension and Provably Efficient Shortest Paths Algorithms
Highway Dimension and Provably Efficient Shortest Paths Algorithms Andrew V. Goldberg Microsoft Research Silicon Valley www.research.microsoft.com/ goldberg/ Joint with Ittai Abraham, Amos Fiat, and Renato
More informationAM 221: Advanced Optimization Spring 2016
AM 221: Advanced Optimization Spring 2016 Prof Yaron Singer Lecture 3 February 1st 1 Overview In our previous lecture we presented fundamental results from convex analysis and in particular the separating
More informationScheduling Unsplittable Flows Using Parallel Switches
Scheduling Unsplittable Flows Using Parallel Switches Saad Mneimneh, Kai-Yeung Siu Massachusetts Institute of Technology 77 Massachusetts Avenue Room -07, Cambridge, MA 039 Abstract We address the problem
More informationWDM Network Provisioning
IO2654 Optical Networking WDM Network Provisioning Paolo Monti Optical Networks Lab (ONLab), Communication Systems Department (COS) http://web.it.kth.se/~pmonti/ Some of the material is taken from the
More informationApproximation and Heuristic Algorithms for Minimum Delay Application-Layer Multicast Trees
THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING Approximation and Heuristic Algorithms for Minimum Delay Application-Layer Multicast Trees A thesis submitted toward the degree of Master of Science
More informationPrinciples of AI Planning. Principles of AI Planning. 7.1 How to obtain a heuristic. 7.2 Relaxed planning tasks. 7.1 How to obtain a heuristic
Principles of AI Planning June 8th, 2010 7. Planning as search: relaxed planning tasks Principles of AI Planning 7. Planning as search: relaxed planning tasks Malte Helmert and Bernhard Nebel 7.1 How to
More informationAppeared in Proceedings of ICNP02, Paris, Nov 2002 Appea. Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks Li Li, Milind M. Buddhikot, Chandra Chekuri, Katherine Guo Λ Abstract The emerging Multi-Protocol Label Switching (MPLS)
More informationComputer Network Architectures and Multimedia. Guy Leduc. Chapter 2 MPLS networks. Chapter 2: MPLS
Computer Network Architectures and Multimedia Guy Leduc Chapter 2 MPLS networks Chapter based on Section 5.5 of Computer Networking: A Top Down Approach, 6 th edition. Jim Kurose, Keith Ross Addison-Wesley,
More informationBOOLEAN MATRIX FACTORIZATIONS. with applications in data mining Pauli Miettinen
BOOLEAN MATRIX FACTORIZATIONS with applications in data mining Pauli Miettinen MATRIX FACTORIZATIONS BOOLEAN MATRIX FACTORIZATIONS o THE BOOLEAN MATRIX PRODUCT As normal matrix product, but with addition
More informationMPLS Traffic Engineering Traffic Protection using Fast Re-route (FRR)
MPLS Traffic Engineering Traffic Protection using Fast Re-route (FRR) Santiago Álvarez August 2008 2007 Cisco Systems, Inc. All rights reserved. 1 MPLS TE Use Cases Strategic Bandwidth Optimization Tactical
More informationThe Impact of Control Path Survivability on Data Plane Survivability in SDN. Sedef Savas Networks Lab, Group Meeting Aug 11, 2017
The Impact of Control Path Survivability on Data Plane Survivability in SDN Sedef Savas Networks Lab, Group Meeting Aug 11, 2017 1 1 1 3 2 4 3 2 4 6 6 5 5 7 7 a) 9-node network topology, controller is
More informationEfficient OSPF Weight Allocation for Intra-domain QoS Optimization
Efficient OSPF Weight Allocation for Intra-domain QoS Optimization Pedro Sousa, Miguel Rocha, Miguel Rio, and Paulo Cortez + Department of Informatics/CCTC, University of Minho, Portugal, email: {pns,mrocha}@di.uminho.pt
More informationAhmed Benallegue RMDCN workshop on the migration to IP/VPN 1/54
MPLS Technology Overview Ahmed Benallegue A.Benallegue@ecmwf.int RMDCN workshop on the migration to IP/VPN 1/54 Plan 1. MPLS basics 2. The MPLS approach 3. Label distribution RSVP-TE 4. Traffic Engineering
More informationDatacenter Wide- area Enterprise
Datacenter Wide- area Enterprise Client LOAD- BALANCER Can t choose path : ( Servers Outline and goals A new architecture for distributed load-balancing joint (server, path) selection Demonstrate a nation-wide
More informationChapter 5: Distributed Process Scheduling. Ju Wang, 2003 Fall Virginia Commonwealth University
Chapter 5: Distributed Process Scheduling CMSC 602 Advanced Operating Systems Static Process Scheduling Dynamic Load Sharing and Balancing Real-Time Scheduling Section 5.2, 5.3, and 5.5 Additional reading:
More informationDavid Tipper Graduate Telecommunications and Networking Program University of Pittsburgh. Motivation
Survivable Network Design David Tipper Graduate Telecommunications and Networking Program University of Pittsburgh Telcom 2110 Slides 12 Motivation Communications networks need to be survivable? Communication
More informationSURVIVABLE VNE. By Sedef Savas Networks Lab, May 25, 2017
SURVIVABLE VNE By Sedef Savas Networks Lab, May 25, 2017 1 SURVEY ON SURVIVABLE VIRTUAL NETWORK EMBEDDING PROBLEM AND SOLUTIONS Sandra Herker, Ashiq Khan, Xueli An DOCOMO Communications Laboratories Europe
More informationBandwidth Aware Routing Algorithms for Networks-on-Chip
1 Bandwidth Aware Routing Algorithms for Networks-on-Chip G. Longo a, S. Signorino a, M. Palesi a,, R. Holsmark b, S. Kumar b, and V. Catania a a Department of Computer Science and Telecommunications Engineering
More informationLSP Setup Arrival Reordering Approach for MPLS-TE Routing
LSP Setup Arrival Reordering Approach for MPLS-TE Routing Imène Chaieb and Jean-Louis Le Roux France Telecom R&D, Lannion 37, France Email: {imene.chaieb, jeanlouis.leroux}@orange-ftgroup.com Bernard Cousin
More informationSurvivability Architectures for Service Independent Access Points to Multiwavelength Optical Wide Area Networks
Survivability Architectures for Service Independent Access Points to Multiwavelength Optical Wide Area Networks Master s Thesis Defense Ananth Nagarajan EECS Department, University of Kansas 10/13/98 Outline
More informationA Connectionless Approach to Intra- and Inter-Domain Traffic Engineering
A Connectionless Approach to Intra- and Inter-Domain Traffic Engineering Hema T. Kaur, Shivkumar Kalyanaraman ECSE Department, Rensselaer Polytechnic Institute, Troy, NY-12180 {hema,shivkuma}@networks.ecse.rpi.edu
More informationAdvanced Topics in Routing
Advanced Topics in Routing EE122 Fall 2012 Scott Shenker http://inst.eecs.berkeley.edu/~ee122/ Materials with thanks to Jennifer Rexford, Ion Stoica, Vern Paxson and other colleagues at Princeton and UC
More informationDynamic Routing of Restorable Bandwidth-Guaranteed Tunnels Using Aggregated Network Resource Usage Information
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 3, JUNE 2003 399 Dynamic Routing of Restorable Bwidth-Guaranteed Tunnels Using Aggregated Network Resource Usage Information Murali Kodialam, Associate
More informationSource Routing Algorithms for Networks with Advance Reservations
Source Routing Algorithms for Networks with Advance Reservations Lars-Olof Burchard Communication and Operating Systems Technische Universitaet Berlin ISSN 1436-9915 No. 2003-3 February, 2003 Abstract
More information10 Optical Network Engineering
10 Optical Network Engineering George N. Rouskas Department of Computer Science North Carolina State University Raleigh, NC 27695-7534 Email: rouskas@csc.ncsu.edu 10.1 INTRODUCTION Over the last few years
More informationScheduling Jobs with Dwindling Resource Requirements in Clouds
Scheduling Jobs with Dwindling Resource Requirements in Clouds Sivan Albagli-Kim Hadas Shachnai Tami Tamir Computer Science Department, Technion, Haifa 3000, Israel E-mail: {hadas,sivanal}@cs.technion.ac.il
More informationMulti-Commodity Flow with In-Network Processing
Multi-Commodity Flow with In-Network Processing Moses Charikar Yonatan Naamad Jennifer Rexford X. Kelvin Zou Outline 1 Routing and Steering 2 In-Network Processing Computer Networks are now dual-purpose.
More informationUnit 2 Packet Switching Networks - II
Unit 2 Packet Switching Networks - II Dijkstra Algorithm: Finding shortest path Algorithm for finding shortest paths N: set of nodes for which shortest path already found Initialization: (Start with source
More informationApproximation Algorithms
Approximation Algorithms Frédéric Giroire FG Simplex 1/11 Motivation Goal: Find good solutions for difficult problems (NP-hard). Be able to quantify the goodness of the given solution. Presentation of
More informationL1.5VPNs: PACKET-SWITCHING ADAPTIVE L1 VPNs
L1.5VPNs: PACKET-SWITCHING ADAPTIVE L1 VPNs What: Why: How: L1.5VPN is functionally equal to connecting VPN access sites over dedicated L1/0 connections to hub packet switch(es) However, uses more cost-efficient
More informationOptimal network flow allocation
Optimal network flow allocation EE384Y Project intermediate report Almir Mutapcic and Primoz Skraba Stanford University, Spring 2003-04 May 10, 2004 Contents 1 Introduction 2 2 Background 2 3 Problem statement
More information