skip to main content
10.1145/2612669.2612729acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
keynote

A universal approach to data center network design

Published:21 June 2014Publication History

ABSTRACT

This talk proposes an approach to the design of large-scale general-purpose data center networks based on the notions of volume and area universality introduced by Leiserson in the 1980's in the context of VLSI design. In particular, we suggest that the principle goal of the network designer should be to build a single network that is provably competitive, for any application, with any network that can be built for the same amount of money. We illustrate our approach by walking through the design of a hierarchical data center network using the various networking components available today commercially.

Bruce Maggs received the S.B., S.M., and Ph.D. degrees in computer science from the Massachusetts Institute of Technology in 1985, 1986, and 1989, respectively. His advisor was Charles Leiserson. After spending one year as a Postdoctoral Associate at MIT, he worked as a Research Scientist at NEC Research Institute in Princeton from 1990 to 1993. In 1994, he moved to Carnegie Mellon, where he stayed until joining Duke University in 2009 as a Professor in the Department of Computer Science. While on a two-year leave-of-absence from Carnegie Mellon, Maggs helped to launch Akamai Technologies, serving as its Vice President for Research and Development, before returning to Carnegie Mellon. He retains a part-time role at Akamai as Vice President for Research.

Index Terms

  1. A universal approach to data center network design

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          SPAA '14: Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures
          June 2014
          356 pages
          ISBN:9781450328210
          DOI:10.1145/2612669
          • General Chair:
          • Guy Blelloch,
          • Program Chair:
          • Peter Sanders

          Copyright © 2014 Owner/Author

          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: 21 June 2014

          Check for updates

          Author Tags

          Qualifiers

          • keynote

          Acceptance Rates

          SPAA '14 Paper Acceptance Rate30of122submissions,25%Overall Acceptance Rate447of1,461submissions,31%

          Upcoming Conference

          SPAA '24
        • Article Metrics

          • Downloads (Last 12 months)1
          • Downloads (Last 6 weeks)0

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader