Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article
Open access

BwE: Flexible, Hierarchical Bandwidth Allocation for WAN Distributed Computing

Published: 17 August 2015 Publication History

Abstract

WAN bandwidth remains a constrained resource that is economically infeasible to substantially overprovision. Hence, it is important to allocate capacity according to service priority and based on the incremental value of additional allocation. For example, it may be the highest priority for one service to receive 10Gb/s of bandwidth but upon reaching such an allocation, incremental priority may drop sharply favoring allocation to other services. Motivated by the observation that individual flows with fixed priority may not be the ideal basis for bandwidth allocation, we present the design and implementation of Bandwidth Enforcer (BwE), a global, hierarchical bandwidth allocation infrastructure. BwE supports: i) service-level bandwidth allocation following prioritized bandwidth functions where a service can represent an arbitrary collection of flows, ii)independent allocation and delegation policies according to user-defined hierarchy, all accounting for a global view of bandwidth and failure conditions, iii) multi-path forwarding common in traffic-engineered networks, and iv) a central administrative point to override (perhaps faulty) policy during exceptional conditions. BwE has delivered more service efficient bandwidth utilization and simpler management in production for multiple years.

Supplementary Material

WEBM File (p1-kumar.webm)

References

[1]
Wikipedia: Differentiated services. http://en.wikipedia.org/wiki/Differentiated_services.
[2]
Allalouf, M., and Shavitt, Y. Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation. IEEE/ACM Trans. Networking 16, 5 (2008), 1015--1024.
[3]
Balakrishnan, H., Rahul, H. S., and Seshan, S. An integrated congestion management architecture for internet hosts. In In Proc. ACM SIGCOMM (1999), pp. 175--187.
[4]
Ballani, H., Costa, P., Karagiannis, T., and Rowstron, A. Towards predictable datacenter networks. In SIGCOMM (2011).
[5]
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., and Weiss, W. An Architecture for Differentiated Service. RFC 2475 (Informational), December 1998. Updated by RFC 3260.
[6]
Boudec, J.-Y. Rate adaptation, congestion control and fairness: A tutorial, 2000.
[7]
Braden, R., Zhang, L., Berson, S., Herzog, S., and Jamin, S. Resource ReSerVation Protocol (RSVP) -- Version 1 Functional Specification. RFC 2205 (Proposed Standard), September 1997. Updated by RFCs 2750, 3936, 4495.
[8]
Cao, Z., and Zegura, E. W. Utility max-min: An application-oriented bandwidth allocation scheme. In INFOCOM (1999).
[9]
Choi, B.-K., and Bettati, R. Endpoint admission control: network based approach. In Distributed Computing Systems, 2001. 21st International Conference on. (Apr 2001), pp. 227--235.
[10]
Clark, D. D., Lambert, M. L., and Zhang, L. Netblt: A high throughput transport protocol. In Proceedings of the ACM Workshop on Frontiers in Computer Communications Technology (New York, NY, USA, 1988), SIGCOMM '87, ACM, pp. 353--359.
[11]
Danna, E., Hassidim, A., Kaplan, H., Kumar, A., Mansour, Y., Raz, D., and Segalov, M. Upward Max Min Fairness. In INFOCOM (2012), pp. 837--845.
[12]
Danna, E., Mandal, S., and Singh, A. A Practical Algorithm for Balancing the Max-min Fairness and Throughput Objectives in Traffic Engineering. In Proc. INFOCOM (March 2012), pp. 846--854.
[13]
Dean, J., and Ghemawat, S. Mapreduce: Simplified data processing on large clusters. Commun. ACM 51, 1 (January 2008), 107--113.
[14]
Fortz, B., Rexford, J., and Thorup, M. Traffic Engineering with Traditional IP Routing Protocols. IEEE Communications Magazine 40 (2002), 118--124.
[15]
Guo, C., Lu, G., Wang, H. J., Yang, S., Kong, C., Sun, P., Wu, W., and Zhang, Y. SecondNet: A data center network virtualization architecture with bandwidth guarantees. In CoNEXT (2010).
[16]
Hong, C.-Y., Kandula, S., Mahajan, R., Zhang, M., Gill, V., Nanduri, M., and Wattenhofer, R. Have Your Network and Use It Fully Too: Achieving High Utilization in Inter-Datacenter WANs. In Proc. SIGCOMM (August 2013).
[17]
Jain, S., Kumar, A., Mandal, S., Ong, J., Poutievski, L., Singh, A., Venkata, S., Wanderer, J., Zhou, J., Zhu, M., Zolla, J., Hölzle, U., Stuart, S., and Vahdat, A. B4: Experience with a Globally-Deployed Software Defined WAN. In Proceedings of the ACM SIGCOMM 2013 (2013), ACM, pp. 3--14.
[18]
Jeyakumar, V., Alizadeh, M., Mazieres, D., Prabhakar, B., Kim, C., and Greenberg, A. Eyeq: Practical network performance isolation at the edge. In Proc. of NSDI (2013), USENIX Association, pp. 297--312.
[19]
Kandula, S., Menache, I., Schwartz, R., and Babbula, S. R. Calendaring for wide area networks. In Proc. SIGCOMM (August 2014).
[20]
Lam, T., Radhakrishnan, S., Vahdat, A., and Varghese, G. NetShare: Virtualizing data center networks across services. Tech. rep., 2010.
[21]
Minei, I., and Lucek, J. MPLS-Enabled Applications: Emerging Developments and New Technologies. Wiley Series on Communications Networking & Distributed Systems. Wiley, 2008.
[22]
Osborne, E., and Simha, A. Traffic Engineering with Mpls (Paperback). Networking Technology Series. Cisco Press, 2002.
[23]
Popa, L., Krishnamurthy, A., Ratnasamy, S., and Stoica, I. Faircloud: Sharing the network in cloud computing. In Proceedings of the 10th ACM Workshop on Hot Topics in Networks (New York, NY, USA, 2011), HotNets-X, ACM, pp. 22:1--22:6.
[24]
Popa, L., Yalagandula, P., Banerjee, S., Mogul, J. C., Turner, Y., and Santos, J. R. Elasticswitch: Practical work-conserving bandwidth guarantees for cloud computing. In Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM (New York, NY, USA, 2013), SIGCOMM '13, ACM, pp. 351--362.
[25]
Raghavan, B., Vishwanath, K., Ramabhadran, S., Yocum, K., and Snoeren, A. C. Cloud control with distributed rate limiting. In In SIGCOMM (2007).
[26]
Rodrigues, H., Santos, J., Turner, Y., Soares, P., and Guedes, D. Gatekeeper: Supporting bandwidth guarantees for multi-tenant datacenter networks. In Workshop on I/O Virtualization (2011).
[27]
Roughan, M., Thorup, M., and Zhang, Y. Traffic Engineering with Estimated Traffic Matrices. In Proc. IMC (2003), pp. 248--258.
[28]
Saltzer, J. H., Reed, D. P., and Clark, D. D. End-to-end arguments in system design. ACM Trans. Comput. Syst. 2, 4 (November 1984), 277--288.
[29]
Sarma, S., Brock, D. L., and Ashton, K. The networked physical world--proposals for engineering the next generation of computing, commerce & automatic identification. White Paper, Auto-ID Center, MIT. Designed b y Foxner. www. foxner. com (2000).
[30]
Shieh, A., Kandula, S., Greenberg, A., Kim, C., and Saha, B. Sharing the data center network. In NSDI (2011).

Cited By

View all
  • (2024)Improving Scalability in Traffic Engineering via Optical Topology ProgrammingIEEE Transactions on Network and Service Management10.1109/TNSM.2023.333589821:2(1581-1600)Online publication date: Apr-2024
  • (2024)Enforcing Fairness in the Traffic Policer Among Heterogeneous Congestion Control AlgorithmsIEEE/ACM Transactions on Networking10.1109/TNET.2023.327641032:1(34-49)Online publication date: Feb-2024
  • (2023)ONE PASS PACKET STEERING IN SOFTWARE DEFINED DATA CENTERSinternational journal of engineering technology and management sciences10.46647/ijetms.2023.v07i02.0577:2(494-501)Online publication date: 2023
  • Show More Cited By

Index Terms

  1. BwE: Flexible, Hierarchical Bandwidth Allocation for WAN Distributed Computing

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM SIGCOMM Computer Communication Review
      ACM SIGCOMM Computer Communication Review  Volume 45, Issue 4
      SIGCOMM'15
      October 2015
      659 pages
      ISSN:0146-4833
      DOI:10.1145/2829988
      Issue’s Table of Contents
      • cover image ACM Conferences
        SIGCOMM '15: Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication
        August 2015
        684 pages
        ISBN:9781450335423
        DOI:10.1145/2785956
      Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 17 August 2015
      Published in SIGCOMM-CCR Volume 45, Issue 4

      Check for updates

      Author Tags

      1. bandwidth allocation
      2. max-min fair
      3. software-defined network
      4. wide-area networks

      Qualifiers

      • Research-article

      Funding Sources

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)501
      • Downloads (Last 6 weeks)69
      Reflects downloads up to 01 Mar 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Improving Scalability in Traffic Engineering via Optical Topology ProgrammingIEEE Transactions on Network and Service Management10.1109/TNSM.2023.333589821:2(1581-1600)Online publication date: Apr-2024
      • (2024)Enforcing Fairness in the Traffic Policer Among Heterogeneous Congestion Control AlgorithmsIEEE/ACM Transactions on Networking10.1109/TNET.2023.327641032:1(34-49)Online publication date: Feb-2024
      • (2023)ONE PASS PACKET STEERING IN SOFTWARE DEFINED DATA CENTERSinternational journal of engineering technology and management sciences10.46647/ijetms.2023.v07i02.0577:2(494-501)Online publication date: 2023
      • (2023)Principled Schedulability Analysis for Distributed Storage Systems Using Thread Architecture ModelsACM Transactions on Storage10.1145/357432319:2(1-47)Online publication date: 6-Mar-2023
      • (2023)Comparative Synthesis: Learning Near-Optimal Network Designs by QueryProceedings of the ACM on Programming Languages10.1145/35711977:POPL(91-120)Online publication date: 11-Jan-2023
      • (2023)CocoSketch: High-Performance Sketch-Based Measurement Over Arbitrary Partial Key QueryIEEE/ACM Transactions on Networking10.1109/TNET.2023.325722631:6(2653-2668)Online publication date: Dec-2023
      • (2023)LINA: A Fair Link-Grained Inter-Datacenter Traffic Scheduling Method With Deadline GuaranteeIEEE Transactions on Cognitive Communications and Networking10.1109/TCCN.2022.32293679:2(507-520)Online publication date: Apr-2023
      • (2023)Burst can be Harmless: Achieving Line-rate Software Traffic Shaping by Inter-flow BatchingIEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10229082(1-10)Online publication date: 17-May-2023
      • (2022)Deadline-Aware Fast One-to-Many Bulk Transfers over Inter-Datacenter NetworksIEEE Transactions on Cloud Computing10.1109/TCC.2019.293543510:1(304-321)Online publication date: 1-Jan-2022
      • (2021)Persistent memory aware performance isolation with dicioProceedings of the 12th ACM SIGOPS Asia-Pacific Workshop on Systems10.1145/3476886.3477517(97-105)Online publication date: 24-Aug-2021
      • Show More Cited By

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Login options

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media