A test-bed investigation of QoS mechanisms for supporting SLAs in IPv6 Vasilios A. Siris and Georgios Fotiadis University of Crete and FORTH Heraklion,

Slides:



Advertisements
Similar presentations
Tuning and Evaluating TCP End-to-End Performance in LFN Networks P. Cimbál* Measurement was supported by Sven Ubik**
Advertisements

CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
Tiziana Ferrari Differentiated Services Test: Report1 Differentiated Service Test REPORT TF-TANT Tiziana Ferrari Frankfurt, 1 Oct.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 – QoS.
Traffic Shaping Why traffic shaping? Isochronous shaping
Quality of Service Requirements
© 2006 Cisco Systems, Inc. All rights reserved. Module 4: Implement the DiffServ QoS Model Lesson 4.7: Introducing Traffic Policing and Shaping.
1.  Congestion Control Congestion Control  Factors that Cause Congestion Factors that Cause Congestion  Congestion Control vs Flow Control Congestion.
Tiziana Ferrari Diffserv testing in the wide area (TF-TANT task force)1 Diffserv testing in the wide area TF-TANT task force Tiziana Ferrari Italian National.
Engineering Internet QoS
Cloud Control with Distributed Rate Limiting Raghaven et all Presented by: Brian Card CS Fall Kinicki 1.
Traffic Manager Vahid Tabatabaee Fall 2007.
Restricted Slow-Start for TCP William Allcock 1,2, Sanjay Hegde 3 and Rajkumar Kettimuthu 1,2 1 Argonne National Laboratory 2 The University of Chicago.
Priority Scheduling and Buffer Management for ATM Traffic Shaping Authors: Todd Lizambri, Fernando Duran and Shukri Wakid Present: Hongming Wu.
Active Queue Management: Theory, Experiment and Implementation Vishal Misra Dept. of Computer Science Columbia University in the City of New York.
Ahmed Mansy, Mostafa Ammar (Georgia Tech) Bill Ver Steeg (Cisco)
Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP Presented by Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
© 2006 Cisco Systems, Inc. All rights reserved. Module 4: Implement the DiffServ QoS Model Lesson 4.10: Deploying End-to-End QoS.
© 2006 Cisco Systems, Inc. All rights reserved. Optimizing Converged Cisco Networks (ONT) Module 4: Implement the DiffServ QoS Model.
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
Max Min Fairness How define fairness? “ Any session is entitled to as much network use as is any other ” ….unless some sessions can use more without hurting.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Differentiated Services. Service Differentiation in the Internet Different applications have varying bandwidth, delay, and reliability requirements How.
A Case for Relative Differentiated Services and the Proportional Differentiation Model Constantinos Dovrolis Parameswaran Ramanathan University of Wisconsin-Madison.
1 Modeling and Emulation of Internet Paths Pramod Sanaga, Jonathon Duerig, Robert Ricci, Jay Lepreau University of Utah.
ACN: IntServ and DiffServ1 Integrated Service (IntServ) versus Differentiated Service (Diffserv) Information taken from Kurose and Ross textbook “ Computer.
1 Token Bucket Based CAC and Packet Scheduling for IEEE Broadband Wireless Access Networks Chi-Hung Chiang
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
Long Range Dependent Traffic and Leaky Buckets CS215-winter ’01 Demetrios Laios 3/22/2001.
Low-Rate TCP Denial of Service Defense Johnny Tsao Petros Efstathopoulos Tutor: Guang Yang UCLA 2003.
2001/09/12Chin-Kai Wu, CS, NTHU1 Dynamic Resource Management Considering the Real Behavior of Aggregate Traffic José R. Gallardo, Dimitrios Makrakis, and.
Congestion Control for High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs.
Dynamic versus Static Traffic Policing: A New Approach for Videoconference Traffic over Wireless Cellular Networks Author: Polychronis Koutsakis Anukrati.
Quality of Service. Overview Why QoS? When QoS? One model: Integrated services Contrast to Differentiated Services (more modern; more practical; not covered)
Integrated Services (RFC 1633) r Architecture for providing QoS guarantees to individual application sessions r Call setup: a session requiring QoS guarantees.
CS Spring 2011 CS 414 – Multimedia Systems Design Lecture 23 - Multimedia Network Protocols (Layer 3) Klara Nahrstedt Spring 2011.
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.
A Differentiated Services Implementation for High- Performance TCP Flows Volker Sander, Ian Foster, Alain Roy and Linda Winkler Forschungszentrum Jülich.
Quality of Service (QoS)
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.
Example Applications needing Advanced Services Campus Focused Workshop on Advanced Networks Atlanta, GA.
An End-to-end Approach to Increase TCP Throughput Over Ad-hoc Networks Sarah Sharafkandi and Naceur Malouch.
1 CSTS WG CSTS WG Prototyping for Forward CSTS Performance Boulder November 2011 Martin Karch.
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
CSE Computer Networks Prof. Aaron Striegel Department of Computer Science & Engineering University of Notre Dame Lecture 20 – March 25, 2010.
1 On Class-based Isolation of UDP, Short-lived and Long-lived TCP Flows by Selma Yilmaz Ibrahim Matta Computer Science Department Boston University.
1 IEEE Meeting July 19, 2006 Raj Jain Modeling of BCN V2.0 Jinjing Jiang and Raj Jain Washington University in Saint Louis Saint Louis, MO
1 Aggregate Traffic Performance with Active Queue Management and Drop from Tail Christophe Diot, Gianluca Iannaccone, Martin May Sprint ATL, Università.
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
Scavenger performance Cern External Network Division - Caltech Datagrid WP January, 2002.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 - Queuing and Basics of QoS.
ECS5365 Lecture 6 ATM Traffic and Network Management
Analysis of RED Goal: impact of RED on loss and delay of bursty (TCP) and less bursty or smooth (UDP) traffic RED eliminates loss bias against bursty traffic.
Random Early Detection (RED) Router notifies source before congestion happens - just drop the packet (TCP will timeout and adjust its window) - could make.
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
Queue Scheduling Disciplines
CS Spring 2011 CS 414 – Multimedia Systems Design Lecture 16 – Multimedia Transport (Part 2) Klara Nahrstedt Spring 2011.
1 Traffic Management Benchmarking Framework IETF 89 London draft-constantine-bmwg-traffic-management-03 Barry Constantine Tim.
Lecture 8 -Traffic Management
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
1 Lecture 15 Internet resource allocation and QoS Resource Reservation Protocol Integrated Services Differentiated Services.
Performance Evaluation of L3 Transport Protocols for IEEE (2 nd round) Richard Rouil, Nada Golmie, and David Griffith National Institute of Standards.
Tel Hai Academic College Department of Computer Science Prof. Reuven Aviv Markov Models for data flow In Computer Networks Resource: Fayez Gebali, Analysis.
© 2006 Cisco Systems, Inc. All rights reserved. Optimizing Converged Cisco Networks (ONT) Module 4: Implement the DiffServ QoS Model.
Topics discussed in this section:
Columbia University in the city of New York
When to use and when not to use BBR:
Presentation transcript:

A test-bed investigation of QoS mechanisms for supporting SLAs in IPv6 Vasilios A. Siris and Georgios Fotiadis University of Crete and FORTH Heraklion, Crete, Greece Funded in part by GRNET, through subcontract in 6NET (IST )

Objectives and motivation Investigate operation and interaction of QoS mechanisms in IPv6 networks Policing, shaping, queuing These mechanisms will be used in customer- provider interface Tuning is important for supporting Service Level Agreements (SLAs) Tuning each in isolation not sufficient Do they have different performance in IPv6 compared to IPv4?

User-network interface shaping, class-based queuing policing class-based queuing traffic flow User/customerProvider

QoS mechanisms investigated Cisco Traffic Policing Committed Access Rate – CAR not supported in IPv6 Cisco Generic Traffic Shaping - GTS Linux Traffic Policing Linux Traffic Shaping Token Bucket Filter – TBF Linux Class Based Queuing - CBQ

Token bucket algorithm True token bucket (r,b) Shaping includes a buffer Arriving packet: length L Token bucket depth: b x x  L? No, packet is nonconforming Yes, x=x-L Token rate r Implementation differs Mean rate or Committed Information Rate (CIR) Committed Burst Size (Bc) Time interval (=Bc/CIR)

IPv6 test-bed shaping, class-based queueing policing Linux-based router or Cisco 7100/7200 class- based queueing traffic flow 100 Mbps RedHat Linux 9.0 TCP traffic generated with Iperf for Linux RTT < 4 ms

Policing tests topology policing Linux-based router or Cisco 7100/7200 TCP traffic For fixed policing rate, measure aggregate throughput for different burst sizes

Variable policing rates (1/3) Burst size, Bc (Mbits) Aggregate Throughput (Mbps)

Variable policing rates (2/3) Aggregate throughput increases with burst size, but is always < policing rate For higher rates throughput is proportionally smaller Rate = 10 Mbps -> Throughput = 9.7 Rate = 70 Mbps -> Throughput = 46 Experiments for both Cisco & Linux routers gave identical results

Variable policing rates (3/3) Throughput versus burst size exhibits a “knee” at Bc*, which is approximately: If Rate < 40Mbps, Bc* = 0.6 Mbit sec*Rate If Rate > 40Mbps, Bc* = 1.5 Mbit sec*Rate Burst Size > RTT*Rate not sufficient!

Variable number of flows (1/2) Burst size, Bc (Mbits) Aggregate Throughput (Mbps)

Variable number of flows (2/2) Optimum burst size (“knee” value) is independent of the number of flows Aggregate throughput increases with number of flows (multiplexing) Similar results for Cisco & Linux routers

Interaction of policing & shaping shapingpolicing Linux-based router or Cisco 7100/7200 TCP traffic For fixed rate & burst size of policer and rate of shaper, measure aggregate throughput for different burst sizes of shaper

Throughput vs. burst size (1/4) Burst size, Bc (Mbits) Aggregate Throughput (Mbps) Shaping at Linux Policing at Cisco

Throughput vs. burst size (2/4) Appropriate shaper burst size can lead to significant throughput increase Throughput is always higher with shaping Setting burst size of shaper = burst size of policer not always optimal Low throughput for very small burst sizes Due to overflow at shaper’s queue But also, very large burst size gives low throughput Very large burst sizes allow large bursts which lead to multiple drops at the policer

Throughput vs. burst size (3/4) For larger # of flows there is larger range of burst sizes that achieve maximum throughput

Throughput vs. burst size (4/4) Shaping at Linux Policing at Linux Burst size, Bc (Mbits)Aggregate Throughput (Mbps) No qualitative difference when using two Linux or Linux & Cisco routers

Throughput vs. shaping rate (1/2) Shaping Rate (Mbps) Aggregate Throughput (Mbps) Shaping at Linux Policing at Cisco Policing rate

Throughput vs. shaping rate (2/2) Throughput maximum for shaping rate a little higher than policing rate Very high shaping rates leads to throughput degradation, due to bursts that are allowed by the shaper

Delay jitter tests (1/3) Policing/Shaping tests showed there is a range of shaper burst sizes for which throughput is maximized Which burst size is best? Answer: consider delay

Delay jitter tests (2/3) Burst Size, Bc (Mbit) Aggregate Throughput (Mbps)

Delay jitter tests (3/3) Jitter decreases when burst size increases Optimal burst size is one for which delay jitter is smallest, but is in the range of values that maximize throughput

Interaction of Policing and Class Base Queuing class-based queuing policing Linux-based router or Cisco 7100/7200 TCP traffic For fixed rate & burst size of policer and rate of CBQ, measure aggregate throughput for different maxburst values

Variable maxburst at CBQ (1/2) maxburst (packets) Aggregate Throughput (Mbps) CBQ at Linux Policing at Cisco

Variable maxburst at CBQ (2/2) Maximum throughput achieved with appropriate maxburst value Low throughput for small maxburst Large maxburst values do not result in throughput degradation maxburst has different effect than burst size in shaping CBQ performs traffic smoothing

Conclusions and outlook Interaction of QoS mechanisms is important for effectively supporting SLAs In the presence of policing, shaping can increase aggregate throughput Must appropriately set shaping parameters Tuning of parameters should consider throughput & delay Similar behavior with Cisco/Linux, IPv6/IPv4 Further research directions: Experiments in wide area (larger RTT) Experiments in wireless networks

A test-bed investigation of QoS mechanisms for supporting SLAs in IPv6 Vasilios A. Siris and Georgios Fotiadis University of Crete and FORTH Heraklion, Crete, Greece Funded in part by GRNET, through subcontract in 6NET (IST )