Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1282380.1282419acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free access

Cloud control with distributed rate limiting

Published: 27 August 2007 Publication History

Abstract

Today's cloud-based services integrate globally distributed resources into seamless computing platforms. Provisioning and accounting for the resource usage of these Internet-scale applications presents a challenging technical problem. This paper presents the design and implementation of distributed rate limiters, which work together to enforce a global rate limit across traffic aggregates at multiple sites, enabling the coordinated policing of a cloud-based service's network traffic. Our abstraction not only enforces a global limit, but also ensures that congestion-responsive transport-layer flows behave as if they traversed a single, shared limiter. We present two designs - one general purpose, and one optimized for TCP - that allow service operators to explicitly trade off between communication costs and system accuracy, efficiency, and scalability. Both designs are capable of rate limiting thousands of flows with negligible overhead (less than 3% in the tested configuration). We demonstrate that our TCP-centric design is scalable to hundreds of nodes while robust to both loss and communication delay, making it practical for deployment in nationwide service providers.

References

[1]
Packeteer. http://www.packeteer.com.
[2]
Akamai Technologies. Personal communication, June 2007.
[3]
Amazon. Elastic compute cloud. http://aws.amazon.com/ec2.
[4]
G. Appenzeller, I. Keslassy, and N. McKeown. Sizing router buffers. In Proceedings of ACM SIGCOMM, 2004.
[5]
B. Babcock and C. Olston. Distributed top-k monitoring. In Proceedings of ACM SIGMOD, 2003.
[6]
D. Bertsekas and R. Gallager. Data Networks. Prentice Hall, 1987.
[7]
S. Bhatnagar and B. Nath. Distributed admission control to support guaranteed services in core-stateless networks. In Proceedings of IEEE INFOCOM, 2003.
[8]
D. F. Carr. How Google works. Baseline Magazine, July 2006.
[9]
G. Carraro and F. Chong. Software as a service (SaaS): An enterprise perspective. MSDN Solution Architecture Center, Oct. 2006.
[10]
A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In Proceedings of ACM PODC, 1987.
[11]
A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In Proceedings of ACM SIGCOMM, 1989.
[12]
M. Dilman and D. Raz. Efficient reactive monitoring. In Proceedings of IEEE INFOCOM, 2001.
[13]
W. Feng, K. Shin, D. Kandlur, and D. Saha. The blue active queue management algorithms. IEEE/ACM Transactions on Networking, 10(4), 2002.
[14]
S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking, 1(4), 1993.
[15]
S. Floyd and V. Jacobson. Link-sharing and resource management models for packet networks. IEEE/ACM Transactions on Networking, 3(4), 1995.
[16]
I. Gupta, A.-M. Kermarrec, and A. J. Ganesh. Efficient epidemic-style protocols for reliable and scalable multicast. In Proceedings of IEEE SRDS, 2002.
[17]
D. Hinchcliffe. 2007: The year enterprises open thier SOAs to the Internet? Enterprise Web 2.0, Jan. 2007.
[18]
M. Huang. Planetlab bandwidth limits. http://www.planet-lab.org/doc/BandwidthLimits.php.
[19]
A. Jain, J. M. Hellerstein, S. Ratnasamy, and D. Wetherall. A wakeup call for internet monitoring systems: The case for distributed triggers. In Proceedings of HotNets-III, 2004.
[20]
R. Jain, D. M. Chiu, and W. Hawe. A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. Technical report, DEC Research Report TR-301, 1984.
[21]
S. Jamin, P. Danzig, S. Shenker, and L. Zhang. A measurement-based admission control algorithm for integrated services packet networks. In Proceedings of ACM SIGCOMM, 1995.
[22]
D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation ofaggregate information. In Proceedings of IEEE FOCS, 2003.
[23]
A. Kumar, R. Rastogi, A. Siberschatz, and B. Yener. Algorithms for provisioning virtual private networks in the hose model. IEEE/ACM Transactions on Networking, 10(4), 2002.
[24]
J. Liang, S. Y. Ko, I. Gupta, and K. Nahrstedt. MON: On-demand overlays for distributed system management. In Proceedings of USENIX WORLDS, 2005.
[25]
J. Ma, K. Levchenko, C. Kriebich, S. Savage, and G. M. Voelker. Automated protocol inference: Unexpected means of identifying protocols. In Proceedings of ACM/USENIX IMC, 2006.
[26]
A. Manjhi, V. Shkapenyuk, K. Dhamdhere, and C. Olston. Finding(recently) frequent items in distributed data streams. In Proceedings of IEEE ICDE, 2005.
[27]
P. Marks. Mashup' websites are a hacker's dream come true. New Scientist magazine, 2551:28, May 2006.
[28]
R. Morris. TCP behavior with many flows. In Proceedings of IEEE ICNP, 1997.
[29]
J. Musser. Programmable web. http://www.programmableweb.com.
[30]
A. M. Odlyzko. Internet pricing and the history of communications. Computer Networks, 36:493--517, 2001.
[31]
A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Transactions on Networking, 1(3), 1993.
[32]
B. Raghavan and A. C. Snoeren. A system for authenticated policy-compliant routing. In Proceedings of ACM SIGCOMM, 2004.
[33]
N. Shavit and A. Zemach. Diffracting trees. ACM Transactions on Computer Systems, 14(4), 1996.
[34]
I. Stoica, S. Shenker, and H. Zhang. Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high speed networks. In Proceedings of ACM SIGCOMM, 1998.
[35]
A. Vahdat, K. Yocum, K. Walsh, P. Mahadevan, D. Kostić, J. Chase, and D. Becker. Scalability and accuracy in a large-scale network emulator. In Proceedings of USENIX OSDI, 2002.
[36]
K. Vishwanath and A. Vahdat. Realistic and responsive network traffic generation. In Proceedings of ACM SIGCOMM, 2006.
[37]
L. Wang, K. Park, R. Pang, V. S. Pai, and L. Peterson. Reliability and security in the CoDeeN content distribution network. In Proceedings of USENIX, 2004.
[38]
R. Wattenhofer and P.Widmayer. An inherent bottleneck in distributed counting. In Proceedings of ACM PODC, 1997.
[39]
X. Yang, D. Wetherall, and T. Anderson. A DoS-limiting network architecture. In Proceedings of ACM SIGCOMM, 2005.
[40]
Z.-L. Zhang, Z. Duan, and Y. T. Hou. On scalable design of bandwidth brokers. IEICE Transactions on Communications, E84-B(8), 2001.
[41]
T. Zhao and V. Karamcheti. Enforcing resource sharing agreements among distributed server clusters. In Proceedings of IEEE IPDPS, 2002.

Cited By

View all
  • (2024)CMDRL: A Markovian Distributed Rate Limiting Algorithm in Cloud NetworksProceedings of the 8th Asia-Pacific Workshop on Networking10.1145/3663408.3663417(59-66)Online publication date: 3-Aug-2024
  • (2024)Consensus With a Linear ConstraintIEEE Transactions on Automatic Control10.1109/TAC.2023.331568869:1(645-650)Online publication date: Jan-2024
  • (2021)Scalable On-Switch Rate Limiters for the CloudIEEE INFOCOM 2021 - IEEE Conference on Computer Communications10.1109/INFOCOM42981.2021.9488773(1-10)Online publication date: 10-May-2021
  • Show More Cited By

Index Terms

  1. Cloud control with distributed rate limiting

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SIGCOMM '07: Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
    August 2007
    432 pages
    ISBN:9781595937131
    DOI:10.1145/1282380
    • cover image ACM SIGCOMM Computer Communication Review
      ACM SIGCOMM Computer Communication Review  Volume 37, Issue 4
      October 2007
      420 pages
      ISSN:0146-4833
      DOI:10.1145/1282427
      Issue’s Table of Contents
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 27 August 2007

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. CDN
    2. rate limiting
    3. token bucket

    Qualifiers

    • Article

    Conference

    SIGCOMM07
    Sponsor:
    SIGCOMM07: ACM SIGCOMM 2007 Conference
    August 27 - 31, 2007
    Kyoto, Japan

    Acceptance Rates

    Overall Acceptance Rate 462 of 3,389 submissions, 14%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)291
    • Downloads (Last 6 weeks)33
    Reflects downloads up to 21 Sep 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)CMDRL: A Markovian Distributed Rate Limiting Algorithm in Cloud NetworksProceedings of the 8th Asia-Pacific Workshop on Networking10.1145/3663408.3663417(59-66)Online publication date: 3-Aug-2024
    • (2024)Consensus With a Linear ConstraintIEEE Transactions on Automatic Control10.1109/TAC.2023.331568869:1(645-650)Online publication date: Jan-2024
    • (2021)Scalable On-Switch Rate Limiters for the CloudIEEE INFOCOM 2021 - IEEE Conference on Computer Communications10.1109/INFOCOM42981.2021.9488773(1-10)Online publication date: 10-May-2021
    • (2020)Network Traffic Compression With Side InformationIEEE Access10.1109/ACCESS.2020.29943198(90023-90034)Online publication date: 2020
    • (2020)Cardinality Based Rate Limiting System for Time-Series DataCloud Computing – CLOUD 202010.1007/978-3-030-59635-4_18(250-260)Online publication date: 18-Sep-2020
    • (2019)LoomProceedings of the 16th USENIX Conference on Networked Systems Design and Implementation10.5555/3323234.3323238(33-46)Online publication date: 26-Feb-2019
    • (2019)A secured best data centre selection in cloud computing using encryption techniqueInternational Journal of Business Intelligence and Data Mining10.5555/3302593.330260614:1-2(199-217)Online publication date: 1-Jan-2019
    • (2019)Architecting Programmable Data Plane Defenses into the Network with FastFlexProceedings of the 18th ACM Workshop on Hot Topics in Networks10.1145/3365609.3365860(161-169)Online publication date: 13-Nov-2019
    • (2019)Fully Functional Rate Limiter Design on Programmable Hardware SwitchesProceedings of the ACM SIGCOMM 2019 Conference Posters and Demos10.1145/3342280.3342344(159-160)Online publication date: 19-Aug-2019
    • (2018)Mechanisms and Policies for Controlling Distributed Solar CapacityACM Transactions on Sensor Networks10.1145/321981114:3-4(1-28)Online publication date: 4-Dec-2018
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media