Comments on the Performance of Measurement Based Admission Control Algorithms Lee Breslau, S. Jamin, S. Shenker Infocom 2000.

Slides:



Advertisements
Similar presentations
Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms Chenyang Lu, John A. Stankovic, Gang Tao, Sang H. Son Presented by Josh Carl.
Advertisements

Quality of Service CS 457 Presentation Xue Gu Nov 15, 2001.
RED Enhancement Algorithms By Alina Naimark. Presented Approaches Flow Random Early Drop - FRED By Dong Lin and Robert Morris Sabilized Random Early Drop.
Spring 2000CS 4611 Quality of Service Outline Realtime Applications Integrated Services Differentiated Services.
Congestion Control Tanenbaum 5.3 Tanenbaum 6.5. Congestion Control Network Layer – Congestion control point to point Transport Layer – Congestion control.
Quantifying Overprovisioning vs. Class-of-Service: Informing the Net Neutrality Debate Murat Yuksel (University of Nevada – Reno) K.
Traffic Shaping Why traffic shaping? Isochronous shaping
Engineering Internet QoS
Cloud Control with Distributed Rate Limiting Raghaven et all Presented by: Brian Card CS Fall Kinicki 1.
Playback-buffer Equalization For Streaming Media Using Stateless Transport Prioritization By Wai-tian Tan, Weidong Cui and John G. Apostolopoulos Presented.
CSE Computer Networks Prof. Aaron Striegel Department of Computer Science & Engineering University of Notre Dame Lecture 20 – March 25, 2010.
Distributed Control Algorithms for Service Differentiation in Wireless Packet Networks Michael Barry, Andrew T Campbell, Andras Veres
1 Distributed Control Algorithms for Service Differentiation in Wireless Packet Networks INFOCOM 2001 Michael Barry, Andrew T. Campbell Andras Veres.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli University of Calif, Berkeley and Lawrence Berkeley National Laboratory SIGCOMM.
Flow Control Mario Gerla, CS 215 W2001. Flow Control - the concept Flow Control: “ set of techniques which allow to match the source offered rate to the.
Priority Scheduling and Buffer Management for ATM Traffic Shaping Authors: Todd Lizambri, Fernando Duran and Shukri Wakid Present: Hongming Wu.
Recent Progress on a Statistical Network Calculus Jorg Liebeherr Department of Computer Science University of Virginia.
5/17/20151 Adaptive RED: An Algorithm for Increasing the Robustness of RED’s Active Queue Management or How I learned to stop worrying and love RED Presented.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
Supporting Real-time Applications in An Integrated Service Packet Network CSZ Sigcomm 92.
“On Designing Improved Controllers for AQM Routers Supporting TCP Flows” The PI Controller Presented by Bob Kinicki.
Introduction Future wireless systems will be characterized by their heterogeneity - availability of multiple access systems in the same physical space.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
CS 268: Lecture 15/16 (Packet Scheduling) Ion Stoica April 8/10, 2002.
Buffer Sizing for Congested Internet Links Chi Yin Cheung Cs 395 Advanced Networking.
Multiple constraints QoS Routing Given: - a (real time) connection request with specified QoS requirements (e.g., Bdw, Delay, Jitter, packet loss, path.
Building a Controlled Delay Assured Forwarding Class in DiffServ Networks Parag Kulkarni Nazeeruddin Mohammad Sally McClean Gerard Parr Michaela Black.
Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Vikram Kanodia.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
1 Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Ion Stoica,Scott Shenker, and Hui Zhang SIGCOMM’99,
Endpoint Admission Control WebTP Presentation 9/26/00 Presented by Ye Xia Reference: L. Breslau, E. W. Knightly, S. Shenkar, I. Stoica, H. Zhang, “Endpoint.
ACN: AVQ1 Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for Active Queue Managment Srisankar Kunniyur and R. Srikant SIGCOMM’01 San.
Performance and Robustness Testing of Explicit-Rate ABR Flow Control Schemes Milan Zoranovic Carey Williamson October 26, 1999.
1 Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Ion Stoica,Scott Shenker, and Hui Zhang SIGCOMM’99,
Long Range Dependent Traffic and Leaky Buckets CS215-winter ’01 Demetrios Laios 3/22/2001.
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
1 A State Feedback Control Approach to Stabilizing Queues for ECN- Enabled TCP Connections Yuan Gao and Jennifer Hou IEEE INFOCOM 2003, San Francisco,
Packet Scheduling From Ion Stoica. 2 Packet Scheduling  Decide when and what packet to send on output link -Usually implemented at output interface 1.
QoS Architectures for Connectionless Networks
QOS مظفر بگ محمدی دانشگاه ایلام. 2 Why a New Service Model? Best effort clearly insufficient –Some applications need more assurances from the network.
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
Estimating Bandwidth of Mobile Users Sept 2003 Rohit Kapoor CSD, UCLA.
Measurement-based Admission Control CS 8803NTM Network Measurements Parag Shah.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 A TCP Friendly Traffic Marker for IP Differentiated Services Feroz Azeem, Shiv Kalyanaraman,
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
TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
Florida State UniversityZhenhai Duan1 BCSQ: Bin-based Core Stateless Queueing for Scalable Support of Guaranteed Services Zhenhai Duan Karthik Parsha Department.
WB-RTO: A Window-Based Retransmission Timeout Ioannis Psaras Demokritos University of Thrace, Xanthi, Greece.
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
EE 122: Lecture 15 (Quality of Service) Ion Stoica October 25, 2001.
TCP Westwood: Efficient Transport for High-speed wired/wireless Networks 2008.
1 An Analytical Model for the Dimensioning of a GPRS/EDGE Network with a Capacity Constraint on a Group of Cells r , r , r Nogueira,
CS 218- QoS Routing + CAC Fall 2003 M. Gerla et al: “Resource Allocation and Admission Control Styles in QoS DiffServ Networks,” QoS-IP 2001, Rome, Italy.
A Comparison of RaDiO and CoDiO over IEEE WLANs May 25 th Jeonghun Noh Deepesh Jain A Comparison of RaDiO and CoDiO over IEEE WLANs.
CS Spring 2011 CS 414 – Multimedia Systems Design Lecture 16 – Multimedia Transport (Part 2) Klara Nahrstedt Spring 2011.
1 Sheer volume and dynamic nature of video stresses network resources PIE: A lightweight latency control to address the buffer problem issue Rong Pan,
Achievable Service Differentiation with Token Bucket Marking for TCP S. Sahu, D.Towsley University of Massachusetts P. Nain INRIA C. Diot Sprint Labs V.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
QoS & Queuing Theory CS352.
Open Issues in Router Buffer Sizing
EE 122: Quality of Service and Resource Allocation
Computer Science Division
RAP: Rate Adaptation Protocol
Schedulability Conditions for Scheduling Algorithms
Prestented by Zhi-Sheng, Lin
Chapter-5 Traffic Engineering.
Adaptive RED: An Algorithm for Increasing the Robustness of RED’s Active Queue Management or How I learned to stop worrying and love RED Presented by:
کنترل جریان امیدرضا معروضی.
Presentation transcript:

Comments on the Performance of Measurement Based Admission Control Algorithms Lee Breslau, S. Jamin, S. Shenker Infocom 2000

Survey of Measmt Based AC Schemes Many different varieties of MBACs: Some based on “solid” math models (eg, theory of large deviations) Others “ad hoc” (no theory underpinning) Different load estimations: from simple point estimate, to exp averaging, combined mean and variance measmts, etc How to compare them? Use packet loss as measure of service failure Loss-load curve: loss rate occurring at given level of service utilization

The Ingredients of MBAC Two key components: Network load measurements (on aggregate rather than per flow) Adm control decision based on load measmt

Service Characterization Service requested by appl: defined by token bucket params – token rate r, bucket depth b Service delivered: Measured in terms of packet drop rate

MBACs surveyed Measured Sum: Token rate of new flow + aggregate measured rate of existing flows must be less than utilization threshold “Hoeffding” bounds: Peak rate of new flow + aggregate equiv bdw of existing flows must be less than link bdw Tangent of equiv bdw curve: A given “function” of equiv bdw less than link bdw Measure CAC: Peak rate of new flow + “large deviation” equiv bdw estimate less than link bdw Aggregate Traffic Envelopes, etc

Meas.mts vs Parameter Adm Control Parameter based Adm Control: Hard real time services decision based on worst case bounds typically, low network utilization Measurement based Adm Control: Soft real time services (occasional pkt loss or delay violation) Decision based on existing traffic measurements Higher utilization than parameter – based The Adm Control scheme of choice in DiffServ

MBACs surveyed (cont) Each one of the surveyed CAC schemes has two components: (a)Load estimate (including new flow) (b)Admission control decision Can pair up Load estimate and Adm decision across schemes (mix and match)!

MBACs surveyed (cont) Each scheme has a parameter that can be tuned to make it more or less “aggressive”, eg. Target loss rate or Target link utilization Performance can be measured by loss-vs- load curve

Simulation Methodology Two types of sources: ON/OFF sources: random ON and OFF intervals Video traces Sources policed by token bucket Token bucket parameters used in “parameter based” Call Admission control For ON/OFF token rate = 64kbps; bucket depth=1

Configuration Parameters Single bottleneck link: 10 Mbps Bottleneck buffer: 160 pkts Packet length: 128 bytes Heavy offered load (to force CAC and rejections)

ON/OFF traffic experiments

Mix and match: time window load estimates

Mix and match: exp avg load estimates

Mix and match: point sample load estimates

Model Robustness The experiments show extraordinary robustness of performance to different MBCA schemes Additional experiments (not shown here) show similar robustness to : very bursty ON/OFF sources; long range dependant processes; video sources etc

Heterogenous traffic Two simultaneous sources: Star Wars: 350Kbps avg, 1200 Kbps peak; r=800Kbps, b=200 Kb CRB: 800Kbps; r=800Kbps, b=1.6Kb (single pkt) Measured Sum scheme- two versions: Token rate used for new flow: SW=CBR=800; Peak rate used for new flow: SW=1200; CBR=800

Peak rate favors CBR; it leads to 3:1 CBR/SW mix; lower loss

Comparing with Ideal CAC Ideal CAC algorithm: maintain the “quota” of flows constant = N, where N is determined by target loss rate Ideal CAC has prior knowledge of current # of flows Measured Sum alg must “guess” N from load measurements; Ideal CAC is open loop; it wins as it leads to lower load fluctuations Measured Sum uses closed loop feedback control; it tend to overreact leading to higher oscillations and possible instability

Ideal CAC (ie Quota) vs Measured Sum Traffic source: ON/OFF

Ideal CAC (ie Quota)

Measured Sum

Ideal vs MS in Long Range Dependance Long Range Dep source: ON/OFF interval Pareto distributed; flow lifetime lognormal “Quota” does not work very well here: no notion of ideal quota valid all the time Measured Sum, on the other hand, can track the flow fluctuations => lower loss rate!

Quota vs Measured Sum Long range dep sources

Can we predict MBAC loss? Network operators would like to predict loss to set operating point (eg, target utilization in the Measured Sum scheme) Question: can we preselect the “control knobs” and expect results consistent with prediction? Answer: not quite! Better to measure resulting loss rate and adjust knobs accordingly Results in next slide are based on: –MC scheme: measure CAC – large dev estimate of existing flows + peak of new flow –TE (Traffic Envelope): measured max aggregate envelope of existing + peak of new flow

Conclusions All MBAC schemes achieve identical loss-load performance (no matter the effort spent in developing sophisticated measurements) Flow heterogeneity must be addressed by policy – aggregated measured based control is unfair MBAC does better than Ideal “Quota” scheme in Long Range Dependency Predictive “knobs” do not work well; need to monitor loss directly and use feedback