A case for stateful forwarding plane
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
ACCPndn's congestion control mechanism considerably outperforms other NDN congestion control protocols such as NACK and HoBHIS in terms of packet drop and link utilization.
“This congestion control mechanism considerably outperforms other NDN congestion control protocols, such as NACK [487] and HoBHIS [392], in terms of packet drop and link utilization.”
From A comprehensive survey on machine learning for networking: Evolution, applications and research opportunities (2018) · cites this paper as [487]
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 · see citing works
Jacobson, V. L., Smetters, D. K., Thornton, J. D., Plass, M. F., Briggs, N. H., & Braynard, R. L. (2009) · ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) · doi:10.1145/1658939.1658941 · Cited by 4,081 · see citing works
Congestion control for high bandwidth-delay product networks
Katabi, D., Handley, M. J., & Rohrs, C. (2002) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · doi:10.1145/633025.633035 · Cited by 1,097 · see citing works
Measuring ISP Topologies With Rocketfuel
Spring, N. T., Mahajan, R., Wetherall, D. J., & Anderson, T. E. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.822655 · Cited by 1,011 · see citing works
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 · see citing works
Self-citationOn Distributed Communications Networks
Baran, P. (1964) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1964.1088883 · Cited by 780 · see citing works
Design, implementation and evaluation of congestion control for multipath TCP
Wischik, D., Raiciu, C., Greenhalgh, A., et al. (2011) · doi:10.5555/1972457.1972468 · Cited by 591 · see citing works
Jokela, P., Zahemszky, A., Rothenberg, C. E., et al. (2009) · doi:10.1145/1592568.1592592 · Cited by 437 · see citing works
Kandula, S., Katabi, D., Davie, B. S., et al. (2005) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · doi:10.1145/1080091.1080122 · Cited by 354 · see citing works
DoS and DDoS in Named Data Networking
Gasti, P., Tsudik, G., Uzun, E., et al. (2013) · International Conference on Computer Communication and Networks (ICCCN) · doi:10.1109/icccn.2013.6614127 · Cited by 309 · see citing works
Godfrey, P. B., Ganichev, I., Shenker, S. J., & Stoica, I. G. (2009) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1592568.1592583 · Cited by 238 · see citing works
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 · see citing works
Pretty Good BGP: Improving BGP by Cautiously Adopting Routes
Karlin, J., Forrest, S., & Rexford, J. (2006) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2006.320179 · Cited by 187 · see citing works
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 · see citing works
Motiwala, M., Elmore, M., Feamster, N., & Vempala, S. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402963 · Cited by 173 · see citing works
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 · see citing works
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 · see citing works
Motiwala, M., Elmore, M., Feamster, N., & Vempala, S. (2008) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1402958.1402963 · Cited by 109 · see citing works
Source selectable path diversity via routing deflections
Yang, X., & Wetherall, D. J. (2006) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · doi:10.1145/1159913.1159933 · Cited by 87 · see citing works
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 · see citing works
DoS & DDoS in Named Data Networking
Gasti, P., Uzun, E., Tsudik, G., et al. (2013) · Cited by 63 · see citing works
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 · see citing works
Achieving convergence-free routing using failure-carrying packets
Lakshminarayanan, K., Caesar, M., Rangan, M., et al. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1282427.1282408 · Cited by 39 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Boutaba, R., Salahuddin, M. A., Limam, N., Ayoubi, S., Shahriar, N., Estrada-Solano, F., & Caicedo, O. M. (2018) · Journal of Internet Services and Applications · doi:10.1186/s13174-018-0087-2 · Cited by 1,036 · see citing works
Investigating the Performance of Pull-Based Dynamic Adaptive Streaming in NDN
Rainer, B., Posch, D., & Hellwagner, H. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2577365 · Cited by 62 · see citing works
Karami, A. (2015) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2015.05.017 · Cited by 29 · see citing works
- Authors
- Yi, C., Afanasyev, A., Moiseenko, I., Wang, L., Zhang, B., & Zhang, L.
- Affiliations
- University of Arizona (US)
- University of California, Los Angeles (US)
- University of Memphis (US)
- Corresponding author
- Afanasyev, Alexander
- Venue
- Computer Communications
- Publisher
- Elsevier BV
- Published
- 2013-04
- Volume
- 36
- Issue
- 7
- Pages
- 779-791
- ISSN
- 0140-3664 (ISSN-L)
- OpenAlex
- W2110769762
- Cited by
- 474
- References
- 23
- Citations by year
- 2026: 5 · 2025: 9 · 2024: 14 · 2023: 21 · 2022: 23 · 2021: 29 · 2020: 37 · 2019: 61 · 2018: 55 · 2017: 57 · 2016: 60 · 2015: 42 · 2014: 43 · 2013: 17 · 2012: 1
- FWCI
- 71.04
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Computer Communications (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
- Physical Sciences › Computer Science › Computer Networks and Communications › Opportunistic and Delay-Tolerant Networks
- Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
- Keywords
- Named Data Networking, prefix hijacking, multipath routing, traffic congestion reduction
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
