Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2342356.2342397acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Free access

The only constant is change: incorporating time-varying network reservations in data centers

Published: 13 August 2012 Publication History

Abstract

In multi-tenant datacenters, jobs of different tenants compete for the shared datacenter network and can suffer poor performance and high cost from varying, unpredictable network performance. Recently, several virtual network abstractions have been proposed to provide explicit APIs for tenant jobs to specify and reserve virtual clusters (VC) with both explicit VMs and required network bandwidth between the VMs. However, all of the existing proposals reserve a fixed bandwidth throughout the entire execution of a job.
In the paper, we first profile the traffic patterns of several popular cloud applications, and find that they generate substantial traffic during only 30%-60% of the entire execution, suggesting existing simple VC models waste precious networking resources. We then propose a fine-grained virtual network abstraction, Time-Interleaved Virtual Clusters (TIVC), that models the time-varying nature of the networking requirement of cloud applications. To demonstrate the effectiveness of TIVC, we develop Proteus, a system that implements the new abstraction. Using large-scale simulations of cloud application workloads and prototype implementation running actual cloud applications, we show the new abstraction significantly increases the utilization of the entire datacenter and reduces the cost to the tenants, compared to previous fixed-bandwidth abstractions.

Supplementary Material

JPG File (sigcomm-v-02-theonlyconstantischange.jpg)
MP4 File (sigcomm-v-02-theonlyconstantischange.mp4)

References

[1]
Amazon ec2 api ec2-run-instances. http://docs.amazonwebservices.com/AWSEC2/latest/ CommandLineReference/ApiReference-cmd-RunInstances.html.
[2]
Apache hive. http://hive.apache.org/.
[3]
Apache pig. http://pig.apache.org/.
[4]
Cisco nexus 7000. http://www.cisco.com/en/US/prod/collateral/ switches/ps9441/ps9402/ps9512/Data\_Sheet\_C78--437757.pdf.
[5]
Hive performance benchmarks. https://issues.apache.org/jira/browse/HIVE-396.
[6]
S. Agarwal, S. Kandula, N. Bruno, M.-C. Wu, I. Stoica, and J. Zhou. Re-Optimizing data-parallel computing. In Proc. of USENIX NSDI, 2012.
[7]
M. Al-Fares, A. Loukissas, and A. Vahdat. A scalable, commodity data center network architecture. In Proc. of ACM SIGCOMM, 2008.
[8]
M. Al-fares, S. Radhakrishnan, et al. Hedera: Dynamic flow scheduling for data center networks. In Proc. of USENIX NSDI, 2010.
[9]
G. Ananthanarayanan, S. Kandula, A. Greenberg, I. Stoica, Y. Lu, B. Saha, and E. Harris. Reining in the outliers in map-reduce clusters using mantri. In Proc. of USENIX OSDI, 2010.
[10]
H. Ballani, P. Costa, T. Karagiannis, and A. Rowstron. The price is right: Towards location-independent costs in datacenters. In Proc. of ACM HotNets, 2011.
[11]
H. Ballani, P. Costa, T. Karagiannis, and A. I. T. Rowstron. Towards predictable datacenter networks. In Proc. of ACM SIGCOMM, 2011.
[12]
F. Bancilhon and R. Ramakrishnan. An amateur's introduction to recursiv query rocessing strategies. In In Proc. of SIGMOD, 1986.
[13]
C. Brenton. Hypervisor vs host based security. https://cloudsecurityalliance.org/wp-content/uploads/2011/11/hypervisor-vs-h%ostbased-security.pdf.
[14]
Y. Bu, B. Howe, M. Balazinska, and M. D. Ernst. HaLoop: Efficient Iterative Data Proecssing on Large Clusters. Proc. of the VLDB Endowment, 3(1), 2010.
[15]
N. Chowdhury et al. Virtual Network Embedding with Coordinated Node and Link Mapping. In IEEE INFOCOM, 2009.
[16]
T. Condie, N. Conway, P. Alvaro, J. M. Hellerstein, J. Gerth, J. Talbot, K. Elmeleegy, and R. Sears. Online aggregation and continuous query support in mapreduce. In ACM SIGMOD, 2010.
[17]
J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In Proc. of USENIX OSDI, December 2004.
[18]
N. G. Duffield, P. Goyal, A. Greenberg, et al. A flexible model for resource management in virtual private networks. In Proc. of ACM SIGCOMM, 1999.
[19]
A. Greenberg, J. R. Hamilton, et al. VL2: a scalable and flexible data center network. In Proc. of ACM SIGCOMM, 2009.
[20]
C. Guo, G. Lu, H. J. Wang, S. Yang, C. Kong, et al. Secondnet: a data center network virtualization architecture with bandwidth guarantees. In Proc. of ACM CoNEXT, 2010.
[21]
H. Herodotou and S. Babu. Profiling, what-if analysis, and cost-based optimization of mapreduce programs. PVLDB, 4(11):1111--1122, 2011.
[22]
H. Herodotou, F. Dong, and S. Babu. No one (cluster) size fits all: Automatic cluster sizing for data-intensive analytics. In Proc. of ACM SOCC, Oct. 2011.
[23]
H. Herodotou, H. Lim, G. Luo, N. Borisov, L. Dong, F. B. Cetin, and S. Babu. Starfish: A self-tuning system for big data analytics. In Proc. of CIDR, 2011.
[24]
B. Hindman, A. Konwinski, M. Zaharia, A. Ghodsi, A. D. Joseph, R. Katz, S. Shenker, and I. Stoica. Mesos: a platform for fine-grained resource sharing in the data center. In Proc. of USENIX NSDI, 2011.
[25]
J. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5), 1999.
[26]
T. Lam and G. Varghese. Netshare: Virtualizing bandwidth within the cloud. UCSD Technical Report, 2009.
[27]
J. Mudigonda, P. Yalagandula, M. Al-Fares, and H. L. Jeffrey Mogul. SPAIN: COTS data-center ethernet for multipathing over arbitrary topologies. In Proc. of USENIX NSDI, 2010.
[28]
D. G. Murray, M. Schwarzkopf, C. Smowton, S. Smith, A. Madhavapeddy, and S. Hand. Ciel: a universal execution engine for distributed data-flow computing. In Proc. of USENIX NSDI, 2011.
[29]
L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the Web. Technical Report 1999--66, Stanford Infolab, 1999.
[30]
L. Popa, A. Krishnamurthy, S. Ratnasamy, and I. Stoica. Faircloud: Sharing the network in cloud computing. In ACM HotNets, 2011.
[31]
C. Raiciu, S. Barre, C. Pluntke, A. Greenhalgh, D. Wischik, and M. Handley. Improving datacenter performance and robustness with multipath tcp. In Proc. of ACM SIGCOMM, 2011.
[32]
R. Ricci, C. Alfeld, and J. Lepreau. A Solver for the Network Testbed Mapping Problem. SIGCOMM CCR, 33(2), 2003.
[33]
H. Rodrigues et al. Gatekeeper: Supporting bandwidth guarantees for multi-tenant datacenter networks. HP Technical Report, 2011.
[34]
A. Shieh, S. Kandula, A. Greenberg, C. Kim, and B. Saha. Sharing the data center network. In Proc. of USENIX NSDI, 2011.
[35]
M. Yu, Y. Yi, J. Rexford, and M. Chiang. Rethinking virtual network embedding: substrate support for path splitting and migration. ACM SIGCOMM CCR, 38(2), 2008.
[36]
M. Zaharia, D. Borthakur, J. Sen Sarma, K. Elmeleegy, S. Shenker, and I. Stoica. Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling. In Proc. of EuroSys, 2010.

Cited By

View all
  • (2023)Switchboard: Efficient Resource Management for Conferencing ServicesProceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3604879(1000-1011)Online publication date: 10-Sep-2023
  • (2023)Augmented Queue: A Scalable In-Network Abstraction for Data Center Network SharingProceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3604858(305-318)Online publication date: 10-Sep-2023
  • (2023)Saba: Rethinking Datacenter Network Allocation from Application's PerspectiveProceedings of the Eighteenth European Conference on Computer Systems10.1145/3552326.3587450(623-638)Online publication date: 8-May-2023
  • Show More Cited By

Index Terms

  1. The only constant is change: incorporating time-varying network reservations in data centers

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SIGCOMM '12: Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
    August 2012
    474 pages
    ISBN:9781450314190
    DOI:10.1145/2342356
    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: 13 August 2012

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. allocation
    2. bandwidth
    3. datacenter
    4. network reservation
    5. profiling

    Qualifiers

    • Research-article

    Conference

    SIGCOMM '12
    Sponsor:
    SIGCOMM '12: ACM SIGCOMM 2012 Conference
    August 13 - 17, 2012
    Helsinki, Finland

    Acceptance Rates

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

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)155
    • Downloads (Last 6 weeks)21
    Reflects downloads up to 15 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Switchboard: Efficient Resource Management for Conferencing ServicesProceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3604879(1000-1011)Online publication date: 10-Sep-2023
    • (2023)Augmented Queue: A Scalable In-Network Abstraction for Data Center Network SharingProceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3604858(305-318)Online publication date: 10-Sep-2023
    • (2023)Saba: Rethinking Datacenter Network Allocation from Application's PerspectiveProceedings of the Eighteenth European Conference on Computer Systems10.1145/3552326.3587450(623-638)Online publication date: 8-May-2023
    • (2023)Dependable Virtualized Fabric on Programmable Data PlaneIEEE/ACM Transactions on Networking10.1109/TNET.2022.322461731:4(1748-1764)Online publication date: Aug-2023
    • (2022)Network entitlementProceedings of the ACM SIGCOMM 2022 Conference10.1145/3544216.3544245(250-263)Online publication date: 22-Aug-2022
    • (2022)Network resource management as a database problemProceedings of the 13th Symposium on Cloud Computing10.1145/3542929.3563508(63-71)Online publication date: 7-Nov-2022
    • (2022)Holistic Resource Scheduling for Data Center In-Network ComputingIEEE/ACM Transactions on Networking10.1109/TNET.2022.317478330:6(2448-2463)Online publication date: Dec-2022
    • (2022)Scorpius: Proactive Code Preparation to Accelerate Function Startup2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)10.1109/IWQoS54832.2022.9812868(1-10)Online publication date: 10-Jun-2022
    • (2021)Switches for HIRE: resource scheduling for data center in-network computingProceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3445814.3446760(268-285)Online publication date: 19-Apr-2021
    • (2021)A Case for Pricing Bandwidth: Sharing Datacenter Networks With Cost Dominant FairnessIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2020.304570932:5(1256-1269)Online publication date: 1-May-2021
    • 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