Name
Abstract | ||
|---|---|---|
This paper 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. After describing our approach, we survey the technology choices available to network designers today, and examine several existing commercial data center networks. In the most recent of these networks resources are allocated roughly as we suggest in this paper. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2684464.2684505 | ICDCN |
Keywords | Field | DocType |
algorithms,design,network architecture and design,performance,sql,database systems,scalability,web applications | SQL,Network planning and design,Computer science,Computer network,NoSQL,Web application,Universality (philosophy),Data center,Very-large-scale integration,Scalability,Distributed computing | Conference |
Citations | PageRank | References |
3 | 0.40 | 20 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aditya Akella | 1 | 4138 | 268.44 |
| Theophilus Benson | 2 | 1694 | 93.95 |
| Balakrishnan Chandrasekaran | 3 | 84 | 10.39 |
| Cheng Huang | 4 | 34 | 2.26 |
| Bruce M. Maggs | 5 | 3592 | 368.31 |
| David A. Maltz | 6 | 6979 | 1089.40 |