© British Telecommunications plc 1 nice traffic management without new protocols Bob Briscoe Chief Researcher, BT Oct 2012.

Slides:



Advertisements
Similar presentations
Simulation Study on the Effect of the trTCM Parameters Hakyong KIM R&D Center, Corecess Inc. Tel : PCS : Mail :
Advertisements

1 CNPA B Nasser S. Abouzakhar Queuing Disciplines Week 8 – Lecture 2 16 th November, 2009.
TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
Network and Communications Hongsik Choi Department of Computer Science Virginia Commonwealth University.
Congestion Control Tanenbaum 5.3 Tanenbaum 6.5. Congestion Control Network Layer – Congestion control point to point Transport Layer – Congestion control.
Tiziana Ferrari Differentiated Services Test: Report1 Differentiated Service Test REPORT TF-TANT Tiziana Ferrari Frankfurt, 1 Oct.
1.  Congestion Control Congestion Control  Factors that Cause Congestion Factors that Cause Congestion  Congestion Control vs Flow Control Congestion.
Playback-buffer Equalization For Streaming Media Using Stateless Transport Prioritization By Wai-tian Tan, Weidong Cui and John G. Apostolopoulos Presented.
Courtesy: Nick McKeown, Stanford 1 Intro to Quality of Service Tahir Azim.
Real-Time Protocol (RTP) r Provides standard packet format for real-time application r Typically runs over UDP r Specifies header fields below r Payload.
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
© British Telecommunications plc 1 Network Performance Isolation in Data Centres using ConEx Congestion Policing draft-briscoe-conex-policing-01 draft-briscoe-conex-data-centre-02.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #11 Shivkumar Kalyanaraman: GOOGLE: “Shiv RPI”
Networks: Congestion Control1 Congestion Control.
Scheduling CS 215 W Keshav Chpt 9 Problem: given N packet streams contending for the same channel, how to schedule pkt transmissions?
High speed TCP’s. Why high-speed TCP? Suppose that the bottleneck bandwidth is 10Gbps and RTT = 200ms. Bandwidth delay product is packets (1500.
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
CSE 401N Multimedia Networking-2 Lecture-19. Improving QOS in IP Networks Thus far: “making the best of best effort” Future: next generation Internet.
Management of Waiting Lines
Fluid-based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED Vishal Misra Wei-Bo Gong Don Towsley University of Massachusetts,
Computer Networking Lecture 17 – Queue Management As usual: Thanks to Srini Seshan and Dave Anderson.
Congestion Control for High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs.
Core Stateless Fair Queueing Stoica, Shanker and Zhang - SIGCOMM 98 Fair Queueing requires per flow state: too costly in high speed core routers Yet, some.
Bell Labs Advanced Technologies EMEAAT Proprietary Information © 2004 Lucent Technologies1 Overview contributions for D27 Lucent Netherlands Richa Malhotra.
CIS679: Scheduling, Resource Configuration and Admission Control r Review of Last lecture r Scheduling r Resource configuration r Admission control.
Initial ConEx Deployment Examples draft-briscoe-conex-initial-deploy-00.txt draft-briscoe-conex-initial-deploy-00.txt apologies from Bob Briscoe, BT presented.
Tiziana Ferrari Quality of Service Support in Packet Networks1 Quality of Service Support in Packet Networks Tiziana Ferrari Italian.
CSE QoS in IP. CSE Improving QOS in IP Networks Thus far: “making the best of best effort”
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 23 Congestion Control and Quality of Service.
QOS مظفر بگ محمدی دانشگاه ایلام. 2 Why a New Service Model? Best effort clearly insufficient –Some applications need more assurances from the network.
Tiziana Ferrari Diffserv deployment in the wide area: network design and testing1 Diffserv deployment in the wide area: network design and testing Tiziana.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 - Queuing and Basics of QoS.
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Oppenheimer.
Distributed Multimedia March 19, Distributed Multimedia What is Distributed Multimedia?  Large quantities of distributed data  Typically streamed.
AIMS’99 Workshop Heidelberg, May 1999 Linking User Acceptance and Network Performance Miles Wilkins (BT) P807 (JUPITER2)
Link Scheduling & Queuing COS 461: Computer Networks
Fluid-based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED Vishal Misra Wei-Bo Gong Don Towsley University of Massachusetts,
Congestion marking for low delay (& admission control) Bob Briscoe BT Research Mar 2005.
Capacity Sharing Bringing Together Cost, Value and Control Bob Briscoe Chief Researcher BT Oct 2011 This work was partly funded by Trilogy, a research.
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.
Congestion exposure BoF candidate protocol: re-ECN Bob Briscoe Chief Researcher, BT Nov 2009 This work is partly funded by Trilogy, a research project.
March 29 Scheduling ?. What is Packet Scheduling? Decide when and what packet to send on output link 1 2 Scheduler flow 1 flow 2 flow n Buffer management.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 - Queuing and Basics of QoS.
Solving this Internet resource sharing problem... and the next, and the next Bob Briscoe Chief Researcher BT Group (& UCL) Lou Burness, Toby Moncaster,
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.
Scheduling CS 218 Fall 02 - Keshav Chpt 9 Nov 5, 2003 Problem: given N packet streams contending for the same channel, how to schedule pkt transmissions?
Network Performance Isolation in Data Centres using Congestion Policing draft-briscoe-conex-data-centre-01.txt draft-briscoe-conex-data-centre-01.txt Bob.
Queue Scheduling Disciplines
© 2006 Cisco Systems, Inc. All rights reserved. 3.2: Implementing QoS.
Initial ConEx Deployment Examples draft-briscoe-conex-initial-deploy-00.txt draft-briscoe-conex-initial-deploy-00.txt apologies from Bob Briscoe, BT presented.
Providing QoS in IP Networks
1 Lecture 15 Internet resource allocation and QoS Resource Reservation Protocol Integrated Services Differentiated Services.
QoS & Queuing Theory CS352.
Topics discussed in this section:
Johns Hopkins university
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Copyright 2010 Cisco Press & Priscilla Oppenheimer.
Buffer Management in a Switch
Google’s BBR Congestion control algorithm
Bob Briscoe, BT Murari Sridharan, Microsoft IETF-84 ConEx Jul 2012
CONGESTION CONTROL, QUALITY OF SERVICE, & INTERNETWORKING
QoS Guarantees introduction call admission traffic specification
Quality of Service What is QoS? When is it needed?
The University of Adelaide, School of Computer Science
CSCD 433/533 Advanced Networks
Congestion Control, Quality of Service, & Internetworking
Network Simulation NET441
Advanced Computer Networks
Figure Areas in an autonomous system
Presentation transcript:

© British Telecommunications plc 1 nice traffic management without new protocols Bob Briscoe Chief Researcher, BT Oct 2012

© British Telecommunications plc 2 vertical stripes: this season’s colour increasingly access no longer the bottleneck –PON, FTTP, FTTdp, FTTC –bottleneck moving deeper –becoming similar to campus LAN, data centre each customer’s average access utilisation v low –1-3% average during peak hour (some 100%, but rarely at the same time) –if provision bottleneck for the worst case load seen, it leaves a lot of leeway for much worse cases traditionally the bottleneck solves this with –(weighted) fair-queuing / round robin* about isolation from random bad performance –not about skimping on capacity time rate time rate * or policed per-customer b/w limits (for higher utilisation customers e.g. DC) viewed at second mile

© British Telecommunications plc 3 enforces 1/N shares* so that’s fine? No –when average N is so low –a few more long-running customers than planned can increase N significantly –thereby greatly decreasing everyone else’s 1/N share the problem: –N depends heavily on presence of high util’n customers –usually few, but when many, service seems crap –large buffers make this much worse but not the only problem 1/N is ‘fair’ at each instant, but not over time fair queuing: so 1990s time rate * as does WRR (and TCP sort-of) time rate

© British Telecommunications plc 4 ConEx: so y=2014 y = y(now) + 2 the ConEx rationale FQ + volume limits? –hi vol customer only a problem if with other hi vol cust’s Lack of complete solution led to non-neutral solutions, then... Comcast fair-share –limit highest volume customer(s) only if cable congested –better, but penalises hi-vol even if transport yields [LEDBAT] research goal: we ain’t seen nothing yet on the Internet...if we designed the network for un-lame transports ConEx rationale is actually in two parts: 1.rationale for using congestion-volume as a metriccongestion-volume 2.need a change to IP (ConEx) to see congestion-volume Is there an 80% solution without changing IP?

© British Telecommunications plc 5 simpler to code than draw bottleneck congestion policer: next season’s colour foreach pkt { i = classify_user(pkt) d i += w i *(t now -t i ) //fill t i = t now d i -= s * p //drain if (d i <0) {drop(pkt)} } s : packet size p : drop prob of AQM backhaul &accessnetwork policer incoming packet stream meter w1w1 w2w2 wiwi … d i (t) cici congestion token bucket Y FIFO buffer p(t) AQM … outgoing packet stream

© British Telecommunications plc 6 bottleneck congestion policer (BCP): features predictable quality for the many –keeps queue v short –by focusing discard on those who most push at the queue* tends to WRR if customer traffic becomes continuous app-neutral applicability –same as any per-customer limiter –state: per-customer configured allowance and usage-level –drop-in to: BRAS / MSE, RNC, OLT, DC access –few simultaneous customers (or many) where bottleneck location varies, still need to evolve to ConEx typical anomalous * relative to their allowance to do so

© British Telecommunications plc 7 next steps (next season’s shoes) plan to open-source BCP –not yet fully agreed internally baby step –gets industry used to congestion-volume as the metric time rate time rate

© British Telecommunications plc 8 nice traffic management without new protocols Q&A discussion spare slide

© British Telecommunications plc 9 measuring contribution to congestion = bytes weighted by congestion level = bytes dropped (or ECN-marked) = ‘congestion-volume’  marginal cost of capacity as simple to measure as volume bit-rate time congestion time 10GB 0.01% congestion 1MB 1% congestion 1MB 300MB 100MB 3MB 1% 0.01%

© British Telecommunications plc 10 wiwi d i (t) cici kw i C AQM p(t) policer main congestion token bucket meter congestion burst limiter police if either bucket empties actually each bucket needs to be two buckets to limit bursts of congestion