Cloud Control with Distributed Rate Limiting Barath Raghavan, Kashi Vishwanath Sriram Ramabhadran, Kenneth Yocum & Alex C.Snoeren Offence: Alex Kiaie &

Slides:

Advertisements

Similar presentations

THE CENTRAL LIMIT THEOREM

Advertisements

IP Traceback in Cloud Computing Through Deterministic Flow Marking Mouiad Abid Hani Presentation figures are from references given on slide 21. By Presented.

Barath Raghavan, Kashi Vishwanath, Sriram Ramabhadran, Kenneth Yocum, Alex C. Snoeren Defense: Rejaie Johnson, Xian Yi Teng.

Cloud Control with Distributed Rate Limiting Raghaven et all Presented by: Brian Card CS Fall Kinicki 1.

Managing Cloud Resources: Distributed Rate Limiting Alex C. Snoeren Kevin Webb, Bhanu Chandra Vattikonda, Barath Raghavan, Kashi Vishwanath, Sriram Ramabhadran,

Cloud Control with Distributed Rate Limiting Barath Raghavan, Kashi Vishwanath, Sriram Ramabhadran, Kenneth Yocum, and Alex C. Snoeren University of California,

Sampling: Final and Initial Sample Size Determination

Doc.: IEEE /0709r2 Submission July 2009 Carlos Cordeiro, IntelSlide 1 Lightly Compressed Video Traffic Modeling Date: Authors: NameAffiliationsAddressPhone .

SEEDING CLOUD-BASED SERVICES: DISTRIBUTED RATE LIMITING (DRL) Kevin Webb, Barath Raghavan, Kashi Vishwanath, Sriram Ramabhadran, Kenneth Yocum, and Alex.

Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,

1 School of Computing Science Simon Fraser University, Canada PCP: A Probabilistic Coverage Protocol for Wireless Sensor Networks Mohamed Hefeeda and Hossein.

Measures of Central Tendency. Central Tendency “Values that describe the middle, or central, characteristics of a set of data” Terms used to describe.

Overlay Networks + Internet routing has exhibited scalability - Internet routing is inefficient -Difficult to add intelligence to Internet Solution: Overlay.

Pricing Granularity for Congestion-Sensitive Pricing Murat Yüksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute, Troy, NY {yuksem, shivkuma}

Proportional Bandwidth Allocation in DiffServ Networks Usman Raza Chohan

Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.

A simulation-based comparative evaluation of transport protocols for SIP Authors: M.Lulling*, J.Vaughan Department of Computer science, University college.

Distributed Cluster Repair for OceanStore Irena Nadjakova and Arindam Chakrabarti Acknowledgements: Hakim Weatherspoon John Kubiatowicz.

OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.

Before start… Earlier work single-path routing in sensor networks

Solving the Protein Threading Problem in Parallel Nocola Yanev, Rumen Andonov Indrajit Bhattacharya CMSC 838T Presentation.

Performance Evaluation

Evolutionary Computational Intelligence Lecture 9: Noisy Fitness Ferrante Neri University of Jyväskylä.

Random Early Detection Gateways for Congestion Avoidance

1 QoS Schemes for IEEE Wireless LAN – An Evaluation by Anders Lindgren, Andreas Almquist and Olov Schelen Presented by Tony Sung, 10 th Feburary.

Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,

Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.

Population Proportion The fraction of values in a population which have a specific attribute p = Population proportion X = Number of items having the attribute.

Diffusion Early Marking Department of Electrical and Computer Engineering University of Delaware May / 2004 Rafael Nunez Gonzalo Arce.

Advanced Computer Networks : RED 1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking,

QUIZ CHAPTER Seven Psy302 Quantitative Methods. 1. A distribution of all sample means or sample variances that could be obtained in samples of a given.

A Distributed and Privacy Preserving Algorithm for Identifying Information Hubs in Social Networks M.U. Ilyas, Z Shafiq, Alex Liu, H Radha Michigan State.

1 Real-Time Traffic over the IEEE Medium Access Control Layer Tian He J. Sobrinho and A. krishnakumar.

1 Enabling Large Scale Network Simulation with 100 Million Nodes using Grid Infrastructure Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.

Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random Walks Bo Han, Aravind Srinivasan University of Maryland.

Peer-to-Peer AOI Voice Chatting for Massively Multiplayer Online Games (P2P-NVE 2007 workshop) Jehn-Ruey Jiang and Hung-Shiang Chen Adaptive Computing.

Terminodes and Sybil: Public-key management in MANET Dave MacCallum (Brendon Stanton) Apr. 9, 2004.

A Prediction-based Fair Replication Algorithm in Structured P2P Systems Xianshu Zhu, Dafang Zhang, Wenjia Li, Kun Huang Presented by: Xianshu Zhu College.

Review from before Christmas Break. Sampling Distributions Properties of a sampling distribution of means:

Scalable Web Server on Heterogeneous Cluster CHEN Ge.

Distributed Session Announcement Agents for Real-time Streaming Applications Keio University, Graduate School of Media and Governance Kazuhiro Mishima.

ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.

Peer-to-Peer AOI Voice Chatting for Massively Multiplayer Online Games (P2P-NVE 2007 workshop) Jehn-Ruey Jiang and Hung-Shiang Chen Presenter: Shun-Yun.

Sampling Distributions. Essential Question: How is the mean of a sampling distribution related to the population mean or proportion?

Localized Algorithm for Aggregate Fairness in Wireless Sensor Networks Authors : Shigang Chen, Zhan Zhang CISE university of Florida CISE university of.

1 A paper by Yi-Bing Lin IEEE Transactions on Mobile Computing Vol. 4, No. 2, March/April ’05 Presented by Derek Pennington Per-User Checkpointing For.

WHY DO WE. ?. Recycling Recycling helps extend the life and usefulness of something that has already served its initial purpose by producing something.

Building a Distributed Full-Text Index for the Web by Sergey Melnik, Sriram Raghavan, Beverly Yang and Hector Garcia-Molina from Stanford University Presented.

Comment on “A New Simple Square Root Option Pricing Model” written by Camara and Wang San-Lin Chung Department of Finance National Taiwan University.

CS 484 Load Balancing. Goal: All processors working all the time Efficiency of 1 Distribute the load (work) to meet the goal Two types of load balancing.

Dynamic Bandwidth Allocation with Fair Scheduling For WCDMA Systems Liang Xu, Xumin Shen, and Jon W. Mark University of Waterloo published in IEEE Wireless.

COSC 5341 High-Performance Computer Networks Presentation for By Linghai Zhang ID:

Random Early Detection (RED) Router notifies source before congestion happens - just drop the packet (TCP will timeout and adjust its window) - could make.

Writing a summary. To write a summary, use your own words to express briefly the main idea and relevant details of the piece you have read. Your purpose.

@ Carnegie Mellon Databases 1 Finding Frequent Items in Distributed Data Streams Amit Manjhi V. Shkapenyuk, K. Dhamdhere, C. Olston Carnegie Mellon University.

Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.

Estimation by Intervals Confidence Interval. Suppose we wanted to estimate the proportion of blue candies in a VERY large bowl. We could take a sample.

Error Explanation with Distance Metrics Authors: Alex Groce, Sagar Chaki, Daniel Kroening, and Ofer Strichman International Journal on Software Tools for.

Network Computing Laboratory Load Balancing and Stability Issues in Algorithms for Service Composition Bhaskaran Raman & Randy H.Katz U.C Berkeley INFOCOM.

ECEN 619, Internet Protocols and Modeling Prof. Xi Zhang Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions.

Dynamic Sessions. Assumptions Builds on Browser Binding Sessions –Security related –Limit Assertion validity Central Session Authority –Maintains global.

Dynamic Load Balancing Tree and Structured Computations.

Distributed Localization Using a Moving Beacon in Wireless Sensor Networks IEEE Transactions on Parallel and Distributed System, Vol. 19, No. 5, May 2008.

Soumya Sen (UPenn), Supervisors: Carl Livadas, Eve Schooler, DDI team

Activity Based Costing

What mark would you give this answer ______out of _____

Section 3: Estimating p in a binomial distribution

RAP: Rate Adaptation Protocol

Pramod Bhatotia, Ruichuan Chen, Myungjin Lee

Comment on EU precision requirements

Presentation transcript:

Cloud Control with Distributed Rate Limiting Barath Raghavan, Kashi Vishwanath Sriram Ramabhadran, Kenneth Yocum & Alex C.Snoeren Offence: Alex Kiaie & Shiqi Chen

Problems and Flaws Global Random Drop Global Random Drop  Longer estimate interval VS overhead  What happened to GRD at last? Central Token Bucket Central Token Bucket Flow Proportional Share Flow Proportional Share  Gossip Protocal  Exceeding limit  Evaluation on PlanetLab

Global Random Drop GRD definitely works better under shorter estimate interval, but how about the overhead generated by frequent communication? GRD definitely works better under shorter estimate interval, but how about the overhead generated by frequent communication?

Global Random Drop It seems this paper proposes GRD and drops it in the end without a good reason. It seems this paper proposes GRD and drops it in the end without a good reason. What ’ s the purpose of proposing GRD then? Only to show FPS sucks in maintaining fairness? What ’ s the purpose of proposing GRD then? Only to show FPS sucks in maintaining fairness?

Central Token Bucket Seems the authors design everything to approximate the performance of CTB. So why don ’ t we just stick to CTB and keep life simple?? Seems the authors design everything to approximate the performance of CTB. So why don ’ t we just stick to CTB and keep life simple??

Flow Proportional Share FTP works fine under Branch = 5 or 7 for 500 limiters. But as the performance for Branch = 1 worsens a lot when we have more than 400 limiters. What will the changing point be for Branch =5 or 7? Or should we abandon the Gossip Protocal?

Flow Proportional Share We can see the FPS scheme is very ‘ stable ’ in 500-ms estimate interval condition. BUT why half of the time the aggregate rate is above the 10Mps limit??

Flow Proportional Share Evaluation on PlanetLab? Evaluation on PlanetLab? We ’ ve already doubted the credibility of PlanetLab for millions of times in this class … We ’ ve already doubted the credibility of PlanetLab for millions of times in this class … And the evaluation scale is really small … And the evaluation scale is really small …

Flow Proportional Share And we noticed some performance we did not see in previous evaluation result of stable implementations. How to explain this? Does it imply that there could be more problem with real network implementation?

Thank you! Any comment? Question? Any comment? Question?