{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T16:36:58Z","timestamp":1781714218530,"version":"3.54.5"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2013,8,12]],"date-time":"2013-08-12T00:00:00Z","timestamp":1376265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2013,9,19]]},"abstract":"<jats:p>Hop-by-hop interest shaping has been proposed as a viable congestion control mechanism in Named Data Networking (NDN). Interest shaping exploits the strict receiver-driven traffic pattern and the symmetric bidirectional forwarding in NDN to control the returning data rate. In this paper, we point out that both interests and contents contribute to congestion and their interdependence must be considered in any interest shaping algorithm. We first analyze this issue mathematically by formulating it as an optimization problem to obtain the optimal shaping rate. Then a practical interest shaping algorithm is proposed to achieve high link utilization without congestive data loss. We further note that flow differentiation in NDN is complicated and design our scheme independently of traffic flows. We demonstrate our hop-by-hop interest shaper in conjunction with simple Additive-Increase-Multiplicative-Decrease (AIMD) clients using the ns3-based NDN simulator (ndnSIM). Our results show that the proposed shaping algorithm can effectively control congestion and achieve near-optimal throughput.<\/jats:p>","DOI":"10.1145\/2534169.2491233","type":"journal-article","created":{"date-parts":[[2016,6,23]],"date-time":"2016-06-23T13:02:27Z","timestamp":1466686947000},"page":"55-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":57,"title":["An improved hop-by-hop interest shaper for congestion control in named data networking"],"prefix":"10.1145","volume":"43","author":[{"given":"Yaogong","family":"Wang","sequence":"first","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Natalya","family":"Rozhnova","sequence":"additional","affiliation":[{"name":"University Pierre and Marie Curie (UPMC), Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashok","family":"Narayanan","sequence":"additional","affiliation":[{"name":"Cisco System, Boxborough, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Oran","sequence":"additional","affiliation":[{"name":"Cisco System, Boxborough, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Injong","family":"Rhee","sequence":"additional","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,8,12]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"An Empirical Study of Receiver-based AIMD Flow-Control Strategies for CCN. In IEEE ICCCN'13","author":"Braun S.","year":"2013","unstructured":"S. Braun , M. Monti , M. Sifalakis , and C. Tschudin . An Empirical Study of Receiver-based AIMD Flow-Control Strategies for CCN. In IEEE ICCCN'13 , July 2013 . S. Braun, M. Monti, M. Sifalakis, and C. Tschudin. An Empirical Study of Receiver-based AIMD Flow-Control Strategies for CCN. In IEEE ICCCN'13, July 2013."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2012.6193510"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342488.2342497"},{"key":"e_1_2_1_4_1","volume-title":"Multipath Congestion Control in Content-Centric Networks. In IEEE NOMEN'13","author":"Carofiglio G.","year":"2013","unstructured":"G. Carofiglio , M. Gallo , L. Muscariello , and M. Papalini . Multipath Congestion Control in Content-Centric Networks. In IEEE NOMEN'13 , Apr. 2013 . G. Carofiglio, M. Gallo, L. Muscariello, and M. Papalini. Multipath Congestion Control in Content-Centric Networks. In IEEE NOMEN'13, Apr. 2013."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658978.1658980"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460080106"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195631"},{"key":"e_1_2_1_8_1","volume-title":"An Effective Hop-by-hop Interest Shaping Mechanism for CCN Communications. In IEEE NOMEN'12","author":"Rozhnova N.","year":"2012","unstructured":"N. Rozhnova and S. Fdida . An Effective Hop-by-hop Interest Shaping Mechanism for CCN Communications. In IEEE NOMEN'12 , Mar. 2012 . N. Rozhnova and S. Fdida. An Effective Hop-by-hop Interest Shaping Mechanism for CCN Communications. In IEEE NOMEN'12, Mar. 2012."},{"key":"e_1_2_1_9_1","volume-title":"CCTCP: A Scalable Receiver-driven Congestion Control Protocol for Content Centric Networking. In IEEE ICC 2013 - Next-Generation Networking Symposium (ICC'13 NGN)","author":"Saino L.","year":"2013","unstructured":"L. Saino , C. Cocora , and G. Pavlou . CCTCP: A Scalable Receiver-driven Congestion Control Protocol for Content Centric Networking. In IEEE ICC 2013 - Next-Generation Networking Symposium (ICC'13 NGN) , June 2013 . L. Saino, C. Cocora, and G. Pavlou. CCTCP: A Scalable Receiver-driven Congestion Control Protocol for Content Centric Networking. In IEEE ICC 2013 - Next-Generation Networking Symposium (ICC'13 NGN), June 2013."}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2534169.2491233","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2534169.2491233","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:24Z","timestamp":1750231704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2534169.2491233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,12]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,9,19]]}},"alternative-id":["10.1145\/2534169.2491233"],"URL":"https:\/\/doi.org\/10.1145\/2534169.2491233","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2491224.2491233","asserted-by":"subject"}]},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2013,8,12]]},"assertion":[{"value":"2013-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}