Ramin Khalili (T-Labs/TUB) Nicolas Gast (LCA2-EPFL)

Slides:



Advertisements
Similar presentations
You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Advertisements

Advanced Piloting Cruise Plot.
Martin Suchara, Ryan Witt, Bartek Wydrowski California Institute of Technology Pasadena, U.S.A. TCP MaxNet Implementation and Experiments on the WAN in.
Copyright © 2002 Pearson Education, Inc. Slide 1.
© 2008 Pearson Addison Wesley. All rights reserved Chapter Seven Costs.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Chapter 1 The Study of Body Function Image PowerPoint
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
Reconsidering Reliable Transport Protocol in Heterogeneous Wireless Networks Wang Yang Tsinghua University 1.
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
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, $
Summary of Convergence Tests for Series and Solved Problems
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.
Determine Eligibility Chapter 4. Determine Eligibility 4-2 Objectives Search for Customer on database Enter application signed date and eligibility determination.
My Alphabet Book abcdefghijklm nopqrstuvwxyz.
Multiplying binomials You will have 20 seconds to answer each of the following multiplication problems. If you get hung up, go to the next problem when.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
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.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Addition Facts
Year 6 mental test 5 second questions
Around the World AdditionSubtraction MultiplicationDivision AdditionSubtraction MultiplicationDivision.
ZMQS ZMQS
1 Outline relationship among topics secrets LP with upper bounds by Simplex method basic feasible solution (BFS) by Simplex method for bounded variables.
Solve Multi-step Equations
REVIEW: Arthropod ID. 1. Name the subphylum. 2. Name the subphylum. 3. Name the order.
MIMO Broadcast Scheduling with Limited Feedback Student: ( ) Director: 2008/10/2 1 Communication Signal Processing Lab.
Randomized Algorithms Randomized Algorithms CS648 1.
ABC Technology Project
1 Improving TCP Performance over Mobile Networks HALA ELAARAG Stetson University Speaker : Aron ACM Computing Surveys 2002.
VOORBLAD.
Quadratic Inequalities
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
Protecting Location Privacy: Optimal Strategy against Localization Attacks Reza Shokri, George Theodorakopoulos, Carmela Troncoso, Jean-Pierre Hubaux,
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
Squares and Square Root WALK. Solve each problem REVIEW:
Do you have the Maths Factor?. Maths Can you beat this term’s Maths Challenge?
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
© 2012 National Heart Foundation of Australia. Slide 2.
Lets play bingo!!. Calculate: MEAN Calculate: MEDIAN
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
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…...
One More Bit Is Enough Yong Xia, RPI Lakshmi Subramanian, UCB Ion Stoica, UCB Shiv Kalyanaraman, RPI SIGCOMM’ 05, Philadelphia, PA 08 / 23 / 2005.
Januar MDMDFSSMDMDFSSS
Week 1.
1. 2 No lecture on Wed February 8th Thursday 9 th Feb Friday 27 th Jan Friday 10 th Feb Thursday 14: :00 Friday 16:00 – 19:00 HS N.
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Intracellular Compartments and Transport
A SMALL TRUTH TO MAKE LIFE 100%
PSSA Preparation.
1 PART 1 ILLUSTRATION OF DOCUMENTS  Brief introduction to the documents contained in the envelope  Detailed clarification of the documents content.
CpSc 3220 Designing a Database
Peter Key, Laurent Massoulie, Don Towsley Infocom 07 presented by Park HoSung 1 Path selection and multipath congestion control.
Traktor- og motorlære Kapitel 1 1 Kopiering forbudt.
Balia (Balanced linked adaptation) A new MPTCP congestion control algorithm Anwar Walid Jaehyun Hwang Qiuyu Peng Steven Low July 2014.
MPTCP is not Pareto- Optimal Performance Issues and a possible solution B 吳昇峰.
Congestion control for Multipath TCP (MPTCP) Damon Wischik Costin Raiciu Adam Greenhalgh Mark Handley THE ROYAL SOCIETY.
1 Three ways to (ab)use Multipath Congestion Control Costin Raiciu University Politehnica of Bucharest.
Presentation transcript:

MPTCP is not Pareto-Optimal: Performance Issues and a Possible Solution Ramin Khalili (T-Labs/TUB) Nicolas Gast (LCA2-EPFL) Miroslav Popovic (LCA2-EPFL) Utkarsh Upadhyay (LCA2-EPFL) Jean-Yves Le Boudec (LCA2-EPFL)

MPTCP: Multi-path Transport Solution of IETF allows a user to split its traffic across multiple paths; improve reliability and throughput challenge: design of congestion control algorithm

LIA (RFC 6356): "Linked-Increases Algorithm" adhoc design based on 3 goals improve throughput: total throughput ≥ TCP over best path do not harm: not more aggressive than a TCP over a path balance congestion while meeting the first two goals as also stated in RFC 6356, LIA does not fully satisfy goal 3

We identified problems with the current MPTCP implementation P1: MPTCP can penalize users P2: MPTCP users are excessively aggressive toward TCP users P1 and P2 are attributed to LIA outline examples of performance issues can these problems be fixed in practice?

Measurement-based study supported by theory

MPTCP CAN PENALIZE USERS upgrading some TCP users to MPTCP can reduce the throughput of others without any benefit to the upgraded users MPTCP CAN PENALIZE USERS

Scenario A: MPTCP can penalize TCP users bottleneck for Type 1 users is at server side high speed connections N1 C1 N1 x1 bottleneck for Type 2 users is at access side

Scenario A: MPTCP can penalize TCP users bottleneck for Type 1 users is at server side high speed connections N1 C1 x2 N1( x1+x2 ) bottleneck for Type 2 users is at access side

Throughput of type 2 users reduced without any benefit for type 1 users N1 C1 x2

We compare MPTCP with a theoretical baselines optimal algorithm with probing cost: theoretical optimal load balancing including minimal probing traffic using a windows-based algorithm, a minimum probing traffic of 1 MSS/RTT is sent over each path

Part of problem is in nature of things, but MPTCP seems to be far from optimal N1 C1 x2

Scenario B: MPTCP can penalize other MPTCP users bottleneck with capacity Cx bottleneck with capacity CT

By upgrading red users to MPTCP, the throughput of everybody decreases decrease is 3% using optimal algorithm with probing cost 15 blue and 15 red users, CX=27 and CT=36 Mbps

CAN THE SUBOPTIMALITY OF MPTCP WITH LIA BE FIXED?

LIA’s design forces tradeoff between responsiveness and load balancing provide load balancing be responsive optimal load balacing but not responsive responsive but bad load balancing LIA’s implementation (RFC 6356) ε=0 ε=1 ε=2 ε is a design parameter

OLIA: an algorithm inspired by utility maximization framework simultaneously provides responsiveness and load balancing an adjustment of optimal algorithm by adapting windows increases as a function of quality of paths, we make it responsive and non-flappy implemented on the MPTCP Linux kernel

Definition: set of best paths and paths with maximum windows for a user u, with Ru as set of paths, define set of best paths: set of path with maximum windows: : number of successful transmissions between losses on path r rttr(t): RTT on path r

OLIA: "Opportunistic Linked-Increases Algorithm" For a user u, on each path r in Ru: increase part: for each ACK on r, increase wr by αr= decrease part: each loss on r, decreases wr by wr/2 optimal load balancing responsiveness

An illustrative example of OLIA’s behavior MPTCP with OLIA MPTCP with OLIA MPTCP with LIA MPTCP with LIA paths have similar quality, OLIA uses both (non-flappy and responsive) second path is congested, OLIA uses only the first one

Theoretical results: OLIA solves problems P1 and P2 using a fluid model of OLIA Theorem: OLIA satisfies design goals of LIA (RFC 6356) Theorem: OLIA is Pareto optimal Theorem: when all paths of a user have similar RTTs, OLIA provides optimal load balancing

Scenario A: OLIA performs close to optimal algorithm with probing cost N1 C1 x2

Scenario B: using OLIA, we observe 3.5% drop in aggregate throughput MPTCP with OLIA MPTCP with LIA 15 blue and 15 red users, CX=27 and CT=36 Mbps

Summary MPTCP with LIA suffers from important performance problems these problems can be mitigated in practice OLIA: inspired by utility maximization framework suggestion: congestion control part of MPTCP should be revisited by the IETF committees

BACKUP SLIDES

Scenario C: MPTCP users could be excessively aggressive towards regular TCP users (P2) wifi

Scenario C: OLIA achieves much better fairness (solving P2) when C1/C2≥1, for any theoretical fairness criterion: (x1+x2)/C1=1 and y/C2=1