Corelite Architecture: Achieving Rated Weight Fairness

Slides:



Advertisements
Similar presentations
Using Edge-To-Edge Feedback Control to Make Assured Service More Assured in DiffServ Networks K.R.R.Kumar, A.L.Ananda, Lillykutty Jacob Centre for Internet.
Advertisements

RED-PD: RED with Preferential Dropping Ratul Mahajan Sally Floyd David Wetherall.
RED Enhancement Algorithms By Alina Naimark. Presented Approaches Flow Random Early Drop - FRED By Dong Lin and Robert Morris Sabilized Random Early Drop.
WHITE – Achieving Fair Bandwidth Allocation with Priority Dropping Based on Round Trip Time Name : Choong-Soo Lee Advisors : Mark Claypool, Robert Kinicki.
Architectures for Congestion-Sensitive Pricing of Network Services Thesis Defense by Murat Yuksel CS Department, RPI July 3 rd, 2002.
CNDS 2001, Phoenix, AZ Simulating the Smart Market Pricing Scheme on Differentiated- Services Architecture Murat Yuksel and Shivkumar Kalyanaraman Rensselaer.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli University of Calif, Berkeley and Lawrence Berkeley National Laboratory SIGCOMM.
CS 268: Lecture 8 Router Support for Congestion Control Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.
CS 4700 / CS 5700 Network Fundamentals Lecture 12: Router-Aided Congestion Control (Drop it like it’s hot) Revised 3/18/13.
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.
The War Between Mice and Elephants LIANG GUO, IBRAHIM MATTA Computer Science Department Boston University ICNP (International Conference on Network Protocols)
Ion Stoica, Scott Shenker, and Hui Zhang SIGCOMM’98, Vancouver, August 1998 subsequently IEEE/ACM Transactions on Networking 11(1), 2003, pp Presented.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
Color Aware Switch algorithm implementation The Computer Communication Lab (236340) Spring 2008.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
Proportional Bandwidth Allocation in DiffServ Networks Usman Raza Chohan
TCP Stability and Resource Allocation: Part I. References The Mathematics of Internet Congestion Control, Birkhauser, The web pages of –Kelly, Vinnicombe,
EE689 Lecture 7 Review of Last Lecture Differentiated Services Networks Performance results.
EE689 Lecture 5 Review of last lecture More on HPF RED.
1 Traffic Sensitive Quality of Service Controller Masters Thesis Submitted by :Abhishek Kumar Advisors: Prof Mark Claypool Prof Robert Kinicki Reader:
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
1 Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Ion Stoica,Scott Shenker, and Hui Zhang SIGCOMM’99,
A Real-Time Video Multicast Architecture for Assured Forwarding Services Ashraf Matrawy, Ioannis Lambadaris IEEE TRANSACTIONS ON MULTIMEDIA, AUGUST 2005.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
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,
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
Core Stateless Fair Queueing Stoica, Shanker and Zhang - SIGCOMM 98 Rigorous fair Queueing requires per flow state: too costly in high speed core routers.
Congestion Control for High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs.
UCB Improvements in Core-Stateless Fair Queueing (CSFQ) Ling Huang U.C. Berkeley cml.me.berkeley.edu/~hlion.
1 A State Feedback Control Approach to Stabilizing Queues for ECN- Enabled TCP Connections Yuan Gao and Jennifer Hou IEEE INFOCOM 2003, San Francisco,
10th Workshop on Information Technologies and Systems 1 A Comparative Evaluation of Internet Pricing Schemes: Smart Market and Dynamic Capacity Contracting.
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.
Integrated Services (RFC 1633) r Architecture for providing QoS guarantees to individual application sessions r Call setup: a session requiring QoS guarantees.
Design of an optimal AQM controller for the Diffserv architecture Leonardo Rangel / Nelson Fonseca Institute of Computing - IC Unicamp, Campinas, ,
1 Queue Management Hamed Khanmirza Principles of Networking University of Tehran.
Advance Computer Networking L-5 TCP & Routers Acknowledgments: Lecture slides are from the graduate level Computer Networks course thought by Srinivasan.
ACN: CSFQ1 CSFQ Core-Stateless Fair Queueing Presented by Nagaraj Shirali Choong-Soo Lee ACN: CSFQ1.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
Worcester Polytechnic Insitute, Worcester, MA, USA1 Traffic Sensitive Active Queue Management for Improved Multimedia Streaming Authors: Vishal Phirke,
Congestion Control for High Bandwidth-Delay Product Networks D. Katabi (MIT), M. Handley (UCL), C. Rohrs (MIT) – SIGCOMM’02 Presented by Cheng.
Presented by: Peng Wang EE Department University of Delaware A Probabilistic Approach for Achieving Fair Bandwidth Allocation in CSFQ.
Queueing and Active Queue Management Aditya Akella 02/26/2007.
Packet Scheduling and Buffer Management Switches S.Keshav: “ An Engineering Approach to Networking”
Research Unit in Networking - University of Liège A Distributed Algorithm for Weighted Max-Min Fairness in MPLS Networks Fabian Skivée
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.
Real-time Transport for Assured Forwarding: An Architecture for both Unicast and Multicast Applications By Ashraf Matrawy and Ioannis Lambadaris From Carleton.
Internet Quality of Service
Instructor Materials Chapter 6: Quality of Service
QoS & Queuing Theory CS352.
PROTEAN: A Scalable Architecture for Active Networks
Queue Management Jennifer Rexford COS 461: Computer Networks
Congestion Control and Resource Allocation
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Quality of Service Connecting Networks.
Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks Ion Stoica, Scott Shenker, and Hui.
Columbia University in the city of New York
Quality of Service For Mobile IP.
Advance Computer Networking
Dynamic Management for End-to-end IP QoS
EE 122: Lecture 18 (Differentiated Services)
Congestion Control, Quality of Service, & Internetworking
Max Min Fairness How define fairness?
Advance Computer Networking
Congestion Control Reasons:
EE 122: Differentiated Services
Presentation transcript:

Corelite Architecture: Achieving Rated Weight Fairness Rigoberto Núñez Kevin Sinha

Introduction Corelite is a QoS architecture that provides weighted max-min fairness for rate among flows in a network without maintaining any per-flow state in the core routers 3 key mechanisms: Introduction of markers in a packet flow to reflect the normalized rate of flow Weighted fair marker feedback at the core routers upon incipient congestion detection Linear increase/multiplicative decrease based on marker feedback Chris

Background – QoS Platforms Currently only simple best effort service Need for QoS platforms -> being developed: Integrated Services (Intserv): supports absolute per-flow quality of service measures Problems: requires substantial amount of per-flow state to be maintained in routers, so due to the 100,000s of flows in large networks, this is not a good solution Differentiated Services (Diffserv): scalable service with *no* per-flow state management needed at core routers Craig

What is Corelite? Based broadly on Diffserv – among the first approaches to achieve weighted rate fairness in a core stateless network Key parts of Corelite design: No per-flow state in core of the network Simple forwarding behavior for core routers Low overhead (weighted) fair-feedback scheme at core routers to provide early congestion feedback to the edge Rate adaptation at the edges without network packet loss Each flow belongs to a rate class and receives the correlated weight Craig

Weighted Rate Fairness Defined as a version of max-min fairness Fairness defined as: Any flow is entitled to as much network usage as any other An increase in the allocation of one flow is allowed if it does not hurt other flows

Mechanisms Shaping and Marking at the Edge Routers The flow’s traffic is shaped according to its current The markers reflect the normalized rate of the flow Marking Caching and Feedback at the Core Router Weighted fair marker feedback on incipient congestion detection Rate Adaptation at the Edge Router Based on linear-increase-multiplicative-decrease (LIMD) Question: What makes Corelite achieve weighted rate fairness without maintaining any per-flow state? Solution: The core router generates feedback in proportion to the normalized rate of a flow because edge routers insert markers to reflect the normalized rate of the flow or the edge router throttles the rate in proportion to the number of received markers.

Mechanisms Shaping and Marking at the Edge Routers The flow’s traffic is shaped according to its current The markers reflect the normalized rate of the flow Marking Caching and Feedback at the Core Router Weighted fair marker feedback on incipient congestion detection Rate Adaptation at the Edge Router Based on linear-increase-multiplicative-decrease (LIMD) Question: What makes Corelite achieve weighted rate fairness without maintaining any per-flow state? Solution: The core router generates feedback in proportion to the normalized rate of a flow because edge routers insert markers to reflect the normalized rate of the flow or the edge router throttles the rate in proportion to the number of received markers.

Achieving Weighted Rate Fairness Basic operation of corelite: Step 1: The edge routers send markers in proportion to assigned weight of flow Step 2: The core router forwards markers and also caches them in marker cache. If incipient congestion is detected, it selects markers and sends them back to their corresponding edge routers Step 3: If markers received from step 2, the edge routers periodically throttle back the rate of flow proportional to the maximum number of markers received for the flow because the goal is to decrease the rate in response to the bottleneck link

Incipient Congestion Detection Detected by monitoring the length of packet queues If at end of every epoch , then incipient congestion exists and markers are sent back How many markers? This is calculated by the formula

Marker Selection Weighted fair feedback When incipient congestion is detected and the link decides to send back markers, it sends Selective marker feedback Motivated by CSFQ Calculate running average of normalized packet transmission rate Probability of marker selection Deficit Variable If marker selected with rn < ravg, then it is swapped with a future marker with rn > ravg

Simulations Network Topology Three congested links Flows have RTT from 240ms-400ms Packet size = 1KB, queue size = 40 packets, links have BW = 4Mbps, latency = 2ms Craig

Weighted Rate Fairness with Network Dynamics – 20 flows 1-5, 11-12, 16-20 one congested link 6-8, 13-5 two congested links 9-10 three congested links Instantaneous Rate 5, 15 – weight of 3 1, 11, 16 – weight of 1 All others – weight of 2

Corelite vs. CSFQ Corelite CSFQ Flows 1, 2 have weight 1; 3, 4 have weight 2, etc. Corelite converges faster because no packet drops since flows sending at a lower rate than their fair share don’t receive congestion notifications CSFQ: simultaneous startup of many flows cause deviation from estimated fair rate because CSFQ can’t keep up with the changing fair rate -> if the share is underestimated, flows drop packets; if overestimated, extra packets are accepted causing queue buildups and potential overflows Chris

Corelite vs. CSFQ with Network Dynamics Chris Corelite converges faster because:

Corelite vs. CSFQ with Network Dynamics Chris Corelite converges faster because: all flows move to the linear increase phase only after reaching a point close to their final rate, but CSFQ flows observe losses earlier in their lifetime (as described in the last simulation) resulting in slower convergence

Summary and Conclusions Corelite provides per-flow rate contracts and weighted fair allocation of bandwidth without any per-flow state in the core Corelite performs better than CSFQ when the fair share at the core router varies rapidly Markers are used to Normalize the rate of the flow according to its rate weight Enable the core router to notify the edge routers in case of congestion

Questions ?