The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
PortLand: a scalable fault-tolerant layer 2 data center network fabric
Abstract
This paper considers the requirements for a scalable, easily manageable, fault-tolerant, and efficient data center network fabric. Trends in multi-core processors, end-host virtualization, and commodities of scale are pointing to future single-site data centers with millions of virtual end points. Existing layer 2 and layer 3 network protocols face some combination of limitations in such a setting: lack of scalability, difficult management, inflexible communication, or limited support for virtual machine migration. To some extent, these limitations may be inherent for Ethernet/IP style protocols when trying to support arbitrary topologies. We observe that data center networks are often managed as a single logical network fabric with a known baseline topology and growth model. We leverage this observation in the design and implementation of PortLand, a scalable, fault tolerant layer 2 routing and forwarding protocol for data center environments. Through our implementation and evaluation, we show that PortLand holds promise for supporting a ``plug-and-play" large-scale, data center network.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945450 · Cited by 4,984
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402967 · Cited by 3,175
Self-citationLive migration of virtual machines
Clark, C. J., Fraser, K. A., Hand, S., Hansen, J. G., Jul, E., Limpach, C., Pratt, I., & Warfield, A. (2005) · doi:10.5555/1251203.1251223 · Cited by 2,562
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · Proceedings of the ACM SIGCOMM 2008 conference on Data communication · doi:10.1145/1402958.1402967 · Cited by 1,679
Self-citationFat-trees: Universal networks for hardware-efficient supercomputing
Leiserson, C. E. (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.6312192 · Cited by 1,325
Dcell: a scalable and fault-tolerant network structure for data centers
Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., & Lu, S. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402968 · Cited by 994
Analysis of an Equal-Cost Multi-Path Algorithm
Hopps, C. (2000) · doi:10.17487/rfc2992 · Cited by 965
Dcell: a scalable and fault-tolerant network structure for data centers
Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., & Lu, S. (2008) · Proceedings of the ACM SIGCOMM 2008 conference on Data communication · doi:10.1145/1402958.1402968 · Cited by 563
The Internet Engineering Task Force
Needleman, M. (2000) · Serials Review · doi:10.1016/s0098-7913(99)00073-8 · Cited by 457
Design and implementation of a routing control platform
Caesar, M., Caldwell, D., & Shaikh, A. (2005) · Cited by 395
Caesar, M., Castro, M., Nightingale, E. B., O’Shea, G., & Rowstron, A. I. T. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159954 · Cited by 356
NetFPGA--An Open Platform for Gigabit-Rate Network Switching and Routing
Lockwood, J. W., McKeown, N., Watson, G., Gibb, G., Hartke, P., Naous, J., Raghuraman, R., & Luo, J. (2007) · 2007 IEEE International Conference on Microelectronic Systems Education (MSE'07) · doi:10.1109/mse.2007.69 · Cited by 314
Caesar, M., Condie, T., Kannan, J., Lakshminarayanan, K., Stoica, I. G., & Shenker, S. J. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159955 · Cited by 284
Floodless in seattle: a scalable ethernet architecture for large enterprises
Kim, C., Caesar, M., & Rexford, J. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402961 · Cited by 266
Towards a next generation data center architecture: scalability and commoditization
Greenberg, A. G., Lahiri, P., Maltz, D. A., Patel, P., & Sengupta, S. (2008) · doi:10.1145/1397718.1397732 · Cited by 247
Achieving convergence-free routing using failure-carrying packets
Lakshminarayanan, K., Caesar, M., Rangan, M., et al. (2007) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · doi:10.1145/1282380.1282408 · Cited by 173
Kim, C., Caesar, M., & Rexford, J. (2008) · doi:10.1145/1402958.1402961 · Cited by 153
Caesar, M., Condie, T., Kannan, J., Lakshminarayanan, K., Stoica, I. G., & Shenker, S. J. (2006) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1159913.1159955 · Cited by 109
The Internet Engineering Task Force
Kessler, G. C. (1997) · Information Systems Security · doi:10.1080/10658989709342528 · Cited by 106
Cited by
Software-Defined Networking: A Comprehensive Survey
Kreutz, D., Ramos, F. M. V., Esteves Verissimo, P., Esteve Rothenberg, C., Azodolmolky, S., & Uhlig, S. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2371999 · Cited by 5,050
Cloud computing: state-of-the-art and research challenges
Zhang, Q., Cheng, L., & Boutaba, R. (2010) · Journal of Internet Services and Applications · doi:10.1007/s13174-010-0007-6 · Cited by 3,515
P4: programming protocol-independent packet processors
Bosshart, P., Daly, D., Gibb, G., Izzard, M., McKeown, N., Rexford, J., Schlesinger, C., Talayco, D., Vahdat, A., Varghese, G., et al. (2014) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2656877.2656890 · Cited by 2,867
Self-citationNetwork traffic characteristics of data centers in the wild
Benson, T., Akella, A., & Maltz, D. A. (2010) · Proceedings of the 10th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1879141.1879175 · Cited by 2,214
A network in a laptop: rapid prototyping for software-defined networks
Lantz, B., Heller, B., & McKeown, N. (2010) · Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks · doi:10.1145/1868447.1868466 · Cited by 1,826
Metadata
- Authors
- Niranjan Mysore, R., Pamboris, A., Farrington, N., Huang, N., Miri, P., Radhakrishnan, S., Subramanya, V., & Vahdat, A.
- Venue
- Proceedings of the ACM SIGCOMM 2009 conference on Data communication
- Publisher
- ACM
- Published
- 2009-08-16
- Pages
- 39-50
- OpenAlex
- W2123016589
- Cited by
- 929
- References
- 20
- FWCI
- 64.51
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.