Abhigyan, Aditya Mishra, Vikas Kumar, Arun Venkataramani University of Massachusetts Amherst 1.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Failure Resilient Routing Simple Failure Recovery with Load Balancing Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.
Greening Backbone Networks Shutting Off Cables in Bundled Links Will Fisher, Martin Suchara, and Jennifer Rexford Princeton University.
Responsive Yet Stable Traffic Engineering Srikanth Kandula Dina Katabi, Bruce Davie, and Anna Charny.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
1 Chapter 40 - Physiology and Pathophysiology of Diuretic Action Copyright © 2013 Elsevier Inc. All rights reserved.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
APNOMS2003Fujitsu Laboratories Ltd.1 A QoS Control Method Cooperating with a Dynamic Load Balancing Mechanism Akiko Okamura, Koji Nakamichi, Hitoshi Yamada.
REQ Drop from Demand Response Programs Process Flow Retail Customer Demand Response Service Provider (DRSP) Distribution Company 1 Drop Request.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
0 - 0.
1 1  1 =.
1  1 =.
2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt Time Money AdditionSubtraction.
ALGEBRAIC EXPRESSIONS
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
MULTIPLICATION EQUATIONS 1. SOLVE FOR X 3. WHAT EVER YOU DO TO ONE SIDE YOU HAVE TO DO TO THE OTHER 2. DIVIDE BY THE NUMBER IN FRONT OF THE VARIABLE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
FACTORING Think Distributive property backwards Work down, Show all steps ax + ay = a(x + y)
Addition Facts
Year 6 mental test 5 second questions
Year 6 mental test 10 second questions
Around the World AdditionSubtraction MultiplicationDivision AdditionSubtraction MultiplicationDivision.
Welcome to Who Wants to be a Millionaire
£1 Million £500,000 £250,000 £125,000 £64,000 £32,000 £16,000 £8,000 £4,000 £2,000 £1,000 £500 £300 £200 £100 Welcome.
ZMQS ZMQS
VARUN GUPTA Carnegie Mellon University 1 Partly based on joint work with: Anshul Gandhi Mor Harchol-Balter Mike Kozuch (CMU) (CMU) (Intel Research)
New Algorithms for Planning Bulk Transfer via Internet and Shipping Networks Brian Cho Indranil Gupta University of Illinois at Urbana-Champaign.
Solve Multi-step Equations
Utility Optimization for Event-Driven Distributed Infrastructures Cristian Lumezanu University of Maryland, College Park Sumeer BholaMark Astley IBM T.J.
1 Challenge the future Subtitless On Lightweight Design of Submarine Pressure Hulls.
1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)
ABC Technology Project
Shadow Prices vs. Vickrey Prices in Multipath Routing Parthasarathy Ramanujam, Zongpeng Li and Lisa Higham University of Calgary Presented by Ajay Gopinathan.
© S Haughton more than 3?
VOORBLAD.
Effects on UK of Eustatic sea Level rise GIS is used to evaluate flood risk. Insurance companies use GIS models to assess likely impact and consequently.
Twenty Questions Subject: Twenty Questions
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
Linking Verb? Action Verb or. Question 1 Define the term: action verb.
Energy & Green Urbanism Markku Lappalainen Aalto University.
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Lets play bingo!!. Calculate: MEAN Calculate: MEDIAN
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
Chapter 5 Test Review Sections 5-1 through 5-4.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
Week 1.
Number bonds to 10,
We will resume in: 25 Minutes.
1 Unit 1 Kinematics Chapter 1 Day
New Opportunities for Load Balancing in Network-Wide Intrusion Detection Systems Victor Heorhiadi, Michael K. Reiter, Vyas Sekar UNC Chapel Hill UNC Chapel.
© 2006, François Brouard Case Real Group François Brouard, DBA, CA January 6, 2006.
1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
Distributing Content Simplifies ISP Traffic Engineering Abhigyan Sharma* Arun Venkataramani* Ramesh Sitaraman*~ *University of Massachusetts Amherst ~Akamai.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
Theophilus Benson*, Ashok Anand*, Aditya Akella*, Ming Zhang + *University of Wisconsin, Madison + Microsoft Research.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Presentation transcript:

Abhigyan, Aditya Mishra, Vikas Kumar, Arun Venkataramani University of Massachusetts Amherst 1

 Examples: ◦ CDNs ◦ P2P applications ◦ Mirrored websites ◦ Cloud computing 2 Location diversity: Ability to download content from multiple locations

 ISPs have several objectives, e.g., minimizing congestion, decisions about upgrading link capacity  ISPs optimize link utilization based metrics. e.g. maximum link utilization (MLU) 3

4 Traffic engineering (ISPs) Location diversity (CDNs) Internet traffic

 How do TE schemes compare accounting for location diversity in the Internet? 5

1. Introduction 2. Motivation 1.Location diversity and traffic engineering 2.Metric of comparison 3. Evaluation 4. Conclusion 6

Application adaptation to location diversity Traffic matrix New Routing 7 Traffic engineering Content demand

8 100 Mbps, 0.1ms 100 Mbps, 10ms Mb x 10 req/s = 100 Mbps 10 Mb x 5 req/s = 50 Mbps OSPF Wt = 2 OSPF Wt = 1 50 Mbps + 50 Mbps 50 Mbps Maximum link utilization ( MLU )= 1 OSPF Wt = 1

9 100 Mbps, 0.1ms 100 Mbps, 10ms OSPF Wt = 2 OSPF Wt = 1 50 Mbps + 50 Mbps 50 Mbps OSPF Wt = 1 25 Mbps + 25 Mbps Expected MLU = Mbps +25Mbps MLU = Mb x 10 req/s = 100 Mbps 10 Mb x 5 req/s = 50 Mbps OSPF Wt = 1

Location diversity increases capacity 100 Mbps Mb x 10req/s = 100 Mbps 100 Mbps 10 Mb x 20req/s = 200 Mbps Increase in capacity = 200/ 100 = 2

1. Motivation 1.Location diversity and traffic engineering 2.Metric of comparison 2. Evaluation 3. Conclusion 11

 Without location diversity ◦ Capacity = 1/MLU Mbps Mbps 100 Mbps MLU = Mbps Capacity = 100/25 = Mbps max supportable demand current demand Capacity =

 Without location diversity ◦ Capacity = 1/MLU  With location diversity ◦ Ca pacity >= 1/MLU Mbps Mbps 100 Mbps 25 Mbps 5 Mbps MLU = Mbps 90 Mbps Capacity > 180/30 = 6 Need a new metric to quantify capacity under location diversity max supportable demand current demand Capacity =

 SPF = Maximum supportable surge (linearly scaled) in traffic demand 14 SPF = 200/30 = Mbps Mbps 100 Mbps 25 Mbps 5 Mbps 100 Mbps 200Mbps

Location diversity significantly impacts TE 1.Capacity increases 2.Capacity (SPF) not captured by 1/MLU 15

1. Introduction 2. Motivation 3. Evaluation 1.TE schemes 2.Measuring SPF 3.Capacity results (SPF) 4. Conclusion 16

17 TE Schemes (Almost online) optimal TE [OPT] (Offline) “optimal” TE using MPLS [MPLS] (Offline) TE using OSPF link weight optimization [OptWt] (Offline) Multi-TM optimization TE [COPE] (Oblivious) Static shortest path routing with inverse- capacity link weights [InvCap]

18 Is demand satisfied ? Increase demand by Δ SPF = demand/(initial demand) Demand = initial demand YES NO

19 InvCap worst case No LocDiv = 50% sub-OPT LocDiv = 30% sub-OPT 1.All TE schemes achieve near-optimal capacity with location diversity. 2.Even no TE scheme is at most 30% sub-optimal with location diversity.

 “How location diversity ate traffic engineering’s cake” ◦ Any TE scheme performs the same as Optimal TE. ◦ No TE scheme performs at most 30% worse. 20