Why did it rain this morning?. Why are you at this lecture?

Slides:



Advertisements
Similar presentations
A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.
Advertisements

Bulk-Data Metanet: Virtualization by Example Sergey Gorinsky Applied Research Laboratory Applied Research Laboratory Department of Computer Science and.
Data Center Networking with Multipath TCP
Improving Datacenter Performance and Robustness with Multipath TCP
PATH SELECTION AND MULTIPATH CONGESTION CONTROL BY P. KEY, L. MASSOULIE, AND D. TOWSLEY R02 – Network Architectures Michaelmas term, 2013 Ulku Buket Nazlican.
1 EP2210 Fairness Lecture material: –Bertsekas, Gallager, Data networks, 6.5 –L. Massoulie, J. Roberts, "Bandwidth sharing: objectives and algorithms,“
Restless bandits and congestion control Mark Handley, Costin Raiciu, Damon Wischik UCL.
Interconnect throughput modeling. Important network performance metrics Throughput – Point to point (link bandwidth + end host software overheads) – Aggregate.
1 © 2013 Cisco and/or its affiliates. All rights reserved. An Improved Hop-by-hop Interest Shaper for Congestion Control in Named Data Networking Yaogong.
MAC3: Medium Access Coding & Congestion Control Devavrat Shah (MIT) Damon Wischik (UCL)
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.
DYNAMIC POWER ALLOCATION AND ROUTING FOR TIME-VARYING WIRELESS NETWORKS Michael J. Neely, Eytan Modiano and Charles E.Rohrs Presented by Ruogu Li Department.
Mathematical models of the Internet Frank Kelly Hood Fellowship Public Lecture University of Auckland 3 April 2012.
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.
CPSC Topics in Multimedia Networking A Mechanism for Equitable Bandwidth Allocation under QoS and Budget Constraints D. Sivakumar IBM Almaden Research.
Farsighted Congestion Controllers Milan Vojnović Microsoft Research Cambridge, United Kingdom Collaborators: Dinan Gunawardena (MSRC), Peter Key (MSRC),
Kuang-Hao Liu et al Presented by Xin Che 11/18/09.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Multimedia Streaming in Dynamic Peer-to-Peer Systems and Mobile Wireless.
A Game Theoretic Approach to Provide Incentive and Service Differentiation in P2P Networks John C.S. Lui The Chinese University of Hong Kong Joint work.
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
DDoS Defense by Offense Presented by: Matthew C.H. Ma Damon Chan.
Pricing What Can Pricing Do In Wireless Networks? Jianning Mai and Lihua Yuan
Network Bandwidth Allocation (and Stability) In Three Acts.
Congestion Control and Resource Allocation
Aleksandar Kuzmanovic & Edward W. Knightly A Performance vs. Trust Perspective in the Design of End-Point Congestion Control Protocols.
A Game Theoretic Approach to Provide Incentive and Service Differentiation in P2P Networks Richard Ma, Sam Lee, John Lui (CUHK) David Yau (Purdue)
Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks Dah-Ming Chiu and Raj Jain Presented by Aaron Ballew (slides.
UCB Improvements in Core-Stateless Fair Queueing (CSFQ) Ling Huang U.C. Berkeley cml.me.berkeley.edu/~hlion.
Second year review Resource Pooling Damon Wischik, UCL.
Seyed Mohamad Alavi, Chi Zhou, Yu Cheng Department of Electrical and Computer Engineering Illinois Institute of Technology, Chicago, IL, USA ICC 2009.
Called as the Interval Scheduling Problem. A simpler version of a class of scheduling problems. – Can add weights. – Can add multiple resources – Can ask.
Advanced Network Architecture Research Group 2001/11/149 th International Conference on Network Protocols Scalable Socket Buffer Tuning for High-Performance.
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.
L14. Fair networks and topology design D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
Networks Research Group Prof. Mark Handley Department of Computer Science.
Rensselaer Polytechnic Institute Rajagopal Iyengar Combinatorial Approaches to QoS Scheduling in Multichannel Wireless Systems Rajagopal Iyengar Rensselaer.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
Fair Class-Based Downlink Scheduling with Revenue Considerations in Next Generation Broadband wireless Access Systems Bader Al-Manthari, Member, IEEE,
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
FAIR CHARGES FOR INTERNET CONGESTION Damon Wischik Statistical Laboratory, Cambridge Electrical Engineering, Stanford
Congestion Control - Supplementary Slides are adapted on Jean Walrand’s Slides.
Models of multipath resource allocation Damon Wischik, UCL.
Congestion control for Multipath TCP (MPTCP) Damon Wischik Costin Raiciu Adam Greenhalgh Mark Handley THE ROYAL SOCIETY.
Congestion Control in CSMA-Based Networks with Inconsistent Channel State V. Gambiroza and E. Knightly Rice Networks Group
Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Design and Implementation.
Congestion Control for High Bandwidth-Delay Product Networks D. Katabi (MIT), M. Handley (UCL), C. Rohrs (MIT) – SIGCOMM’02 Presented by Cheng.
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.
Research Unit in Networking - University of Liège A Distributed Algorithm for Weighted Max-Min Fairness in MPLS Networks Fabian Skivée
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
Network teleology Damon Wischik
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Real-Time Networks – WAN Packet Scheduling.
Queueing in switched networks Damon Wischik, UCL thanks to Devavrat Shah, MIT TexPoint fonts used in EMF. Read the TexPoint manual before you delete this.
NC STATE UNIVERSITY / MCNC Protecting Network Quality of Service Against Denial of Service Attacks Douglas S. Reeves  S. Felix Wu  Fengmin Gong Talk:
Cardinal Utility Analysis
D. AriflerCMPE 548 Fall CMPE 548 Routing and Congestion Control.
Topics discussed in this section:
Constraint-Based Routing
Improving Datacenter Performance and Robustness with Multipath TCP
Improving Datacenter Performance and Robustness with Multipath TCP
Scheduling Algorithms in Broad-Band Wireless Networks
FAST TCP : From Theory to Experiments
EE 122: Lecture 7 Ion Stoica September 18, 2001.
Hemant Kr Rath1, Anirudha Sahoo2, Abhay Karandikar1
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’
Richard Ma, Sam Lee, John Lui (CUHK) David Yau (Purdue)
Congestion control and the P2P value chain
Presentation transcript:

Why did it rain this morning?

Why are you at this lecture?

Why did TCP give me throughput √2/( RTT √p)?

τελος teleology The doctrine or study of ends or final causes, especially as related to the evidences of design or purpose in nature; also transf. such design as exhibited in natural objects or phenomena.

§5. The principles of resource allocation Damon Wischik, UCL Devavrat Shah, MIT

What do I mean by resource allocation? In a data network, how much throughput should each user get? In a data center, whose requests will I prioritize and whose will be dropped? In a multi-tenanted data center, how many tenants can I fit? Which drivers are on the roads? How much should the state pay for health care? Network neutrality

Why is it worth learning principles of resource allocation? 1.When you design a networked system, you will have to think about resource allocation sooner or later. NSDI 2011 posters NSDI 2011 papers directly concerned indirectly concerned not yet concerned with resource allocation

Why is it worth learning principles of resource allocation? 2.It’s hard to get right, except in simple cases. Max-min fairness Jain’s fairness index Average throughput Marginal benefit Incentive compatibility Identity issues: bundled users, Sybil attacks

Why is it worth learning principles of resource allocation? 3.There is a systematic way to formulate the problem, and a systematic family of solutions. Max-min fairness Jain’s fairness index Average throughput Marginal benefit Incentive compatibility Identity issues: bundled users, Sybil attacks

Why is it worth learning principles of resource allocation? 4.It is the only general solution we know. TCP bandwidth sharing Admission control in a distributed hash table Wireless interference

Why is it worth learning principles of resource allocation? 5.Once you understand the systematic principle, you can apply it ‘horizontally’ to many systems. Which bits of TCP are generic? If I apply TCP-style resource allocation to DHT admission control, what do I get? Which bits of TCP are the systems tweaks that make it actually work in practice? “Design, implementation and evaluation of congestion control for multipath TCP”, NSDI Wischik, Raiciu, Greenhalgh, Handley. This was 75% cranking the ‘resource allocation’ handle, 25% systems inspiration.

What are the principles of resource allocation?

Principle 1. Every networked system has a capacity region. The capacity region is the set of per-user traffic rates than can be carried.

Principle 2. There is a systematic way to decide how resources should be allocated, given the capacity region. Every one of these concepts is a special case of utility maximization, with the weighted α-fair utility function.

“The greatest happiness of the greatest number is the foundation of morals and legislation.” Jeremy Bentham, 1748–1832

Principle 3. There is a systematic family of algorithms for reaching any such allocation. TCP behaves as if the network as a whole were trying to solve an optimization problem.

Principle 3. There is a systematic family of algorithms for reaching any such allocation. Every sensible goal in allocating network resources can be written as an optimization problem (namely, to maximize weighted α- fairness). The simplest way to solve an optimization problem is gradient ascent. TCP and backpressure (another type of congestion control) are both examples of gradient ascent. They correspond to different ways of writing out the optimization constraints.