We don’t have to decide fairness ourselves intent: build consensus then Informationaldraft-briscoe-tsvwg-relax-fairness-00.txt Bob Briscoe Chief Researcher,

Slides:



Advertisements
Similar presentations
End-host Perspectives on Congestion Management Murari Sridharan CONEX BOF, IETF 76, Hiroshima.
Advertisements

The cost of freedom Bob Briscoe Chief Researcher, BT Group and UCL Dec 2006.
Internet Capacity Sharing Architecture Design Team IETF-80 Mar 2011.
CSE534 – Fundamentals of Computer Networks Lecture 16: Traffic Shaping + Net Neutrality Created by P. Gill Spring 2014, updated Spring 2015.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
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.
The Tension Between High Video Rate and No Rebuffering Te-Yuan (TY) Huang Stanford University IRTF Open 87 July 30th, 2013 Joint work Prof.
Why are all architectural problems from 2000 still unsolved? How would we know we had solved socio-economic problems anyway? Bob Briscoe Chief Researcher,
1 Modeling and Emulation of Internet Paths Pramod Sanaga, Jonathon Duerig, Robert Ricci, Jay Lepreau University of Utah.
1 EE 627 Lecture 11 Review of Last Lecture UDP & Multimedia TCP & UDP Interaction.
Staying focused on the big unsolved problems e.g. resource accountability Bob Briscoe Chief Researcher, BT Group Sep 2008.
© 2008 Nokia V1-Filename.ppt / YYYY-MM-DD / Initials 1 Dealing with P2P Traffic in an Operator Network: State-of-the-Art Hannes Tschofenig Marcin Matuszewski.
Network Neutrality 4/21/20111Harvard Bits. 4/21/2011Harvard Bits2.
Combining Multipath Routing and Congestion Control for Robustness Peter Key.
Deconfusing Internet traffic microeconomics Bob Briscoe Chief Researcher, BT Group Oct 2008.
10th Workshop on Information Technologies and Systems 1 A Comparative Evaluation of Internet Pricing Schemes: Smart Market and Dynamic Capacity Contracting.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
FIREWALL TECHNOLOGIES Tahani al jehani. Firewall benefits  A firewall functions as a choke point – all traffic in and out must pass through this single.
Yangon, Myanmar, November 2013 Broadband price regulation Matthew O’Rourke Partner, Incyte Consulting
1 Proposed Additional Use Cases for Congestion Exposure draft-mcdysan-conex-other-usecases-00.txt Dave McDysan.
Sorting out Internet resource sharing Bob Briscoe Chief Researcher BT Group Apr 2008.
Controlling Internet Quality with Price Market Managed Multi-service Internet Bob Briscoe BTexact Research, Edge Lab, University College London & M3I Technical.
Peer-to-peer (p2p) value & cost Bob Briscoe Chief Researcher BT Group Sep 2008.
Collective delusions behind how capacity gets shared Bob Briscoe with Toby Moncaster & Lou Burness presented by Dirk Trossen Jan 2008.
L14. Fair networks and topology design D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
Social media strategy and planning MARK 490 Week 4.
ConEx Concepts and Uses Toby Moncaster John Leslie (JLC) Bob Briscoe (BT) Rich Woundy (ComCast) draft-moncaster-conex-concepts-uses-01.
Networked & Distributed Systems TCP/IP Transport Layer Protocols UDP and TCP University of Glamorgan.
Beyond Best-Effort Service Advanced Multimedia University of Palestine University of Palestine Eng. Wisam Zaqoot Eng. Wisam Zaqoot November 2010 November.
Internet resource sharing: a way forward? Bob Briscoe Chief Researcher, BT May 2009 This work is partly funded by Trilogy, a research project supported.
Controlling Internet Quality with Price Market Managed Multiservice Internet Bob Briscoe BT Research, Edge Lab, University College London & M3I Technical.
CP Summer School Modelling for Constraint Programming Barbara Smith 2. Implied Constraints, Optimization, Dominance Rules.
Congestion control for Multipath TCP (MPTCP) Damon Wischik Costin Raiciu Adam Greenhalgh Mark Handley THE ROYAL SOCIETY.
Byte and Packet Congestion Notification draft-briscoe-tsvwg-byte-pkt-mark-01.txt draft-briscoe-tsvwg-byte-pkt-mark-01.txt Bob Briscoe, BT & UCL IETF-70.
Byte and Packet Congestion Notification draft-briscoe-tsvwg-byte-pkt-mark-00.txt draft-briscoe-tsvwg-byte-pkt-mark-00.txt Bob Briscoe, BT & UCL IETF-69.
Re’Arch 2008 Policing Freedom… to use the Internet Resource Pool Arnaud.Jacquet, Bob.Briscoe, Toby.Moncaster December
1 Measuring Congestion Responsiveness of Windows Streaming Media James Nichols Advisors: Prof. Mark Claypool Prof. Bob Kinicki Reader: Prof. David Finkel.
Congestion exposure BoF candidate protocol: re-ECN Bob Briscoe Chief Researcher, BT Nov 2009 This work is partly funded by Trilogy, a research project.
© British Telecommunications plc 1 nice traffic management without new protocols Bob Briscoe Chief Researcher, BT Oct 2012.
Some questions about multipath Damon Wischik, UCL Trilogy UCL.
DCCP: Issues From the Mailing List Sally Floyd, Eddie Kohler, Mark Handley, et al. DCCP WG March 4, 2004.
Unconditional localisation? Bob Briscoe Response to ALTO BoF Jul 2008.
Network Management has always been and always will be essential to the Internet Testimony of George Ou Former Network Engineer FCC.
Solving this Internet resource sharing problem... and the next, and the next Bob Briscoe Chief Researcher BT Group (& UCL) Lou Burness, Toby Moncaster,
Flow rate fairness dismantling a religion draft-briscoe-tsvarea-fair-01.pdf Bob Briscoe Chief Researcher, BT Group IETF-68 tsvwg Mar 2007 status: individual.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
Explicit Allocation of Best-Effort Service Goal: Allocate different rates to different users during congestion Can charge different prices to different.
AARNet Copyright Internet Charging and Traffic Management Workshop QUT, Brisbane February 4 th & 5 th, 2008.
Incentives Alignment Whitepaper Progress since Athens.
Network Coding and Reliable Communications Group Modeling Network Coded TCP Throughput: A Simple Model and its Validation MinJi Kim*, Muriel Médard*, João.
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
Byte and Packet Congestion Notification draft-briscoe-tsvwg-byte-pkt-mark-02.txt draft-briscoe-tsvwg-byte-pkt-mark-02.txt Bob Briscoe, BT & UCL IETF-71.
Performance Limitations of ADSL Users: A Case Study Matti Siekkinen, University of Oslo Denis Collange, France Télécom R&D Guillaume Urvoy-Keller, Ernst.
Lecture 17 Page 1 Advanced Network Security Network Denial of Service Attacks Advanced Network Security Peter Reiher August, 2014.
Thoughts on the Evolution of TCP in the Internet Sally Floyd PFLDnet 2004 February 16, 2004.
IB Business & Management
Constructing An Effective Statutory & Regulatory Framework for Broadband Networks Phoenix Center Symposium December 1, 2005 Disclaimer: Views presented.
Flow rate fairness dismantling a religion draft-briscoe-tsvarea-fair-00.pdf Bob Briscoe Chief Researcher, BT Group PFLDnet Feb 2007.
The Case against Microsoft. © 2004 Pearson Addison-Wesley. All rights reserved12-2.
Net Neutrality: Discrimination, Competition, and Innovation in the UK and US Alissa Cooper and Ian Brown ACM Transactions on Internet Technology, 15(1):
Net Neutrality and Quality of Service. OVERVIEW Transparency and more strict regulation IAS versus specialized services NN and monitoring of overall IAS.
Impact of New CC on Cross Traffic
Internet Economics perspective on Accounting & Billing
John Horrocks Quality of Service John Horrocks
Bob Briscoe, BT Murari Sridharan, Microsoft IETF-84 ConEx Jul 2012
Migration Strategies – Business Desktop Deployment (BDD) Overview
Scheduling in Wireless Communication Systems
Internet Congestion Control Research Group
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’
DCCP: Issues From the Mailing List
Presentation transcript:

we don’t have to decide fairness ourselves intent: build consensus then Informationaldraft-briscoe-tsvwg-relax-fairness-00.txt Bob Briscoe Chief Researcher, BT Toby Moncaster & Lou Burness IETF-70 tsvarea Dec 2007

2 shifting IETF focus from fairness to accountability this talk primarily about the technical problem fairness is run-time, IETF is design-time design-timerun-time problemIETF doesn’t, can’t and shouldn’t decide fairness solution process IETF’s role: enable accountability for congestion users, apps & operators can (optionally) make principled fairness choices IETF/IRTF can truly meet dynamic app req’s and minimise congestion best metric: congestion volume

3 fair bottleneck bit-rate? two incompatible partial worldviews IETF aware that fairness should be per user per flow is reasonable approx’n if users open similar no’s of flows ‘flow rate equality’‘volume accounting’ per flowper user instantaneousover time

4 base example different activity factors 2Mbps access each 80 users of attended apps 20 users of unattended apps usage typeno. of users activity factor ave.simul flows /user TCP bit rate /user vol/day (16hr) /user traffic intensity /user attended8010%=357kbps257MB35.7kbps unattended20100%=357kbps2570MB357kbps x1x10 time flow activity rate 10Mbps volume over peak period [B/hr] instantaneous equivalent: traffic intensity [b/s] = (bit rate when active [b/s]) x (activity factor [%])

5 realistic numbers? there are elephants in the room number of TCP connections Web 1.1 : 2 BitTorrent: ~100; see graph details suppressed: users on spectrum of mixes of the two types utilisation never 100% but near enough during peak period on DSL, upstream constrains most p2p apps other access (fixed & wireless) more symmetric

6 flow activity compounding activity factor & multiple flows 80 users of attended apps 20 users of unattended apps 2Mbps access each no-one is saying more volume is unfair but volume accounting says it’s fairer if heavier users get less rate during peak period usage typeno. of users activity factor ave.simul flows /user TCP bit rate /user vol/day (16hr) /user traffic intensity /user attended8010%210kbps7.1MB1kbps unattended20100%100500kbps3.6GB500kbps x50x500 rate time 10Mbps

7 flow activity most users hardly benefit from bottleneck upgrade 80 users of attended apps 2Mbps access each 20 users of unattended apps usage typeno. of users activity factor ave.simul flows /user TCP bit rate /user vol/day (16hr) /user traffic intensity /user attended804%2 10  40kbps12MB 1  1.6kbps unattended20100%  2Mbps14GB 0.5  2Mbps x50 x1250 rate time before after upgrade data limited flows want rate more than volume 10  40Mbps all expect 30M / 100 = 300k more but most only get 30k more

8 volume accounting isn’t the answer either fairer if heavy users get less bottleneck flow rate than light users but heavy & light only defined by volume during ‘the peak period’ effectively treats congestion very vaguely as –0 everywhere off-peak –1 everywhere on-peak blind to whether the same volume causes extreme congestion or none degree of freedom‘flow rate equality’‘volume accounting’ multiple flows  activity factor  congestion variation  enforcement of either goal is a separate issue (see later) message so far: 2 worldviews both claim same goal (fairness) each strong over part of the problem space but incompatible: one wants equal, the other wants unequal flow rates

9 so what? fairness can’t be such a problem, the Internet works we all have enough most of the time, even if A has more than B we like to think this is due to IETF protocols next few slides cast doubt on this complacency

10 10  40Mbps concrete consequence of unfairness #1 higher investment risk recall but ISP needs everyone to pay for 300k more if most users unhappy with ISP A’s upgrade they will drift to ISP B who doesn’t invest competitive ISPs will stop investing... all expect 30M / 100 = 300k more but most only get 30k more

11...but we still see enough investment main reasons subsidies (e.g. Far East) –light users get ‘enough’ if more investment than they pay for weak competition (e.g. US) –operators still investing because customers will cover the costs throttling heavy users at peak times (e.g. Europe) –overriding TCP’s rate allocation

12 concrete consequence of unfairness #2 trend towards bulk enforcement as access rates increase attended apps leave access unused more of the time anyone might as well fill the rest of their own access capacity operator choices: a)either continue to provision sufficiently excessive shared capacity b)or introduce tiered volume limits etc IETF needs to recognise & address the implications bulk policing prevalent in best efforts architecture (cf. Diffserv) e.g. should we distinguish a policer drop from a congestion drop?

13 concrete consequence of unfairness #3 networks making choices for users networks hit a problem once they start throttling they could throttle all a heavy user’s traffic indiscriminately –encourages the user to self-throttle least valued traffic –but many users have neither the software nor the expertise many networks infer what the user would do using deep packet inspection (DPI) to identify apps even if intentions honourable confusable with attempts to discriminate against certain apps user’s priorities are task-specific, not app-specific customers understandably get upset when ISP guesses wrongly IETF needs to recognise & address the underlying need here feature creep into network slows innovation (e2e principle) better ways to fit traffic within limits (e.g. user/app-controlled endpoint s/w)

14 the problem IETF doesn’t really decide fairness whatever protocols designed to do, they are being used unfairly IETF can’t really decide fairness design-time body can’t control run-time degrees of freedom IETF shouldn’t decide fairness shouldn’t prejudge fair-use policy agreed between user & ISP –whether TCP, max-min, proportional or cost fairness

15 what does the IETF need to do? average rates – a run-time issue introduce congestion accountability framework* give principled effective fairness control to users, apps & operators offer an evolvable alternative to current kludges (DPI) coexist with null enforcement transport dynamics – the design-time issue IETF/IRTF protocols can truly satisfy dynamic application requirements while minimising congestion rather than not really meeting app reqs, by being over-constrained * TBA (Lou Burness +) working towards BoF, not just about fairness, but also congestion collapse & DDoS re-ECN / re-feedback one proposed solution

16 relaxing our transport design constraints currently we are trying to satisfy demanding app reqs constrained by staying not ‘much’ more demanding than TCP resulting protocols are ‘over-constrained’ and not app-developer’s first choice once the big average rate fairness trade-offs move to run-time IETF/IRTF can judge which proposed transports better trade-off: –achieving the task effectively and –minimising unnecessary congestion to others during dynamics focus on the demanding dynamics questions: when is a fast start fast enough? or too fast? [Limited slow start, etc] how quickly should hi-speed transports allow in new flows? [HighSpeed TCP, FAST, etc] how smooth can a transport be before it’s effectively unresponsive? [TFRC, proprietary media players, etc] what’s the minimum congestion response of an aggregate? [PWE3, CAPWAP]

17 proposed core of solution congestion harm metric partial insight from volume accounting but rather than only counting bytes during peak count bit rate weighted by congestion, over time result is easy to measure per flow or per user –volume of bytes discarded (or ECN marked) termed congestion volume a precise instantaneous measure of harm, counted over time a measure for fairness over any timescale and a precise measure of harm during dynamics loss (marking) fraction p(t) user 1 user 2 x 1 (t) x 2 (t) bit rate

18 summary shift IETF focus from fairness to accountability problems will only get worse – driven by access rate increases design-timerun-time problemIETF doesn’t, can’t and shouldn’t decide fairness users, apps & operators actually control fairness solution process IETF’s role: enable accountability for congestion users, apps & operators can (optionally) make principled fairness choices IETF/IRTF can truly meet dynamic app req’s and minimise congestion IETF protocols become first choice for demanding apps best metric: congestion volume

we don’t have to decide fairness ourselves draft-briscoe-tsvwg-relax-fairness-00.txt Q&A

20 context 3.a protocol solution: re-ECN draft-briscoe-tsvwg-re-ecn-04.txt on hold while build consensus on the problem & requirements other solutions welcome 0.dismantling flow rate fairness draft-briscoe-tsvarea-fairness-02.pdf too polemical for IETF consensus let this draft die – archived on my Web site and ACM CCR paper 1.the problem draft-briscoe-tsvwg-relax-fairness-00.txt IETF doesn’t decide fairness – this talk 2.solution requirements TBA not pushing technical solution(s) at steps 1 & 2 aimed more towards a ‘congestion accountability’ BoF

21 typical p2p file-sharing apps active TCP connections altogether environment Azureus BitTorrent app ADSL+ 448kb upstream OS: Windows XP Pro SP2 1 of 3 torrents shown ~45 TCPs per torrent but ~40/torrent active

22 access growth just gets filled Distribution of customers’ daily traffic into & out of a Japanese ISP (Feb 2005) (5GB/day equivalent to 0.46Mbps if continuous) Changing technology shares of Japanese access market (9%, 2.5GB) (4%, 5GB) 100Mbps fibre to the home (FTTH 46.4%) digital subscriber line (DSL 53.6%) Courtesy of Kenjiro Cho et al The Impact and Implications of the Growth in Residential User-to-User Traffic, SIGCOMM’06

23 concrete consequence of unfairness #4 starvation during anomalies & emergencies fairness concerns become acute during stress more traffic or less capacity than expected if fairness decided at run-time common policy probably ‘you get what you paid for’ concern: unsavoury for emergencies all flows should make some progress, not just the rich agree with concern, but current approach not right video downloads get 50x rate of emergency messages?* policy decisions for users, ISPs, regulators, not IETF e.g. ISP might freeze paying to override congestion limits * Henchung earthquake, 26 Dec ’06, see I-D

24 accountability metric congestion volume precisely measures instantaneous harm from flow rate dynamics rather than just average flow rate time, t flow rate, x i at resource x1x1 x2x2 congestion, p congestion bit rate, p x i v1v1 v2v2 area is bits lost/marked, ie. congestion volume, v i =  p x i dt x 1 + x 2 capacity