On Impact of Non-Conformant Flows on a Network of Drop-Tail Gateways Kartikeya Chandrayana Shivkumar Kalyanaraman ECSE Dept., R.P.I. (http://www.rpi.edu/~chandk)

Slides:



Advertisements
Similar presentations
Balaji Prabhakar Active queue management and bandwidth partitioning algorithms Balaji Prabhakar Departments of EE and CS Stanford University
Advertisements

IWSSC 2008 – Oct 3 rd 2008 Raffaello Secchi Scheduling TCP-Friendly Flows over a Satellite Network R. Secchi, A. Sathiaseelan, and G. Fairhurst Electronics.
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
Congestion Control Algorithms: Open Questions Benno Overeinder NLnet Labs.
Transport Layer3-1 TCP AIMD multiplicative decrease: cut CongWin in half after loss event additive increase: increase CongWin by 1 MSS every RTT in the.
Architectures for Congestion-Sensitive Pricing of Network Services Thesis Defense by Murat Yuksel CS Department, RPI July 3 rd, 2002.
 Liang Guo  Ibrahim Matta  Computer Science Department  Boston University  Presented by:  Chris Gianfrancesco and Rick Skowyra.
CNDS 2001, Phoenix, AZ Simulating the Smart Market Pricing Scheme on Differentiated- Services Architecture Murat Yuksel and Shivkumar Kalyanaraman Rensselaer.
Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP Presented by Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
Network Border Patrol Celio Albuquerque, Brett J. Vickers and Tatsuya Suda Jaideep Vaidya CS590F Fall 2000.
Network Border Patrol: Preventing Congestion Collapse and Promoting Fairness in the Internet Celio Albuquerque, Brett J. Vickers, Tatsuya Suda 1.
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #05: SOLUTIONS Shivkumar Kalyanaraman: GOOGLE: “Shiv.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #07 Shivkumar Kalyanaraman: GOOGLE: “Shiv RPI”
CPSC Topics in Multimedia Networking A Mechanism for Equitable Bandwidth Allocation under QoS and Budget Constraints D. Sivakumar IBM Almaden Research.
One More Bit Is Enough Yong Xia, RPI Lakshminarayanan Subramanian, UCB Ion Stoica, UCB Shivkumar Kalyanaraman, RPI SIGCOMM’05, August 22-26, 2005, Philadelphia,
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #11 Shivkumar Kalyanaraman: GOOGLE: “Shiv RPI”
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
Advanced Computer Networks: RED 1 Random Early Detection Gateways for Congestion Avoidance * Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
1 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, All our slides and papers.
Congestion Pricing Overlaid on Edge-to-Edge Congestion Control Murat Yuksel, Shivkumar Kalyanaraman and Anuj Goel Rensselaer Polytechnic Institute, Troy,
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Term Projects Shiv Kalyanaraman, Rensselaer Polytechnic Institute
1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug 1993), pp
Oblivious AQM and Nash Equilibria D. Dutta, A. Goel and J. Heidemann USC/ISI USC USC/ISI IEEE INFOCOM The 22nd Annual Joint Conference of the IEEE.
Promoting the Use of End-to- End Congestion Control in the Internet Sally Floyd and Kevin Fall Presented by Scott McLaren.
A Strategy for Implementing Smart Market Pricing Scheme on Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute, Troy, NY.
Distributed-Dynamic Capacity Contracting: A congestion pricing framework for Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute,
Random Early Detection Gateways for Congestion Avoidance
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
Congestion Control for High Bandwidth-Delay Product Environments 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.
Advanced Computer Networks : RED 1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
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,
Adaptive Packet Marking for Providing Differentiated Services in the Internet Wu-chang Feng, Debanjan Saha, Dilip Kandlur, Kang Shin October 13, 1998.
Kamal Singh, Árpád Huszák, David Ros, César Viho and Jeney Gábor
Advanced Computer Networking
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
TCP-Friendly Congestion Control presented by Hyunjoo Kim.
Korea Advanced Institute of Science and Technology Network Systems Lab. 1 Dual-resource TCP/AQM for processing-constrained networks INFOCOM 2006, Barcelona,
1 On Class-based Isolation of UDP, Short-lived and Long-lived TCP Flows by Selma Yilmaz Ibrahim Matta Computer Science Department Boston University.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 A TCP Friendly Traffic Marker for IP Differentiated Services Feroz Azeem, Shiv Kalyanaraman,
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.
1 Aggregate Traffic Performance with Active Queue Management and Drop from Tail Christophe Diot, Gianluca Iannaccone, Martin May Sprint ATL, Università.
Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005.
Congestion Control for High Bandwidth-Delay Product Networks D. Katabi (MIT), M. Handley (UCL), C. Rohrs (MIT) – SIGCOMM’02 Presented by Cheng.
Stochastic Fair Blue: A Queue Management Algorithm for Enforcing Fairness W. Feng, D. Kandlur, D. Saha, and K. Shin Presented by King-Shan Lui.
CSE 561 – Congestion Control with Network Support David Wetherall Spring 2000.
Queueing and Active Queue Management Aditya Akella 02/26/2007.
The Impact of Active Queue Management on Multimedia Congestion Control Wu-chi Feng Ohio State University.
1 On Scalable Edge-based Flow Control Mechanism for VPN Tunnels --- Part 2: Scalability and Implementation Issues Hiroyuki Ohsaki Graduate School of Information.
15744 Course Project1 Evaluation of Queue Management Algorithms Ningning Hu, Liu Ren, Jichuan Chang 30 April 2001.
Un-Cooperative Congestion Control Kartikeya Chandrayana Prof. Shivkumar Kalyanaraman ECSE Dept., R.P.I. (
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.
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.
1 Novel Function Placement of Congestion Control Building Blocks in the Internet Kartikeya Chandrayana.
Explicit Allocation of Best-Effort Service Goal: Allocate different rates to different users during congestion Can charge different prices to different.
Internet Measurement and Analysis Vinay Ribeiro Shriram Sarvotham Rolf Riedi Richard Baraniuk Rice University.
ECEN 619, Internet Protocols and Modeling Prof. Xi Zhang Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions.
Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.
1 Transport Bandwidth Allocation 3/29/2012. Admin. r Exam 1 m Max: 65 m Avg: 52 r Any questions on programming assignment 2 2.
Impact of New CC on Cross Traffic
TCP Congestion Control
April 10, 2006, Northwestern University
TCP Congestion Control
Understanding Congestion Control Mohammad Alizadeh Fall 2018
Presentation transcript:

On Impact of Non-Conformant Flows on a Network of Drop-Tail Gateways Kartikeya Chandrayana Shivkumar Kalyanaraman ECSE Dept., R.P.I. (

Problem Definition Users can choose their rate control schemes.  Rate Control Scheme  rate allocation.  Network may want to bound outcome  Conformance ( e.g. TCP)  Non-Conformant – e.g. TCP un-Friendly Possible rate control schemes ?  Un-Responsive e.g. CBR, UDP etc  Responsive, e.g. TCP, small tweaks to TCP Implications:  Selfish flows grab most of the bandwidth.  One form of traffic volume based denial of service attack.  Congestion Collapse  Network has no control over equilibrium rate distributions.  Unfair Sharing aggravated on a network of Drop-Tail queues

Effect of Non-Conformant Flow Long Flow: Conformant (TCP Reno, U=-1/x), Short Flows: Mis-Behaving (U=- 1/x 0.5 ) RED Drop Tail Queue TCP Flows shut out Present Internet is a network of Drop Tail queues

Possible Solutions Some Buffer Mgmt. Scheme Users End System Based Solution: Use same congestion control algorithm Network Routers Network Based Solution: Use AQM/Scheduler in the network Limitation Constrains the choice of congestion control algorithms AQM Placement Required at every router. Limitations May require exchange of control information between all AQMs/Schedulers in the network. Generally only provides Min-Max Fairness. Most Solutions do not work with a Drop Tail queue Network No clean method to manage non-conformant flows What is the right architectural response ?

Detour: Congestion Control-Optimization Frameworks Users choose congestion control algorithm.  Choose a Utility Function.  TCP : U(x) = -1/x CC Scheme  Utility function Every user maximizes his own utility function. Distributed optimization. Network communicates price (loss, mark, delay) to users. Users use this price to update their rate.

Idea: Managing Non-Conformance: Work in the Utility Function Space Key Design Objectives: Deployment Ease Retain existing link price update rules.  No changes in the core. Retain existing user’s rate updation rules.  Allows users to chose rate control protocol. Should work with either drop or marking based network. Should work on a network of Drop Tail queues. U1U1 U2U2 UsUs Conformant Non Conformant U 1,U 2 define the conformance space U x ( Rate ) Map user’s Utility Function to Conformant Space

User s is described by: –x s : Rate, U s : Utility function, q: end-to-end price –x s = U s ' -1 (q) Communicate to user the price q new : q new = U s ' (U obj ' -1 (q)) Now user’s update algorithm looks like x s = U s ' -1 (q new )  x s = U obj ' -1 (q)  Appears as if user is maximizing U obj ! Map user’s utility function to some (or range of) objective utility function U s  U obj, U obj  [U 1, U 2 ] How? By Penalty Function Transformation

Core Network (No Changes) Any queue mgmt algorithm  Drop Tail/RED etc. Core Routers Edge Routers Edge Based Re-Marking Agent Maps utility function Manages Selfish Flows. ( Decouple it from AQM design ) Provides Service differentiation ( Map users to different utility functions ). Users Free to choose their congestion control algorithm Either marking or dropping Idea: the Edge, Not in AQM Decouple Management of Non-Conformant Flows from AQM Design

What do we need to make it work ? Need to identify mis-behaving flows. –Smart Sampling in Netflow, Sample & Hold etc Estimate loss/mark rate –Currently using EWMA, WALI methods of TFRC Estimate utility function –Currently using Least Squares, Recursive LS –Needs only estimates of sending and loss rates Scalability –Keep state about only mis-behaving flows CBR/UDP flows –Need to drop (Marking does not work)

Results: Single Bottleneck Conformance: TCP-Friendliness 2 Flows: Conformant (TCP Reno, U=-1/x), Mis-Behaving (U=-1/x 0.5 ) Packet Drop Based Network. Drop packets from mis-behaving flows at the edge of the network. Marking Based Network. Re-mark packets from mis-behaving flows at the edge of the network. Drop Tail RED ECN Enabled

Results: Multi-Bottleneck (Drop Tail) Conformance: TCP-Friendliness Long Flow: Conformant (TCP Reno, U=-1/x), Short Flows: Mis-Behaving (U=- 1/x 0.5 ) TCP Flows shut out Framework prevents volume based denial of service attack. Without Re-Mapping With Re-Mapping

Results: Multi-Bottleneck (RED) Conformance: TCP-Friendliness Long Flow: Conformant (TCP Reno, U=-1/x), Short Flows: Mis-Behaving (U=- 1/x 0.5 ) Framework improves fair sharing of network Without Re-Mapping With Re-Mapping

More Results Background Traffic –Web (http) Traffic –Single/Multi Bottleneck scenarios Cross Traffic –Reverse path congestion –Especially important with RED –Multi-Bottleneck scenarios

Conclusions On a network of Drop Tail queues Mis-Behaving flows can force Traffic Volume based denial of service attack. –RED can prevent it though not unfair sharing. Edge-based transformation of price can handle misbehaving flows –No changes in the core No need to add penalty box functions in the context of AQM schemes (eg: CHoKe …) –Decouple mgmt of non-conformant flows from AQM Design. Works with packet drop or packet marking (ECN) Independent of buffer management algorithm. Limitation : Path Asymmetry –Different Exit and Entry routers

Done more work.. Utility function estimation Handling unresponsive flows Comparison with other AQM proposals Service Differentiation For more details see   Or