What mathematicians should 1 know about the Internet: a case study.

Slides:



Advertisements
Similar presentations
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Advertisements

FAST TCP Anwis Das Ajay Gulati Slides adapted from : IETF presentation slides Link:
MPTCP is not Pareto- Optimal Performance Issues and a possible solution B 吳昇峰.
Cs/ee 143 Communication Networks Chapter 6 Internetworking Text: Walrand & Parekh, 2010 Steven Low CMS, EE, Caltech.
Restless bandits and congestion control Mark Handley, Costin Raiciu, Damon Wischik UCL.
Multipath TCP Costin Raiciu University Politehnica of Bucharest Joint work with: Mark Handley, Damon Wischik, University College London Olivier Bonaventure,
TDTS21 Advanced Networking
Improving Datacenter Performance and Robustness with Multipath TCP Costin Raiciu, Sebastien Barre, Christopher Pluntke, Adam Greenhalgh, Damon Wischik,
Technical: what might I mean by multipath? 1.Via an overlay network 2.End-points are multi- homed, and expose multiple IP addresses; routing works as it.
Congestion Control: TCP & DC-TCP Swarun Kumar With Slides From: Prof. Katabi, Alizadeh et al.
Mathematical models of the Internet Frank Kelly Hood Fellowship Public Lecture University of Auckland 3 April 2012.
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
Resource Pooling A system exhibits complete resource pooling if it behaves as if there was a single pooled resource. The Internet has many mechanisms for.
Congestion Control An Overview -Jyothi Guntaka. Congestion  What is congestion ?  The aggregate demand for network resources exceeds the available capacity.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.
Control Theory in TCP Congestion Control and new “FAST” designs. Fernando Paganini and Zhikui Wang UCLA Electrical Engineering July Collaborators:
High Performance All-Optical Networks with Small Buffers Yashar Ganjali High Performance Networking Group Stanford University
Traffic Engineering With Traditional IP Routing Protocols
Traffic Engineering Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
TCP Stability and Resource Allocation: Part I. References The Mathematics of Internet Congestion Control, Birkhauser, The web pages of –Kelly, Vinnicombe,
Chapter 4 Network Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 14.
10 - Network Layer. Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving.
Promoting the Use of End-to- End Congestion Control in the Internet Sally Floyd and Kevin Fall Presented by Scott McLaren.
Rethinking Internet Traffic Management: From Multiple Decompositions to a Practical Protocol Jiayue He Princeton University Joint work with Martin Suchara,
Combining Multipath Routing and Congestion Control for Robustness Peter Key.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
Multipath Protocol for Delay-Sensitive Traffic Jennifer Rexford Princeton University Joint work with Umar Javed, Martin Suchara, and Jiayue He
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
Second year review Resource Pooling Damon Wischik, UCL.
Chapter 5 Link Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 Link Layer data center.
Network Architecture (R02) IP Multipath – Path Selection&CC Jon Crowcroft,
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
The teleology of Internet congestion control Damon Wischik, Computer Science, UCL.
Experiences in Design and Implementation of a High Performance Transport Protocol Yunhong Gu, Xinwei Hong, and Robert L. Grossman National Center for Data.
Multipath TCP design, and application to data centers Damon Wischik, Mark Handley, Costin Raiciu, Christopher Pluntke.
Networks Research Group Prof. Mark Handley Department of Computer Science.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
Models of multipath resource allocation Damon Wischik, UCL.
High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.
Congestion control for Multipath TCP (MPTCP) Damon Wischik Costin Raiciu Adam Greenhalgh Mark Handley THE ROYAL SOCIETY.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
1 Mao W07 Midterm Review EECS 489 Computer Networks Z. Morley Mao Monday Feb 19, 2007 Acknowledgement: Some.
Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005.
Congestion Control for High Bandwidth-Delay Product Networks D. Katabi (MIT), M. Handley (UCL), C. Rohrs (MIT) – SIGCOMM’02 Presented by Cheng.
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
COP 5611 Operating Systems Spring 2010 Dan C. Marinescu Office: HEC 439 B Office hours: M-Wd 2:00-3:00 PM.
Networking Fundamentals. Basics Network – collection of nodes and links that cooperate for communication Nodes – computer systems –Internal (routers,
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
Some questions about multipath Damon Wischik, UCL Trilogy UCL.
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
Forwarding.
1 SIGCOMM ’ 03 Low-Rate TCP-Targeted Denial of Service Attacks A. Kuzmanovic and E. W. Knightly Rice University Reviewed by Haoyu Song 9/25/2003.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
Scalable Laws for Stable Network Congestion Control Fernando Paganini UCLA Electrical Engineering IPAM Workshop, March Collaborators: Steven Low,
HELSINKI UNIVERSITY OF TECHNOLOGY Visa Holopainen 1/18.
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
5: DataLink Layer5-1 Virtualization of networks Virtualization of resources: powerful abstraction in systems engineering: r computing examples: virtual.
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.
1 Three ways to (ab)use Multipath Congestion Control Costin Raiciu University Politehnica of Bucharest.
Day 13 Intro to MANs and WANs. MANs Cover a larger distance than LANs –Typically multiple buildings, office park Usually in the shape of a ring –Typically.
Multipath TCP and the Resource Pooling Principle
Traffic Engineering with AIMD in MPLS Networks
Multipath TCP Yifan Peng Oct 11, 2012
Congestion Control, Internet transport protocols: udp
EE 122: Lecture 7 Ion Stoica September 18, 2001.
TCP Congestion Control
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’
Presentation transcript:

What mathematicians should 1 know about the Internet: a case study

Overlay TCP for multi-path routing and congestion control Han, Shakkottai, Hollot, Srikant, Towsley, ENS-INRIA ARC-TCP Workshop 2003 ABSTRACT. We consider the problem of multi-path routing in the Internet. Currently, Internet routing protocols select only a single path between a source and a destination. However, due to many policy routing decisions, single-path routing may limit the achievable throughput. In this paper, we envision a scenario where application-level routers are overlaid on the Internet to allow multi-path routing. Using minimal congestion feedback signals from the overlay routers, we present an algorithm that can be implemented at the sources to stably and optimally split the flow between each source-destination pair. We then show that the connection-level throughput region of such a multi-path routing/congestion control scheme can be larger than that of a single-path congestion control scheme. 2

Stability of end-to-end algorithms for joint routing and rate control Kelly and Voice, Computer Communication Review 2005 ABSTRACT. Dynamic multi-path routing has the potential to improve the reliability and performance of a communication network, but carries a risk. Routing needs to respond quickly to achieve the potential benefits, but not so quickly that the network is destabilized. This paper studies how rapidly routing can respond, without compromising stability. We present a sufficient condition for the local stability of end-to-end algorithms for joint routing and rate control. The network model considered allows an arbitrary interconnection of sources and resources, and heterogeneous propagation delays. The sufficient condition we present is decentralized: the responsiveness of each route is restricted by the round-trip time of that route alone, and not by the roundtrip times of other routes. Our results suggest that stable, scalable load- sharing across paths, based on end-to-end measurements, can be achieved on the same rapid time-scale as rate control, namely the time-scale of round-trip times. ABSTRACT. Dynamic multi-path routing has the potential to improve the reliability and performance of a communication network, but carries a risk. Routing needs to respond quickly to achieve the potential benefits, but not so quickly that the network is destabilized. This paper studies how rapidly routing can respond, without compromising stability. We present a sufficient condition for the local stability of end-to-end algorithms for joint routing and rate control. The network model considered allows an arbitrary interconnection of sources and resources, and heterogeneous propagation delays. The sufficient condition we present is decentralized: the responsiveness of each route is restricted by the round-trip time of that route alone, and not by the roundtrip times of other routes. Our results suggest that stable, scalable load- sharing across paths, based on end-to-end measurements, can be achieved on the same rapid time-scale as rate control, namely the time-scale of round-trip times. 3

What problem is being solved by joint routing and rate control? 4 Given a network consisting of a set of links indexed by j, each with its own penalty function C j a set of users indexed by s, each with his/her own utility function U s and a set of routes indexed by r,

What problem is being solved by end-to-end algorithms for joint routing and rate control? 5 Find a distributed algorithm for solving the network utility maximization problem. That is, where the fixed point of this system of equations solves the utility maximization problem.

What problem is being solved by stable end-to-end algorithms for joint routing and rate control? 6 Find a distributed algorithm for solving the network utility maximization problem. The system of differential equations should be stable (or at least locally stable, in y and z) about the equilibrium.

What are the limits of this solution? 1.It is tricky to evolve TCP to implement the principles of the Kelly+Voice algorithm. 2.Network systems people don’t see the applicability of fluid stability results. 3.Network systems people don’t see the point in utility maximization. 7

“Mathematicians are like Frenchmen: whatever you say to them they translate into their own language and forthwith it is something entirely different.” Goethe,

“All mathematical models are wrong. Some are good wrong, some are bad wrong.” 9

10 Han, Shakkottai, Hollot, Srikant, Towsley, 2003 Kelly+Voice, 2005 UCL / Trilogy project, 2008 IETF working group, 2009 IETF experimental standard, 2011? widespread interest, 2011

What does multipath look like to an Internet systems person? Why does the Internet need multipath? If the Internet needs multipath, why don’t we have it already? 11

TCP 12 IP user space socket API addr senderreceiver

We designed MPTCP to be a drop-in replacement for TCP. 13 IP user space socket API addr 1 addr 2 addr The sender stripes packets across paths The receiver puts the packets in the correct order TCP MPTCP senderreceiver Either the receiver or the sender has multiple addresses, so the sender can use multiple paths addr

IP addr We designed MPTCP to be a drop-in replacement for TCP. 14 user space socket API The sender stripes packets across paths The receiver puts the packets in the correct order TCP MPTCP senderreceiver Or, the Internet has some direct mechanisms for giving you ‘lucky dip’ access to multiple paths

Can multipath help with mobile hand-offs? 15 internet wifi hotspot 3G cell

Can multipath help with mobile hand-offs? 16 internet wifi hotspot 3G cell

Can multipath help with mobile hand-offs? 17 internet wifi hotspot 3G cell

Can multipath help with mobile hand-offs? 18 internet wifi hotspot 3G cell

Can multipath help with mobile hand-offs? 19 internet wifi hotspot 3G cell

Can multipath help with mobile hand-offs? If your phone uses both radios simultaneously, you needn’t experience any interruption. 20

Can multipath help with mobile hand-offs? If your phone uses both radios simultaneously, you needn’t experience any interruption. 21

Can multipath help with mobile hand-offs? If your phone uses both radios simultaneously, you needn’t experience any interruption. 22

Can multipath help with mobile hand-offs? If your phone uses both radios simultaneously, you needn’t experience any interruption. 23

Can multipath help with mobile hand-offs? If your phone uses both radios simultaneously, you needn’t experience any interruption. How should it balance traffic across dissimilar paths? 24 Wifi path: high loss rate, small RTT 3G path: low loss rate, large RTT

Multi-homed web sites (a) with classic hierarchical routing 25 Google.com AT&T other operators *.* “You can reach 12.* via me” “I’ll use AT&T for 12.*”

Multi-homed web sites (b) with redundancy, in case links fail 26 Google.com AT&T other operators *.* “You can reach 12.* via me” Level3 8.*.* “You can reach 8.* and via me” “I’ll use AT&T for 12.*, but if AT&T fails I can use Level3 to reach ”

Multi-homed web sites (c) with load balancing across the gateway machines 27 Google.com AT&T other operators *.* “You can reach 12.* via me” Level3 8.*.* “You can reach 8.* and to via me” 012 “Users: for google.com, pick randomly between ,.1 and.2”

Multi-homed web sites (c) with load balancing across the gateway machines 28 Google.com AT&T other operators *.* “You can reach 12.* via me, but is costly” Level3 8.*.* “You can reach 8.* and to via me, but is costly” 012 “Path to 2 is costly” “I’ll use AT&T for and , and Level3 for , but if either fails I can use the other” “Users: for google.com, pick randomly between ,.1 and.2” “Path to 0 is costly” “You can reach 12.* via me” “You can reach 8.* and to via me”

Multi-homed web sites The limited resources are the memory and CPU needed by routers to remember specific paths and costs. It can take hours or days for path choices to stabilize. 29 Google.com AT&T other operators g *.* “You can reach 12.* via me, but is costly” Level3 h 8.*.* “You can reach 8.* and to via me, but is costly” 012 “Path 2 is costly” “I’ll use AT&T for and , and Level3 for , but if either fails I can use the other” “Users: for google.com, pick randomly between to ” “Path 0 is costly”

Multi-homed web sites (d) with Kelly+Voice multipath TCP to balance traffic Mb/s 2 50Mb/s 4 25Mb/s

Multi-homed web sites (d) with Kelly+Voice multipath TCP to balance traffic Mb/s 2 33Mb/s 1 33Mb/s 4 25Mb/s

Multi-homed web sites (d) with Kelly+Voice multipath TCP to balance traffic Mb/s 2 25Mb/s 2 25Mb/s 4 25Mb/s The total capacity, 200Mb/s, is shared out evenly between all 8 flows.

Multi-homed web sites (d) with Kelly+Voice multipath TCP to balance traffic Mb/s 2 22Mb/s 3 22Mb/s 4 22Mb/s The total capacity, 200Mb/s, is shared out evenly between all 9 flows. It’s as if they were all sharing a single 200Mb/s link. The two links can be said to form a 200Mb/s pool.

Multi-homed web sites (d) with Kelly+Voice multipath TCP to balance traffic Mb/s 2 20Mb/s 4 20Mb/s 4 20Mb/s The total capacity, 200Mb/s, is shared out evenly between all 10 flows. It’s as if they were all sharing a single 200Mb/s link. The two links can be said to form a 200Mb/s pool.

Load-balancing in data centers An obvious way to balance load is to pick randomly from available paths for each TCP flow. This balances traffic nicely, as long as there are enough flows. 35

Load-balancing in data centers An obvious way to balance load is to pick randomly from available paths for each TCP flow. This balances traffic nicely, as long as there are enough flows. But if there are fewer flows, there may be collisions and wasted capacity. 36

Can a data center be made to behave like a simple easily-managed resource pool? Can this be achieved across a range of traffic patterns? For data centers of different sizes? 37

The spectrum of Internet research 38 blue-sky research incremental improvement ?

The spectrum of Internet research 39 blue-sky research incremental improvement ? smtp, http, rtp tcp, udp, sctp IP ethernet, wifi, atm fibre, cat5, wireless The Internet’s standards for carrying data are an hourglass. This has made it easy to build new new things.

The spectrum of Internet research 40 slow death by a thousand fixes blue-sky research incremental improvement ? sip sdp ntp rtcp tcp sctp mpls ecmp shim6 leap diameter dhcp radius eap stun isis ospf diffserv arp l2tp ipsec gsmp bgp netconf dpi xcp The Internet’s standards for control are an accumulation of fixes to specific problems. atm

The spectrum of Internet research 41 slow death by a thousand fixes undeployable without starting again from scratch blue-sky research incremental improvement ? The Power of Legacy

The spectrum of Internet research 42 slow death by a thousand fixes undeployable without starting again from scratch blue-sky research incremental improvement radical long- term change via small re- purposable steps

The spectrum of Internet research End-system multipath congestion control will succeed because it is a re-purposable interface for solving many different problems — so it can become the ‘narrow waist’ of the Internet’s control architecture. “Network utility maximization” is mathematician’s shorthand for this. 43 slow death by a thousand fixes undeployable without starting again from scratch blue-sky research incremental improvement radical long-term change via small re-purposable steps

Multipath is Packet Switching 2.0, and multipath congestion control is TCP 2.0. Two circuitsA link Two separate links A pool of links 44

How did the theoretical results of Han et al. and Kelly+Voice help? (beyond the fundamental idea of distributed network utility maximization—the idea that end-systems can by themselves manage to allocate the Internet’s resources sensibly, in many different multipath settings) What extra work did we need to do, to sell multipath? 45

The big theoretical result is ‘local stability of a fluid model of multipath congestion control’. Internet engineers have tried load-sensitive routing before, and observed route flap, and decided it’s unsafe. We can point to the theory and say “The maths guarantees our multipath TCP is safe”. 46 The same theory says the current Internet is unstable, and engineers do not believe this. At low levels of aggregation (e.g. access links, which are the most congested part of today’s Internet), the fluid model is misleading. This theoretical result is unhelpful, on two counts.

Why does the fluid model fail? The Kelly+Voice algorithm puts all its traffic on the least congested path. The noisy nature of congestion feedback makes it difficult to estimate congestion levels, leading to bistability. But the fluid limit (the average of many bistable flows) is stable! ▼ ▼ ▼▼▼▼ ▼ ▼▼ ▲ ▲▲▲ ▲ ▲ ▲ ▲ ▲ ▲▲ ▲▲ ▼▼▼▼▼ ▼ ▼ random drops random drops The top link is so congested! I better switch to the bottom link. Now the bottom link is more congested! loss rate 1% ▲ ▲

What changes did we need, to make it incrementally deployable? The Kelly+Voice algorithm makes you shift all your traffic onto the least-congested path, in this case 3G. Do you end up with 141pkt/s (fair to other 3G users)? Or with 707pkt/s (what you would get without multipath)? 48 wifi path: 4% loss, 10ms RTT 3G path: 1% loss, 100ms RTT, single-path TCP would get 707pkt/s, single-path TCP would get 141pkt/s

Conclusion End-system multipath congestion control will be the biggest change to the architecture of the Internet since packet switching and TCP. Network utility maximization is a goal which in itself is moot. But network algorithms which can maximize arbitrary utilities are necessarily rich enough to solve any control problem. Interesting new mathematical models may arise when you try to make theory work. 49

50 What should mathematicians know about the Internet? Cool stuff is better than correctness. What sort of maths makes the cool stuff work? Under the hood of BitTorrent, Bram Cohen, 2005 The Internet is barely manageable, and it barely works. What sort of maths helps us make it autonomic? End-to-end arguments in system design, Saltzer, Reed, Clark, 1981 Why the Internet only just works, Handley, 2006 No one can tell you what the Internet is for. What sort of maths gives us tools, not solutions?

How does TCP congestion control work? Maintain a congestion window w. Increase w for each ACK, by 1/ w Decrease w for each drop, by w/ 2 51

How does MPTCP congestion control work? Maintain a congestion window w r, one window for each path, where r ∊ R ranges over the set of available paths. Increase w r for each ACK on path r, by Decrease w r for each drop on path r, by w r / 2 52

How does MPTCP congestion control work? Maintain a congestion window w r, one window for each path, where r ∊ R ranges over the set of available paths. Increase w r for each ACK on path r, by Decrease w r for each drop on path r, by w r / 2 We want to shift traffic away from congestion. To achieve this, we increase windows in proportion to their size. 53

How does MPTCP congestion control work? Maintain a congestion window w r, one window for each path, where r ∊ R ranges over the set of available paths. Increase w r for each ACK on path r, by Decrease w r for each drop on path r, by w r / 2 MPTCP puts an amount of flow on path r proportional to 1/p r 54 (whereas Kelly+Voice put all the flow on the least-congested paths). We do this so that we send more probe traffic, so we react faster to changes.

How does MPTCP congestion control work? Maintain a congestion window w r, one window for each path, where r ∊ R ranges over the set of available paths. Increase w r for each ACK on path r, by Decrease w r for each drop on path r, by w r / 2 Take no more than TCP would, at any potential bottleneck S: look at the best that a single-path TCP could get, and compare to what I’m getting. 55