The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
A clean slate 4D approach to network control and management
Abstract
Today's data networks are surprisingly fragile and difficult to manage. We argue that the root of these problems lies in the complexity of the control and management planes--the software and protocols coordinating network elements--and particularly the way the decision logic and the distributed-systems issues are inexorably intertwined. We advocate a complete refactoring of the functionality and propose three key principles--network-level objectives, network-wide views, and direct control--that we believe should underlie a new architecture. Following these principles, we identify an extreme design point that we call "4D," after the architecture's four planes: decision, dissemination, discovery, and data. The 4D architecture completely separates an AS's decision logic from pro-tocols that govern the interaction among network elements. The AS-level objectives are specified in the decision plane, and en-forced through direct configuration of the state that drives how the data plane forwards packets. In the 4D architecture, the routers and switches simply forward packets at the behest of the decision plane, and collect measurement data to aid the decision plane in controlling the network. Although 4D would involve substantial changes to today's control and management planes, the format of data packets does not need to change; this eases the deployment path for the 4D architecture, while still enabling substantial innovation in network control and management. We hope that exploring an extreme design point will help focus the attention of the research and industrial communities on this crucially important and intellectually challenging area.
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
Kohler, E., Morris, R., Chen, B., Jannotti, J., & Kaashoek, M. F. (2000) · ACM Transactions on Computer Systems · doi:10.1145/354871.354874 · Cited by 2,413
An integrated experimental environment for distributed systems and networks
White, B., Lepreau, J., Stoller, L. B., Ricci, R., Guruprasad, S., Newbold, M., Hibler, M., Barb, C., & Joglekar, A. A. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844152 · Cited by 1,302
A knowledge plane for the internet
Clark, D. D., Partridge, C., Ramming, J. C., & Wroclawski, J. T. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863957 · Cited by 609
Why Do Internet Services Fail, and What Can Be Done About It?
Oppenheimer, D., Ganapathi, A., & Patterson, D. A. (2002) · Cited by 607
The Computer Science Department.
Tolman, H. (1971) · Cited by 554
Understanding BGP misconfiguration
Mahajan, R., Wetherall, D., & Anderson, T. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633027 · Cited by 533
Traffic engineering with traditional IP routing protocols
Fortz, B., Rexford, J., & Thorup, M. (2002) · IEEE Communications Magazine · doi:10.1109/mcom.2002.1039866 · Cited by 460
Self-citationTussle in cyberspace: defining tomorrow's Internet
Clark, D. D., Wroclawski, J., Sollins, K. R., & Braden, R. (2005) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2005.850224 · Cited by 411
Design and implementation of a routing control platform
Caesar, M., Caldwell, D., & Shaikh, A. (2005) · Cited by 395
Detecting BGP configuration faults with static analysis
Feamster, N., & Balakrishnan, H. (2005) · doi:10.5555/1251203.1251207 · Cited by 307
Tussle in cyberspace: defining tomorrow's internet
Clark, D. D., Wroclawski, J., Sollins, K. R., & Braden, R. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633059 · Cited by 257
Routing design in operational networks
Maltz, D. A., Xie, G. G., Zhan, J., Zhang, H., Hjálmtýsson, G., & Greenberg, A. G. (2004) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1015467.1015472 · Cited by 121
Self-citationOSPF monitoring: architecture, design and deployment experience
Shaikh, A., & Greenberg, A. G. (2004) · Networked Systems Design and Implementation · Cited by 109
Self-citationLakshman, T. V., Nandagopal, T., Ramjee, R., Sabnani, K. K., & Woo, T. Y. C. (2004) · Cited by 101
IP network configuration for intradomain traffic engineering
Feldmann, A., & Rexford, J. (2001) · IEEE Network · doi:10.1109/65.953233 · Cited by 93
Self-citationThe cutting EDGE of IP router configuration
Caldwell, D. W., Gilbert, A. C., Gottlieb, J., Greenberg, A. G., Hjálmtýsson, G., & Rexford, J. (2004) · ACM SIGCOMM Computer Communication Review · doi:10.1145/972374.972379 · Cited by 89
Self-citationIpsilon's General Switch Management Protocol Specification Version 1.1
Newman, P., Edwards, W., Hinden, R. M., et al. (1996) · doi:10.17487/rfc1987 · Cited by 76
Open signaling for ATM, internet and mobile networks (OPENSIG'98)
Campbell, A. T., Katzela, I., Miki, K., et al. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505754.505762 · Cited by 64
General Switch Management Protocol (GSMP) V3
Doria, A., Hellstrand, F., Sundell, K., & Worster, T. (2002) · doi:10.17487/rfc3292 · Cited by 60
Active Networking: One View of the Past, Present, and Future
Smith, J. M., & Nettles, S. (2004) · IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) · doi:10.1109/tsmcc.2003.818493 · Cited by 54
Ipsilon's General Switch Management Protocol Specification Version 2.0
Newman, P., Edwards, W., Hinden, R. M., et al. (1998) · doi:10.17487/rfc2297 · Cited by 54
The Pronto platform: a flexible toolkit for programming networks using a commodity operating system
Hjálmtýsson, G. (2002) · IEEE Conference on Open Architectures and Network Programming (OPENARCH) · doi:10.1109/opnarc.2000.828137 · Cited by 35
Towards Coordinated Interdomain Traffic Engineering
Mahajan, R., Wetherall, D. J., & Anderson, T. E. (2004) · Cited by 31
Refactoring Network Control and Management: A Case for the 4D Architecture
Greenberg, A. G., Hjálmtýsson, G., Maltz, D. A., Myers, A., Rexford, J., Xie, G. G., Yan, H., Zhan, J., & Zhang, H. (2005) · Cited by 23
Self-citation
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
A Survey of Software-Defined Networking: Past, Present, and Future of Programmable Networks
Nunes, B. A. A., Mendonca, M., Nguyen, X.-N., Obraczka, K., & Turletti, T. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2014.012214.00180 · Cited by 2,203
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
B4: experience with a globally-deployed software defined wan
Jain, S., Kumar, A., Mandal, S., Ong, J., Poutievski, L., Singh, A., Venkata, S., Wanderer, J., Zhou, J., Zhu, M., et al. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486019 · Cited by 1,771
Hedera: dynamic flow scheduling for data center networks
Al-Fares, M., Radhakrishnan, S., Raghavan, B., Huang, N., & Vahdat, A. M. (2010) · doi:10.5555/1855711.1855730 · Cited by 1,450
Metadata
- Authors
- Greenberg, A., Hjalmtysson, G., Maltz, D. A., Myers, A., Rexford, J., Xie, G., Yan, H., Zhan, J., & Zhang, H.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2005-10-06
- Volume
- 35
- Issue
- 5
- Pages
- 41-54
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2164284397
- Cited by
- 650
- References
- 24
- FWCI
- 29.68
- Type
- journal article
- 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.