Re’Arch 2008 Policing Freedom… to use the Internet Resource Pool Arnaud.Jacquet, Bob.Briscoe, Toby.Moncaster December 9 2008.

Slides:



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

Computer Networking Lecture 20 – Queue Management and QoS.
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
William Stallings Data and Computer Communications 7 th Edition Chapter 13 Congestion in Data Networks.
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Copyright 2010 Cisco Press & Priscilla Oppenheimer.
© 2006 Cisco Systems, Inc. All rights reserved. Module 4: Implement the DiffServ QoS Model Lesson 4.7: Introducing Traffic Policing and Shaping.
Jaringan Komputer Lanjut Traffic Management Aurelio Rahmadian.
CS640: Introduction to Computer Networks Mozafar Bag-Mohammadi Lecture 3 TCP Congestion Control.
Chapter 10 Congestion Control in Data Networks1 Congestion Control in Data Networks and Internets COMP5416 Chapter 10.
“ Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks ”
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.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Dynamic Internet Congestion with Bursts Stefan Schmid Roger Wattenhofer Distributed Computing Group, ETH Zurich 13th International Conference On High Performance.
Source-Adaptive Multilayered Multicast Algorithms for Real- Time Video Distribution Brett J. Vickers, Celio Albuquerque, and Tatsuya Suda IEEE/ACM Transactions.
Networks: Congestion Control1 Congestion Control.
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168)
Promoting the Use of End-to- End Congestion Control in the Internet Sally Floyd and Kevin Fall Presented by Scott McLaren.
Computer Networking Lecture 17 – Queue Management As usual: Thanks to Srini Seshan and Dave Anderson.
Using Prices to Allocate Resources at Access Points Jimmy Shih, Randy Katz, Anthony Joseph One Administrative Domain Access Point A Access Point B Network.
Promoting the Use of End-to-End Congestion Control & Random Early Detection of Network Congestion.
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
10th Workshop on Information Technologies and Systems 1 A Comparative Evaluation of Internet Pricing Schemes: Smart Market and Dynamic Capacity Contracting.
1 Proposed Additional Use Cases for Congestion Exposure draft-mcdysan-conex-other-usecases-00.txt Dave McDysan.
Efficient Protocols for Massive Data Transport Sailesh Kumar.
CS Spring 2011 CS 414 – Multimedia Systems Design Lecture 23 - Multimedia Network Protocols (Layer 3) Klara Nahrstedt Spring 2011.
Adaptive Packet Marking for Providing Differentiated Services in the Internet Wu-chang Feng, Debanjan Saha, Dilip Kandlur, Kang Shin October 13, 1998.
Quality of Service (QoS)
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Oppenheimer.
Univ. of TehranAdv. topics in Computer Network1 Advanced topics in Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
Internet resource sharing: a way forward? Bob Briscoe Chief Researcher, BT May 2009 This work is partly funded by Trilogy, a research project supported.
Differentiated Services for the Internet Selma Yilmaz.
Congestion control for Multipath TCP (MPTCP) Damon Wischik Costin Raiciu Adam Greenhalgh Mark Handley THE ROYAL SOCIETY.
Covilhã, 30 June Atílio Gameiro Page 1 The information in this document is provided as is and no guarantee or warranty is given that the information is.
Peter Key Cambridge UK joint work with Richard Gibbens, Statistical Laboratory, Cambridge Uni. UK The.
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
Scavenger performance Cern External Network Division - Caltech Datagrid WP January, 2002.
1 Congestion Control Computer Networks. 2 Where are we?
Congestion exposure BoF candidate protocol: re-ECN Bob Briscoe Chief Researcher, BT Nov 2009 This work is partly funded by Trilogy, a research project.
Queueing and Active Queue Management Aditya Akella 02/26/2007.
The speed of sharing stretching Internet access Bob Briscoe Chief Researcher, BT Apr 2009 This work is partly funded by Trilogy, a research project supported.
Design for tussle Bob Briscoe Chief Researcher, BT Jun 2009 re-architecting the Internet.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 - Queuing and Basics of QoS.
Some questions about multipath Damon Wischik, UCL Trilogy UCL.
Solving this Internet resource sharing problem... and the next, and the next Bob Briscoe Chief Researcher BT Group (& UCL) Lou Burness, Toby Moncaster,
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
We used ns-2 network simulator [5] to evaluate RED-DT and compare its performance to RED [1], FRED [2], LQD [3], and CHOKe [4]. All simulation scenarios.
Receiver Driven Bandwidth Sharing for TCP Authors: Puneet Mehra, Avideh Zakor and Christophe De Vlesschouwer University of California Berkeley. Presented.
Explicit Allocation of Best-Effort Service Goal: Allocate different rates to different users during congestion Can charge different prices to different.
NC STATE UNIVERSITY / MCNC Protecting Network Quality of Service Against Denial of Service Attacks Douglas S. Reeves  S. Felix Wu  Fengmin Gong Talk:
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP Congestion Control.
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
Analysis of the increase and Decrease Algorithms for Congestion in Computer Networks Portions of the slide/figures were adapted from :
1 Lecture 15 Internet resource allocation and QoS Resource Reservation Protocol Integrated Services Differentiated Services.
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
Transmission Pricing Webinar 12 October Agenda for Webinar Introductions Purpose Potential Areas of Change – Overview –Revenue Proposal –Business.
QoS & Queuing Theory CS352.
Topics discussed in this section:
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Copyright 2010 Cisco Press & Priscilla Oppenheimer.
Queue Management Jennifer Rexford COS 461: Computer Networks
Bob Briscoe, BT Murari Sridharan, Microsoft IETF-84 ConEx Jul 2012
Congestion Control in Data Networks and Internets
The University of Adelaide, School of Computer Science
“Promoting the Use of End-to-End Congestion Control in the Internet”
Figure Areas in an autonomous system
Chapter 11. Frame Relay Background Frame Relay Protocol Architecture
Presentation transcript:

Re’Arch 2008 Policing Freedom… to use the Internet Resource Pool Arnaud.Jacquet, Bob.Briscoe, Toby.Moncaster December

December 9, 2008Policing Freedom1 Agenda  Architectural choices for policing usage  Design of a bulk congestion policer  Impact on traffic  Implications on congestion signals

December 9, 2008Policing Freedom2 Policing usage – state of affairs  Distributed resource control  Many parties involved in the outcome  Fair usage policies on broadband services  TechniquesAssumptions volume caps each packet has the same packet fair queuing single access bottleneck deep packet inspectionapplication type implies congestion  They limit flexibility to shift usage (over links and time) around the Internet resource pool, and prevent evolution towards more efficient rate adaptation

December 9, 2008Policing Freedom3 Policing usage – what to change  What matters is usage of scarce resources, as reflected by congestion  Each packet is accountable for the congestion it causes on its path  It is possible to monitor accountability of any collection of flows  For any accountable party, monitor and control  Congestion volume (rather than volume)  Congestion bit rate(rather than throughput)  Granularity of resource usage accountability  Not per flow (can open several in parallel)  Per customer, where there is a contractual relationship  Congestion pricing leads to dynamic prices   Congestion policing is the rationing version  To enforce such policies at the technical level, we need to consider control mechanisms (policing) and interfaces (signalling)

December 9, 2008Policing Freedom4 Architectural considerations  Policing is located at the 'enforcement point‘ where a customer attaches, rather than at network resources  Need for suitable congestion signalling  Only the overall traffic of each customer is policed: flow isolation would limit flexibility

December 9, 2008Policing Freedom5 Design different to ‘classic token bucket’ - still decides fate of each packet - only congested bits consume tokens - if not enough tokens, policer drops packet (alt. delay, charge..) - sanction can be gradual - for binary signals: policer sanction only marked packets w  Bulk congestion policer - s i p i s i, p i

December 9, 2008Policing Freedom6 Token consumed 0.3% · 0.3Mb/s = - 0.9kb/s 0.1% · 6 Mb/s = - 6.0kb/s - 6.9kb/s 6 Mb/s Acceptable Use Policy Fair usage is defined by a 'congestion volume' allowance: of 1GB per month That is equivalent to a constant congestion bit-rate of about 3kb/s Bit-rate is otherwise unlimited Token allocated + 3kb/s 0.3Mb/s 0.3% 0.1%

December 9, 2008Policing Freedom7 Throughput Congestion Cross-effects π p1p1 p2p2 p 1 p 2  The policer operates as a congestible resource  When congestion volume exceeds allowance, it introduces its own congestion signal π  … based on the congestion bit rate of the aggregate traffic π y TCP =k/√p y policed =w/p

December 9, 2008Policing Freedom8 Throughput Congestion pipi y i (p i ) unpoliced Cross-effect on responsive flow  Flow i experiences congestion p i  Other flows through same policer experience congestion forcing the policer to be active  The bulk policer acts as a congestible resource with apparent congestion level   The figure shows how the congestion response of the flow changes from unpoliced to policed (π stays constant) xixi ++ policed Throughput xixi y i (p i ) y TCP =k/√p

December 9, 2008Policing Freedom9 Cross-effect on unresponsive flow  The effect is similar with unresponsive flows  Even an unresponsive application might be throttled on the basis of the congestion caused by other flows from the same customer  However, responsive traffic remains more affected Throughput Congestion pipi xixi pi+pi+ y CBR,i policed unpoliced (p i stays constant)

December 9, 2008Policing Freedom10 w v*v* w - v* foreground background w  The bulk policer imposes a joint constraint on all the traffic of a customer  This can have disproportionate impact on some of the most valuable flows  Thus encouraging customers to actively control the apportionment of their bit rate allowance:  weighted congestion control  protect foreground traffic  shift background to less congested time-space Promoting self-policing Example of resource control evolution

December 9, 2008Policing Freedom11 Requirement on signalling  Each packet needs to signal what congestion is expected on its path  This means each resource needs to signal congestion back to the source  ECN  One way for the source to decide what to signal is to reinsert the congestion signal  re-feedback

December 9, 2008Policing Freedom12 Feedback path Data packet flow Sender Receiver +1+1 Routers Networks 1. A congested router marks some packets with a debit 2. The receiver transfers debit marks into congestion feedback packets 3. Sender re-inserts feedback (re-feedback) into the forward data flow as credit marks Computers at the ends still detect and manage congestion. But packets they send have to reveal how much congestion they will encounter on their way through the Internet. Then networks can limit excessive congestion as packets enter the Internet. 5. The network can discard packets if the balance of passing marks is consistently in debt. In this diagram it's all OK as no-one is cheating One option = re-ECN  Policing upload traffic (rather than download) requires end-of-path information validation but provides stronger protection against identity spoofing

December 9, 2008Policing Freedom13 Conclusions  Make each packet accountable  Control congestion volume rather than volume  Don’t assume link between application type and congestion  Enforce per customer, at contractual connectivity point  Expose downstream congestion  Bulk constraint forces the evolution of end-customer rate adaptation and encourages better use of shared resource pool

Re’Arch 2008 Policing Freedom… to use the Internet Resource Pool Arnaud.Jacquet, Bob.Briscoe, Toby.Moncaster December

December 9, 2008Policing Freedom15 Throughput Congestion p TCP  Each flow has its natural congestion response, based on the application used  eg. y TCP  The policer puts a constraint forcing the operational point of the application’s throughput to remain out of the shaded area  When congestion exceeds p *, the policer takes over the congestion response Direct effect on a single flow (illustration purposes) y TCP =k/√p y policed =w/p

December 9, 2008Policing Freedom16 Throughput Congestion y CBR p CBR y policed  This also applies for unresponive flows Direct effect on a single flow (illustration purposes) y policed =w/p