skip to main content
10.1145/2486001.2486012acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Free access

Achieving high utilization with software-driven WAN

Published: 27 August 2013 Publication History
  • Get Citation Alerts
  • Abstract

    We present SWAN, a system that boosts the utilization of inter-datacenter networks by centrally controlling when and how much traffic each service sends and frequently re-configuring the network's data plane to match current traffic demand. But done simplistically, these re-configurations can also cause severe, transient congestion because different switches may apply updates at different times. We develop a novel technique that leverages a small amount of scratch capacity on links to apply updates in a provably congestion-free manner, without making any assumptions about the order and timing of updates at individual switches. Further, to scale to large networks in the face of limited forwarding table capacity, SWAN greedily selects a small set of entries that can best satisfy current demand. It updates this set without disrupting traffic by leveraging a small amount of scratch capacity in forwarding tables. Experiments using a testbed prototype and data-driven simulations of two production networks show that SWAN carries 60% more traffic than the current practice.

    References

    [1]
    M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat. Hedera: Dynamic ow scheduling for data center networks. In NSDI, 2010.
    [2]
    D. Applegate and M. Thorup. Load optimal MPLS routing with N+M labels. In INFOCOM, 2003.
    [3]
    D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, and G. Swallow. RSVP-TE: Extensions to RSVP for LSP tunnels. RFC 3209, 2001.
    [4]
    D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, and J. McManus. Requirements for traffic engineering over MPLS. RFC 2702, 1999.
    [5]
    H. Ballani, P. Costa, T. Karagiannis, and A. Rowstron. Towards predictable datacenter networks. In SIGCOMM, 2011.
    [6]
    Y. Chen, S. Jain, V. K. Adhikari, Z.-L. Zhang, and K. Xu. A first look at inter-data center traffic characteristics via Yahoo! datasets. In INFOCOM, 2011.
    [7]
    M. Chowdhury, M. Zaharia, J. Ma, M. I. Jordan, and I. Stoica. Managing data transfers in computer clusters with Orchestra. In SIGCOMM, 2011.
    [8]
    A. R. Curtis, J. C. Mogul, J. Tourrilhes, P. Yalagandula, P. Sharma, and S. Banerjee. DevoFlow: Scaling flow management for high-performance networks. In SIGCOMM, 2011.
    [9]
    {9} E. Danna, S. Mandal, and A. Singh. A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering. In INFOCOM, 2012.
    [10]
    A. Elwalid, C. Jin, S. Low, and I. Widjaja. MATE: MPLS adaptive traffic engineering. In INFOCOM, 2001.
    [11]
    Project Floodlight. http://www.projectfloodlight.org/.
    [12]
    B. Fortz, J. Rexford, and M. Thorup. Traffic engineering with traditional IP routing protocols. IEEE Comm. Mag., 2002.
    [13]
    T. Hartman, A. Hassidim, H. Kaplan, D. Raz, and M. Segalov. How to split a flow? In INFOCOM, 2012.
    [14]
    C.-Y. Hong, S. Kandula, R. Mahajan, M. Zhang, V. Gill, M. Nanduri, and R. Wattenhofer. Achieving high utilization with software-driven WAN (extended version). Microsoft Research Technical Report 2013--54, 2013.
    [15]
    S. Jain et al. B4: Experience with a globally-deployed software defined WAN. In SIGCOMM, 2013.
    [16]
    V. Jeyakumar, M. Alizadeh, D. Mazières, B. Prabhakar, and C. Kim. EyeQ: Practical network performance isolation for the multi-tenant cloud. In HotCloud, 2012.
    [17]
    S. Kandula, D. Katabi, B. Davie, and A. Charny. Walking the tightrope: Responsive yet stable traffic engineering. In SIGCOMM, 2005.
    [18]
    S. Kandula, D. Katabi, S. Sinha, and A. Berger. Dynamic load balancing without packet reordering. SIGCOMM CCR, 2007.
    [19]
    N. Kushman, S. Kandula, D. Katabi, and B. M. Maggs. R-BGP: Staying connected in a connected world. In NSDI, 2007.
    [20]
    C. Labovitz, S. Iekel-Johnson, D. McPherson, J. Oberheide, and F. Jahanian. Internet inter-domain traffic. SIGCOMM Comput. Commun. Rev., 2010.
    [21]
    N. Laoutaris, M. Sirivianos, X. Yang, and P. Rodriguez. Inter-datacenter bulk transfers with NetStitcher. In SIGCOMM, 2011.
    [22]
    A. Mahimkar, A. Chiu, R. Doverspike, M. D. Feuer, P. Magill, E. Mavrogiorgis, J. Pastor, S. L. Woodward, and J. Yates. Bandwidth on demand for inter-data center communication. In HotNets, 2011.
    [23]
    R. McGeer. A safe, efficient update protocol for OpenFlow networks. In HotSDN, 2012.
    [24]
    M. Meyer and J. Vasseur. MPLS traffic engineering soft preemption. RFC 5712, 2010.
    [25]
    V. S. Mirrokni, M. Thottan, H. Uzunalioglu, and S. Paul. A simple polynomial time framework for reduced-path decomposition in multi-path routing. In INFOCOM, 2004.
    [26]
    D. Nace, N.-L. Doan, E. Gourdin, and B. Liau. Computing optimal max-min fair resource allocation for elastic flows. IEEE/ACM Trans. Netw., 2006.
    [27]
    A. Pathak, M. Zhang, Y. C. Hu, R. Mahajan, and D. Maltz. Latency inflation with MPLS-based traffic engineering. In IMC, 2011.
    [28]
    L. Popa, G. Kumar, M. Chowdhury, A. Krishnamurthy, S. Ratnasamy, and I. Stoica. FairCloud: Sharing the network in cloud computing. In SIGCOMM, 2012.
    [29]
    M. Reitblatt, N. Foster, J. Rexford, C. Schlesinger, and D. Walker. Abstractions for network update. In SIGCOMM, 2012.
    [30]
    M. Roughan, A. Greenberg, C. Kalmanek, M. Rumsewicz, J. Yates, and Y. Zhang. Experience in measuring backbone traffic variability: Models, metrics, measurements and meaning. In Internet Measurement Workshop, 2002.
    [31]
    A. Shieh, S. Kandula, A. Greenberg, C. Kim, and B. Saha. Sharing the data center network. In NSDI, 2011.
    [32]
    S. Traverso, K. Huguenin, I. Trestian, V. Erramilli, N. Laoutaris, and K. Papagiannaki. Tailgate: handling long-tail content with a little help from friends. In WWW, 2012.
    [33]
    Broadcom Trident II series. http://www.broadcom.com/docs/ features/StrataXGS_Trident_II_presentation.pdf, 2012.
    [34]
    L. Vanbever, S. Vissicchio, C. Pelsser, P. Francois, and O. Bonaventure. Seamless network-wide IGP migrations. In SIGCOMM, 2011.
    [35]
    C. Wilson, H. Ballani, T. Karagiannis, and A. Rowstron. Better never than late: Meeting deadlines in datacenter networks. In SIGCOMM, 2011.
    [36]
    M. Zhang, B. Karp, S. Floyd, and L. Peterson. RR-TCP: A reordering-robust TCP with DSACK. In ICNP, 2003.

    Cited By

    View all
    • (2024)Adaptive quality of service for packet loss reduction using OpenFlow metersPeerJ Computer Science10.7717/peerj-cs.184810(e1848)Online publication date: 4-Apr-2024
    • (2024)A Temporal Deep Q Learning for Optimal Load Balancing in Software-Defined NetworksSensors10.3390/s2404121624:4(1216)Online publication date: 14-Feb-2024
    • (2024)RAGraph: A Region-Aware Framework for Geo-Distributed Graph ProcessingProceedings of the VLDB Endowment10.14778/3632093.363209417:3(264-277)Online publication date: 20-Jan-2024
    • Show More Cited By

    Index Terms

    1. Achieving high utilization with software-driven WAN

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SIGCOMM '13: Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
      August 2013
      580 pages
      ISBN:9781450320566
      DOI:10.1145/2486001
      • cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 43, Issue 4
        October 2013
        595 pages
        ISSN:0146-4833
        DOI:10.1145/2534169
        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 2013

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. inter-dc wan
      2. software-defined networking

      Qualifiers

      • Research-article

      Conference

      SIGCOMM'13
      Sponsor:
      SIGCOMM'13: ACM SIGCOMM 2013 Conference
      August 12 - 16, 2013
      Hong Kong, China

      Acceptance Rates

      SIGCOMM '13 Paper Acceptance Rate 38 of 246 submissions, 15%;
      Overall Acceptance Rate 554 of 3,547 submissions, 16%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)614
      • Downloads (Last 6 weeks)65

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Adaptive quality of service for packet loss reduction using OpenFlow metersPeerJ Computer Science10.7717/peerj-cs.184810(e1848)Online publication date: 4-Apr-2024
      • (2024)A Temporal Deep Q Learning for Optimal Load Balancing in Software-Defined NetworksSensors10.3390/s2404121624:4(1216)Online publication date: 14-Feb-2024
      • (2024)RAGraph: A Region-Aware Framework for Geo-Distributed Graph ProcessingProceedings of the VLDB Endowment10.14778/3632093.363209417:3(264-277)Online publication date: 20-Jan-2024
      • (2024)Occam: A Programming System for Reliable Network ManagementProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3650086(148-162)Online publication date: 22-Apr-2024
      • (2024)Halflife: An Adaptive Flowlet-based Load Balancer with Fading Timeout in Data Center NetworksProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3650062(66-81)Online publication date: 22-Apr-2024
      • (2024)ARES: Predictable Traffic Engineering under Controller Failures in SD-WANsProceedings of the ACM on Web Conference 202410.1145/3589334.3645321(2703-2712)Online publication date: 13-May-2024
      • (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)Load Profiling via In-Band Flow Classification and P4 With HowdahIEEE Transactions on Network and Service Management10.1109/TNSM.2023.329972921:1(295-309)Online publication date: Feb-2024
      • (2024)TrafAda: Cost-Aware Traffic Adaptation for Maximizing Bitrates in Live StreamingIEEE/ACM Transactions on Networking10.1109/TNET.2023.328581232:1(96-109)Online publication date: Feb-2024
      • (2024) Ambusher : Exploring the Security of Distributed SDN Controllers Through Protocol State Fuzzing IEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.340296719(6264-6279)Online publication date: 2024
      • 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