The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Adaptive forwarding in named data networking
Abstract
In Named Data Networking (NDN) architecture, packets carry data names rather than source or destination addresses. This change of paradigm leads to a new data plane: data consumers send out Interest packets, routers forward them and maintain the state of pending Interests, which is used to guide Data packets back to the consumers. NDN routers' forwarding process is able to detect network problems by observing the two-way traffic of Interest and Data packets, and explore multiple alternative paths without loops. This is in sharp contrast to today's IP forwarding process which follows a single path chosen by the routing process, with no adaptability of its own. In this paper we outline the design of NDN's adaptive forwarding, articulate its potential benefits, and identify open research issues.
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
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Jacobson, V., Smetters, D. K., Thornton, J. D., Plass, M. F., Briggs, N. H., & Braynard, R. L. (2009) · Proceedings of the 5th international conference on Emerging networking experiments and technologies · doi:10.1145/1658939.1658941 · Cited by 4,031
Analysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/75247.75248 · Cited by 2,614
CUBIC: a new TCP-friendly high-speed TCP variant
Ha, S., Rhee, I., & Xu, L. (2008) · ACM SIGOPS Operating Systems Review · doi:10.1145/1400097.1400105 · Cited by 2,287
Border Gateway Protocol 3 (BGP-3)
Lougheed, K., & Rekhter, Y. (1991) · doi:10.17487/rfc1267 · Cited by 1,977
TCP Vegas: end to end congestion avoidance on a global Internet
Brakmo, L. S., & Peterson, L. L. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.464716 · Cited by 1,699
The Addition of Explicit Congestion Notification (ECN) to IP
Ramakrishnan, K., Floyd, S., & Black, D. (2001) · doi:10.17487/rfc3168 · Cited by 1,512
The NewReno Modification to TCP's Fast Recovery Algorithm
Henderson, T., Floyd, S., Gurtov, A., & Nishida, Y. (2012) · doi:10.17487/rfc6582 · Cited by 1,410
A data-oriented (and beyond) network architecture
Koponen, T., Chawla, M., Chun, B.-G., Ermolinskiy, A., Kim, K. H., Shenker, S., & Stoica, I. (2007) · Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1282380.1282402 · Cited by 1,368
Congestion control for high bandwidth-delay product networks
Katabi, D., Handley, M., & Rohrs, C. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633035 · Cited by 1,096
Measuring ISP Topologies With Rocketfuel
Spring, N., Mahajan, R., Wetherall, D., & Anderson, T. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.822655 · Cited by 1,010
Named Data Networking (NDN) Project
Zhang, L., Estrin, D. L., Burke, J. A., Jacobson, V. L., Thornton, J. D., Smetters, D. K., Zhang, B., & Tsudik, G. (2010) · Cited by 915
Self-citationOn Distributed Communications Networks
Baran, P. (1964) · IEEE Transactions on Communications · doi:10.1109/tcom.1964.1088883 · Cited by 775
Nichols, K., & Jacobson, V. (2012) · Communications of the ACM · doi:10.1145/2209249.2209264 · Cited by 617
Design, implementation and evaluation of congestion control for multipath TCP
Wischik, D., Raiciu, C., Greenhalgh, A., & Handley, M. J. (2011) · doi:10.5555/1972457.1972468 · Cited by 586
Stoica, I. G., Shenker, S. J., & Zhang, H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808414 · Cited by 440
LIPSIN: line speed publish/subscribe inter-networking
Jokela, P., Zahemszky, A., Esteve Rothenberg, C., Arianfar, S., & Nikander, P. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592592 · Cited by 434
Characterization of Failures in an Operational IP Backbone Network
Markopoulou, A., Iannaccone, G., Bhattacharyya, S., Chuah, C.-N., Ganjali, Y., & Diot, C. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.902727 · Cited by 407
Why flow-completion time is the right metric for congestion control
Dukkipati, N., & McKeown, N. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1111322.1111336 · Cited by 317
DoS and DDoS in Named Data Networking
Gasti, P., Tsudik, G., Uzun, E., & Zhang, L. (2013) · 2013 22nd International Conference on Computer Communication and Networks (ICCCN) · doi:10.1109/icccn.2013.6614127 · Cited by 315
Self-citationAchieving sub-second IGP convergence in large IP networks
Francois, P., Filsfils, C., Evans, J., & Bonaventure, O. (2005) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1070873.1070877 · Cited by 288
Godfrey, P. B., Ganichev, I., Shenker, S., & Stoica, I. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592583 · Cited by 235
Source selectable path diversity via routing deflections
Yang, X., & Wetherall, D. J. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159933 · Cited by 189
Pretty Good BGP: Improving BGP by Cautiously Adopting Routes
Karlin, J., Forrest, S., & Rexford, J. (2006) · Proceedings of the 2006 IEEE International Conference on Network Protocols · doi:10.1109/icnp.2006.320179 · Cited by 183
Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces
Papadopoulos, F., Krioukov, D., Boguna, M., & Vahdat, A. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462131 · Cited by 179
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
Motiwala, M., Elmore, M., Feamster, N., & Vempala, S. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402963 · Cited by 170
Scalable NDN Forwarding: Concepts, Issues and Principles
Yuan, H., Song, T., & Crowley, P. (2012) · Proceedings/Proceedings - International Conference on Computer Communications and Networks · doi:10.1109/icccn.2012.6289305 · Cited by 144
Scalable Name Lookup in NDN Using Effective Name Component Encoding
Wang, Y., He, K., Dai, H., et al. (2012) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2012.35 · Cited by 141
CCTCP: A scalable receiver-driven congestion control protocol for content centric networking
Saino, L., Cocora, C., & Pavlou, G. (2013) · International Conference on Communications · doi:10.1109/icc.2013.6655143 · Cited by 137
Optimal multipath congestion control and request forwarding in Information-Centric Networks
Carofiglio, G., Gallo, M., Muscariello, L., Papalini, M., & Wang, S. (2013) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2013.6733576 · Cited by 128
An effective hop-by-hop Interest shaping mechanism for CCN communications
Rozhnova, N., & Fdida, S. (2012) · 2012 Proceedings IEEE INFOCOM Workshops · doi:10.1109/infcomw.2012.6193514 · Cited by 125
Multipath congestion control in content-centric networks
Carofiglio, G., Gallo, M., Muscariello, L., & Papali, M. (2013) · IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infcomw.2013.6970718 · Cited by 114
Joint hop-by-hop and receiver-driven interest control protocol for content-centric networks
Carofiglio, G., Gallo, M., & Muscariello, L. (2012) · ACM Conference on Information-Centric Networking (ICN) · doi:10.1145/2342488.2342497 · Cited by 106
An improved hop-by-hop interest shaper for congestion control in named data networking
Wang, Y., Rozhnova, N., Narayanan, A., Oran, D., & Rhee, I. (2013) · ACM Conference on Information-Centric Networking (ICN) · doi:10.1145/2491224.2491233 · Cited by 84
Don’t Secure Routing Protocols, Secure Data Delivery
Wendlandt, D., Avramopoulos, I., Andersen, D. G., et al. (2018) · doi:10.1184/r1/6604964 · Cited by 81
DoS & DDoS in Named Data Networking
Gasti, P., Uzun, E., Tsudik, G., et al. (2013) · Cited by 63
Dynamic route recomputation considered harmful
Caesar, M., Casado, M., Koponen, T., et al. (2010) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1764873.1764885 · Cited by 52
An Empirical Study of Receiver-Based AIMD Flow-Control Strategies for CCN
Braun, S., Monti, M., Sifalakis, M., & Tschudin, C. (2013) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn.2013.6614106 · Cited by 48
A comparison of syslog and IS-IS for network failure analysis
Turner, D., Levchenko, K., Savage, S., & Snoeren, A. C. (2013) · ACM Internet Measurement Conference (IMC) · doi:10.1145/2504730.2504766 · Cited by 11
Cited by
Zhang, L., Afanasyev, A., Burke, J., Jacobson, V., claffy, K., Crowley, P., Papadopoulos, C., Wang, L., & Zhang, B. (2014) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2656877.2656887 · Cited by 2,270
Self-citationNLSR: named-data link state routing protocol
Hoque, A. K. M. M., Amin, S. O., Alyyan, A., Zhang, B., Zhang, L., & Wang, L. (2013) · Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking · doi:10.1145/2491224.2491231 · Cited by 331
Self-citationNamed Data Networking: A survey
Saxena, D., Raychoudhury, V., Suri, N., Becker, C., & Cao, J. (2016) · Computer Science Review · doi:10.1016/j.cosrev.2016.01.001 · Cited by 291
A Survey of Green Information-Centric Networking: Research Issues and Challenges
Fang, C., Yu, F. R., Huang, T., Liu, J., & Liu, Y. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2394307 · Cited by 268
An NDN IoT Content Distribution Model With Network Coding Enhanced Forwarding Strategy for 5G
Lei, K., Zhong, S., Zhu, F., Xu, K., & Zhang, H. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2017.2781372 · Cited by 69
Metadata
- Authors
- Yi, C., Afanasyev, A., Wang, L., Zhang, B., & Zhang, L.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2012-06-26
- Volume
- 42
- Issue
- 3
- Pages
- 62-67
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2114103190
- Cited by
- 308
- References
- 41
- FWCI
- 35.45
- 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.