An effective hop-by-hop Interest shaping mechanism for CCN communications
Open accessAbstract
We introduce a rate-based congestion control mechanism for Content-Centric Networking (CCN). It builds on the fact that one Interest retrieves at most one Data packet. Congestion can occur when aggregate conversations arrive in excess and fill up the transmission queue of a CCN router. We compute the available capacity of each CCN router in a distributed way in order to shape their conversations Interest rate and therefore, adjust dynamically their Data rate and transmission buffer occupancy. We demonstrate the convergence properties of this Hop-by-hop Interest Shaping mechanism (HoBHIS) and provide a performance analysis based on various scenarios using our ns2simulation environment.
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 [392]
Cites
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
A data-oriented (and beyond) network architecture
Koponen, T., Chawla, M., Chun, B.-G., Ermolinskiy, A., Kim, K. H., Shenker, S. J., & Stoica, I. G. (2007) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1282380.1282402 · Cited by 1,390 · see citing works
A data-oriented (and beyond) network architecture
Koponen, T., Chawla, M., Chun, B.-G., Ermolinskiy, A., Kim, K. H., Shenker, S. J., & Stoica, I. G. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1282427.1282402 · Cited by 720 · see citing works
Proportional differentiated services
Dovrolis, C., Stiliadis, D., & Ramanathan, P. (1999) · doi:10.1145/316188.316211 · Cited by 265 · see citing works
Rate adaptation, Congestion Control and Fairness: A Tutorial
Boudec, J. L. (2000) · Cited by 224 · see citing works
Modelling and Evaluation of CCN-Caching Trees
Psaras, I., Clegg, R. G., Landa, R., et al. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20757-0_7 · Cited by 204 · see citing works
On content-centric router design and implications
Arianfar, S., Nikander, P., & Ott, J. (2010) · doi:10.1145/1921233.1921240 · Cited by 190 · see citing works
A hop by hop rate-based congestion control scheme
Mishra, P. P., & Kanakia, H. (1992) · doi:10.1145/144179.144254 · Cited by 148 · see citing works
Experimental Evaluation of Memory Management in Content-Centric Networking
Carofiglio, G., Gehlen, V., & Perino, D. (2011) · International Conference on Communications · doi:10.1109/icc.2011.5962739 · Cited by 102 · see citing works
Fibonacci Numbers and Their Applications
Greene, C., Nijenhuis, A., Combin, S. J., et al. (1986) · Springer eBooks · doi:10.1007/978-94-009-4311-7 · Cited by 57 · see citing works
A transport protocol for content-centric networks
Arianfar, S., Ott, J., Eggert, L., et al. (2010) · Cited by 19 · see citing works
ERAQLES an efficient explicit rate algorithm for ABR
Moret, Y., & Serge Fdida, B. (2002) · IEEE Global Telecommunications Conference (GLOBECOM) · doi:10.1109/glocom.1997.638440 · Cited by 12 · see citing works
A dynamic resource management mechanism for LAN interconnection across high-speed networks
Roche, C., & Serge Fdida, B. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1994.337649 · Cited by 9 · see citing works
Serge Fdida, B., & Diallo, M. (2008) · doi:10.1145/1503370.1503372 · Cited by 7 · 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
Karami, A. (2015) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2015.05.017 · Cited by 29 · see citing works
- Authors
- Rozhnova, N., & Fdida, S.
- Affiliations
- Centre National de la Recherche Scientifique (FR)
- Venue
- 2012 Proceedings IEEE INFOCOM Workshops
- Publisher
- IEEE
- Published
- 2012-03
- Pages
- 322-327
- OpenAlex
- W2075633861
- Cited by
- 125
- References
- 14
- Citations by year
- 2026: 3 · 2025: 3 · 2024: 6 · 2023: 7 · 2022: 2 · 2021: 11 · 2020: 10 · 2019: 9 · 2018: 15 · 2017: 12 · 2016: 15 · 2015: 8 · 2014: 8 · 2013: 10 · 2012: 6
- FWCI
- 8.59
- Type
- conference paper
- Language
- en
- Open access
- Licence
- other-oa
- Locations
- IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) (publishedVersion)
- HAL (submittedVersion, other-oa)
- Funders
- Agence Nationale de la Recherche
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
- Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
- Physical Sciences › Computer Science › Computer Networks and Communications › Opportunistic and Delay-Tolerant Networks
- Keywords
- content-centric networking, congestion control, rate-based control, convergence analysis
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
