ConEx Abstract Protocol What’s the Credit marking for? draft-mathis-conex-abstract-mech-00.txt draft-mathis-conex-abstract-mech-00.txt apologies from Bob.

Slides:



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

CONEX BoF. Welcome to CONEX! Chairs: –Leslie Daigle –Philip Eardley Scribe Note well MORE INFO: -ECN.
Re-ECN: Adding Accountability for Causing Congestion to TCP/IP draft-briscoe-tsvwg-re-ecn-tcp-03 Bob Briscoe, BT & UCL Arnaud Jacquet, Alessandro Salvatori.
A Test To Allow TCP Senders to Identify Receiver Cheating Toby Moncaster, Bob Briscoe, Arnaud Jacquet BT PLC draft-moncaster-tcpm-rcv-cheat-00.txt Intended.
Internetworking II: MPLS, Security, and Traffic Engineering
Florin Dinu T. S. Eugene Ng Rice University Inferring a Network Congestion Map with Traffic Overhead 0 zero.
A Test To Allow TCP Senders to Identify Receiver Non-Compliance Toby Moncaster †, Bob Briscoe*, Arnaud Jacquet* † University of Cambridge * BT draft-moncaster-tcpm-rcv-cheat-03.
Camarillo / Schulzrinne / Kantola November 26th, 2001 SIP over SCTP performance analysis
Explicit Congestion Notification (ECN) RFC 3168 Justin Yackoski DEGAS Networking Group CISC856 – TCP/IP Thanks to Namratha Hundigopal.
An Implementation and Experimental Study of the eXplicit Control Protocol (XCP) Yongguang Zhang and Tom Henderson INFOCOMM 2005 Presenter - Bob Kinicki.
TDC365 Spring 2001John Kristoff - DePaul University1 Internetworking Technologies Transmission Control Protocol (TCP)
Explicit Congestion Notification ECN Tilo Hamann Technical University Hamburg-Harburg, Germany.
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168) Limited Transmit (RFC 3042)
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168)
DoS-resistant Internet - progress Bob Briscoe Jun 2005.
ACN: Congestion Control1 Congestion Control and Resource Allocation.
1 MPLS Architecture. 2 MPLS Network Model MPLS LSR = Label Switched Router LER = Label Edge Router LER LSR LER LSR IP MPLS IP Internet LSR.
1 1 July 28, Absent changes to the network can we actually do something? Yes Is there work in the area of measurements that can we do to create.
Whither Congestion Control? Sally Floyd E2ERG, July
Presentation on Osi & TCP/IP MODEL
Initial ConEx Deployment Examples draft-briscoe-conex-initial-deploy-00.txt draft-briscoe-conex-initial-deploy-00.txt apologies from Bob Briscoe, BT presented.
ConEx Concepts and Abstract Mechanism draft-ietf-conex-abstract-mech-07.txt draft-ietf-conex-abstract-mech-07.txt Matt Mathis, Google Bob Briscoe, BT IETF-87.
Byte and Packet Congestion Notification draft-ietf-tsvwg-byte-pkt-congest-02.txt draft-ietf-tsvwg-byte-pkt-congest-02.txt Bob Briscoe, BT IETF-78 tsvwg.
Tunnelling of Explicit Congestion Notification draft-briscoe-tsvwg-ecn-tunnel-08.txt draft-briscoe-tsvwg-ecn-tunnel-08.txt Bob Briscoe, BT IETF-77 tsvwg.
Quick-Start for TCP and IP A.Jain, S. Floyd, M. Allman, and P. Sarolahti ICSI, April 2006 This and earlier presentations::
1 IPFIX Protocol Specifications IPFIX IETF-59 March 3, 2004 Benoit Claise Mark Fullmer Reinaldo Penno Paul Calato Stewart Bryant Ganesh Sadasivan.
ConEx Concepts and Uses Toby Moncaster John Leslie (JLC) Bob Briscoe (BT) Rich Woundy (ComCast) draft-moncaster-conex-concepts-uses-01.
Adding Explicit Congestion Notification (ECN) Capability to TCP's SYN/ACK Packets A. Kuzmanovic, A. Mondal, S. Floyd, and K.K. Ramakrishnan draft-ietf-tcpm-ecnsyn-03.txt.
CS332, Ch. 26: TCP Victor Norman Calvin College 1.
ConEx Concepts and Abstract Mechanism draft-mathis-conex-abstract-mech-00.txt draft-mathis-conex-abstract-mech-00.txt Matt Mathis, Google Bob Briscoe,
Datagram Congestion Control Protocol
MaxNet NetLab Presentation Hailey Lam Outline MaxNet as an alternative to TCP Linux implementation of MaxNet Demonstration of fairness, quick.
1 Countering DoS Through Filtering Omar Bashir Communications Enabling Technologies
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.
Re-ECN: Adding Accountability for Causing Congestion to TCP/IP Bob Briscoe, BT & UCL Arnaud Jacquet, BT Alessandro Salvatori, BT IETF-65 tsvwg Mar 2006.
Tunnelling of Explicit Congestion Notification draft-briscoe-tsvwg-ecn-tunnel-03.txt draft-briscoe-tsvwg-ecn-tunnel-03.txt Bob Briscoe, BT IETF-75 saag.
Byte and Packet Congestion Notification draft-ietf-tsvwg-byte-pkt-congest-00.txt draft-ietf-tsvwg-byte-pkt-congest-00.txt Bob Briscoe, BT & UCL IETF-73.
Tunnelling of Explicit Congestion Notification draft-briscoe-tsvwg-ecn-tunnel-02.txt draft-briscoe-tsvwg-ecn-tunnel-02.txt Bob Briscoe, BT IETF-74 tsvwg.
Echo Cookie TCP Option Bob Briscoe Nov 2014 Bob Briscoe’s work is part-funded by the European Community under its Seventh Framework Programme through the.
Guaranteed QoS Synthesiser (GQS) Bob Briscoe, Peter Hovell BT Research Jan 2005.
Chapter 24 Transport Control Protocol (TCP) Layer 4 protocol Responsible for reliable end-to-end transmission Provides illusion of reliable network to.
Re-ECN: Adding Accountability for Causing Congestion to TCP/IP Bob Briscoe, BT & UCL Arnaud Jacquet, BT Alessandro Salvatori, BT CRN DoS w-g, Apr 2006.
CONEX BoF. Welcome to CONEX! Chairs: –Leslie Daigle –Philip Eardley Scribe Note well.
Improving TCP Performance over Wireless Networks
Re-ECN: Adding Accountability for Causing Congestion to TCP/IP Bob Briscoe, BT & UCL Arnaud Jacquet, BT Alessandro Salvatori, BT IETF-64 tsvwg Nov 2005.
Making stuff real re-feedback Bob Briscoe, BT Research Nov 2005 CRN DoS resistant Internet w-g.
Thoughts on the Evolution of TCP in the Internet (version 2) Sally Floyd ICIR Wednesday Lunch March 17,
Initial ConEx Deployment Examples draft-briscoe-conex-initial-deploy-02.txt draft-briscoe-conex-initial-deploy-02.txt Bob Briscoe, BT Dirk Kutscher, NEC.
Network Performance Isolation in Data Centres using Congestion Policing draft-briscoe-conex-data-centre-01.txt draft-briscoe-conex-data-centre-01.txt Bob.
ConEx Concepts and Abstract Mechanism draft-ietf-conex-abstract-mech-01.txt draft-ietf-conex-abstract-mech-01.txt Matt Mathis, Google Bob Briscoe, BT IETF-80.
Principles & Constraints Philip Eardley. Application-agnostic The CONEX protocol should be open about (independent of) the responses it allows to the.
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
Support for ECN and PCN in MPLS networks draft-davie-ecn-mpls-00.txt Bruce Davie Cisco Systems Bob Briscoe June Tay BT Research.
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.
Initial ConEx Deployment Examples draft-briscoe-conex-initial-deploy-00.txt draft-briscoe-conex-initial-deploy-00.txt apologies from Bob Briscoe, BT presented.
Adding Explicit Congestion Notification (ECN) Capability to TCP's SYN/ACK Packets A. Kuzmanovic, A. Mondal, S. Floyd, and K.K. Ramakrishnan draft-ietf-tcpm-ecnsyn-02.txt.
Layered Encapsulation of Congestion Notification draft-briscoe-tsvwg-ecn-tunnel-01.txt draft-briscoe-tsvwg-ecn-tunnel-01.txt Bob Briscoe, BT IETF-72 tsvwg.
Support for ECN and PCN in MPLS networks
Topics discussed in this section:
Bob Briscoe Simula Research Laboratory
Bob Briscoe, BT IETF-72 tsvwg Jul 2008
CONEX BoF.
EE 122: Lecture 18 (Differentiated Services)
Quick-Start for TCP and IP
Separating Routing Planes using Segment Routing draft-gulkohegde-spring-separating-routing-planes-using-sr-00 IETF 98 – Chicago, USA Shraddha Hegde
EE 122: Differentiated Services
Review of Internet Protocols Transport Layer
ECN in QUIC - Questions Surfaced
LOOPS Generic Information Set draft-welzl-loops-gen-info-00
Presentation transcript:

ConEx Abstract Protocol What’s the Credit marking for? draft-mathis-conex-abstract-mech-00.txt draft-mathis-conex-abstract-mech-00.txt apologies from Bob Briscoe, BT presented instead by Andrea Soppera, BT IETF-79 ConEx Nov 2010 This work is partly funded by Trilogy, a research project supported by the European Community

2 recap: audit function ConEx signal from sender (black) can be checked against actual congestion signal (red) auditor checks flow ‘balance’ Balance= black – red transport sender transport receiver congested network element policyaudit ECN loss SACK ECE Re-Echo-ECN Re-Echo-Loss if black < red drop

3 how does audit handle inherent delay? how long to wait from congestion to re-echo? 1RTT? ~20RTT?  RTT? (TCP, RTCP, FEC) how does a network node know the transport’s RTT anyway? audit must not depend on unauditable metric transport sender transport receiver congested network element policyaudit ECN loss SACK ECE Re-Echo-ECN Re-Echo-Loss ≥1 RTT

4 solution hold transport responsible for delay transport must pre-load Credit (green) into loop sufficient Credit (green) marks for expected congestion during delay makes transport accountable for risk of causing congestion before it can react transport sender transport receiver congested network element policyaudit ECN loss ECE Re-Echo-ECN Re-Echo-Loss Credit SACK Balance= green + black - red

ConEx balance of a TCP connection at a audit device ConEx balance [marks] time [ms] CWND size [segments] What would a ConEx signal look like? Re-Echo-ECN ECN Credit ConEx balance= green + black - red

6 auditor needs flow state in network  …but don’t forget ConEx only needs flow state to check correctness of information ConEx does not embed rules in the network on how flows behave unlike many other traffic management approaches such as: flow-state aware routers deep packet inspection (DPI) and other like this…

7 Summary What is a credit signal? expectation of the worst congestion that a sender is going to contribute to before it can re-echo credit is speculative congestion exposure while re- echo reflects actual the number of credit that a sender is going to signal will depend on the aggressiveness of the congestion control it uses create correct incentives not to be aggressive This presentation is focused on credit signals for auditing - the signal is also useful in other cases but out of scope here

8 status & plans rationale for Credit signal to be added to draft-01 normative text on design constraints for audit devices Mathis & Briscoe close to agreeing text to add to draft-01 informational, but we don’t have a better charter milestone for this an audit device design has been implemented resisted various simulated attacks proposed by research community can never prove anything is secure until its broken plan to prepare I-D as a ConEx ‘experience report’

ConEx Abstract Protocol What’s the Credit marking for? draft-mathis-conex-abstract-mech-00.txt draft-mathis-conex-abstract-mech-00.txt Q&A

10 define ‘flow’? auditor checks flow ‘balance’ should be non-negative at any granularity of identifiers microflow granularity may not be visible to auditor due to NATs, tunnelling, etc can audit at any level of granularity tunnel, src-dst pair, etc if negative balance, go finer if possible finer (and closer to destination) always better

egress dropper (sketch) drop enough traffic (black immune) to make fraction of red = black goodput best if rcvr & sender honest about feedback & re-feedback 0 …i… n 2% code-point rate 3% 98% 2% 95% cheating sender or receiver understates black = = egress dropper NANA NBNB NDND R1R1 S1S1 policer dropper x 2/3

12 flow bootstrap at least one green packet(s) at start of flow or after >1sec idle means “feedback not established” ‘credit’ for safety due to lack of feedback a green byte is ‘worth’ same as a black byte a different colour from black distinguishes expected congestion based on experience from based on conservatism gives deterministic flow state mgmt (policers, droppers, firewalls, servers) rate limiting of state set-up congestion control of memory exhaustion green also serves as state setup bit [Clark, Handley & Greenhalgh] protocol-independent identification of flow state set-up for servers, firewalls, tag switching, etc don’t create state if not set may drop packet if not set but matching state not found firewalls can permit protocol evolution without knowing semantics some validation of encrypted traffic, independent of transport can limit outgoing rate of state setup to be precise green is ‘idempotent soft-state set-up codepoint’

13 flow state in network? three separate reasons for avoiding network flow state a)pins flow to path  not an issue b)state attacks  not an issue c)memory cost  auditing cannot avoid this  a)auditor’s flow state is soft if flow moves, ConEx markings recreate state in another auditor b)auditor requires credit marking before allocating flow state ingress policers can then limit influx of credit markings flow state exhaustion attacks (incl. SYN attacks) thwarted at source servers/firewalls under stress can also prefer new flows with credit marking c)cannot avoid memory cost only need full per-flow auditing once, at egress of internetwork clever hardware implementers may design better scaling

14 discussion is Credit / Re-Echo distinction worth 2 codepoints? for w-g to discuss/decide depends how much space we find for encoding more benefits than mentioned so far distinguishes actual vs. speculative congestion exposure useful for bulk monitoring as well as per-flow mechanisms benefits of Credit as a flow state set-up flag hook for e2e session congestion control hook for link layer cut-through optimisations (cf. tag switching) etc