{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:15:44Z","timestamp":1704932144356},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2022,12,1]]},"DOI":"10.1587\/transcom.2021ebp3217","type":"journal-article","created":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T22:10:00Z","timestamp":1654726200000},"page":"1519-1529","source":"Crossref","is-referenced-by-count":0,"title":["A Rate-Based Congestion Control Method for NDN Using Sparse Explicit Rate Notification and AIMD-Based Rate Adjustment"],"prefix":"10.23919","volume":"E105.B","author":[{"given":"Takahiko","family":"KATO","sequence":"first","affiliation":[{"name":"Dept. of Information and Communication Sciences, Sophia University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaki","family":"BANDAI","sequence":"additional","affiliation":[{"name":"Dept. of Information and Communication Sciences, Sophia University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] G. Xylomenos, C. Ververidis, V. Siris, N. Fotiou, C. Tsilopoulos, X. Vasilakos, K. Katsaros, and G. Polyzos, \u201cA survey of information-centric networking research,\u201d IEEE Commun. Surveys Tuts., vol.16, no.2, pp.1024-1048, 2014. 10.1109\/surv.2013.070813.00063","DOI":"10.1109\/SURV.2013.070813.00063"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] A.V. Vasilakos, Z. Li, V. Siris, G. Simon, and W. You, \u201cInformation centric network: Research challenges and opportunities,\u201d J. Netw. Comput. Appl., vol.52, pp.1-10, 2015. 10.1016\/j.jnca.2015.02.001","DOI":"10.1016\/j.jnca.2015.02.001"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Q. Chen, R. Xie, and F.R. Yu, \u201cTransport control strategies in named data networking: A survey,\u201d IEEE Commun. Surveys Tuts., vol.18, no.3, pp.2052-2083, 2016. 10.1109\/comst.2016.2528164","DOI":"10.1109\/COMST.2016.2528164"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] V. Jacobson, D. Smetters, J. Thornton, M. Plass, N. Briggs, and R. Braynard, \u201cNetworking named content,\u201d Proc. ACM CoNext 2009, pp.1-12, Dec. 2009. 10.1145\/1658939.1658941","DOI":"10.1145\/1658939.1658941"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] D. Saxena, V. Raychoudhury, N. Suri, C. Becker, and J. Cao, \u201cNamed data networking: A survey,\u201d Computer Science Review, vol.19, pp.15-55, Feb. 2016. 10.1016\/j.cosrev.2016.01.001","DOI":"10.1016\/j.cosrev.2016.01.001"},{"key":"6","unstructured":"[6] M. Chand, \u201cA comparative survey on different caching mechanisms in named data networking (NDN) architecture,\u201d International Journal of Emerging Technologies and Innovative Research, vol.9, no.4, pp.264-271, April 2019."},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Y. Ren, J. Li, S. Shi, L. Li, G. Wang, and B. Zhang, \u201cCongestion control in named data networking-A survey,\u201d Comput. Commun., vol.86 pp.1-11, July 2016. 10.1016\/j.comcom.2016.04.017","DOI":"10.1016\/j.comcom.2016.04.017"},{"key":"8","unstructured":"[9] B. Dawson, \u201cWindows timer resolution: The grate rule change,\u201d Random ASCII-tech blog of Truce Dawson, Posted on Oct. 4, 2020, https:\/\/randomascii.wordpress.com\/2020\/10\/04\/windows-timer-resolution-the-great-rule-change\/, accessed on April 25, 2022."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[10] T. Kato, T. Enda, R. Yamamoto, and S. Ohzahata, \u201cHow coarse-grained clock impacts on performance of NDN rate-based congestion control with explicit rate reporting,\u201d Proc. Federated Conference on Computer Science and Information Systems, FedCSIS 2020, pp.479-488, Sept. 2020. 10.15439\/2020f40","DOI":"10.15439\/2020F40"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[11] T. Kato, M. Bandai, and M. Yamamoto, \u201cA congestion control method for named data networking with hop-by-hop window-based approach,\u201d IEICE Trans. Commun., vol.E102-B, no.1, pp.97-110, Jan. 2019. 10.1587\/transcom.2018ebp3045","DOI":"10.1587\/transcom.2018EBP3045"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[12] G. Carofiglio, M. Gallo, and L. Muscariello, \u201cICP: Design and evaluation of an interest control protocol for content-centric networking,\u201d Proc. IEEE INFOCOM 2012, pp.304-309, 2012. 10.1109\/infcomw.2012.6193510","DOI":"10.1109\/INFCOMW.2012.6193510"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[13] S. Salsano, A. Detti, M. Cancellieri, M. Pomposini, and N. Blefari-Melazzi, \u201cTransport-layer issues in information centric networks,\u201d Proc. ACM ICN2012, Aug. 2012. 10.1145\/2342488.2342493","DOI":"10.1145\/2342488.2342493"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[14] F. Zhang, Y. Zhang, A. Reznik, H. Liu, C. Qian, and C. Xu, \u201cA transport protocol for content-centric networking with explicit congestion control,\u201d Proc. IEEE ICCCN 2014. 10.1109\/icccn.2014.6911765","DOI":"10.1109\/ICCCN.2014.6911765"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[15] Y. Ren, J. Li, S. Shi, L. Li, and X. Chang, \u201cAn interest control protocol for named data networking based on explicit feedback,\u201d Proc. 11th ACM\/IEEE Symposium on ANCS'15, 2015. 10.1109\/ancs.2015.7110139","DOI":"10.1109\/ANCS.2015.7110139"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[16] K. Schneider, C. Yi, B. Zhang, and L. Zhang, \u201cA practical congestion control scheme for named data networking,\u201d Proc. ACM ICN 2016, pp.21-30, 2016. 10.1145\/2984356.2984369","DOI":"10.1145\/2984356.2984369"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[17] M. Wang, M. Yue, and Z. Wu, \u201cWinCM: A window based congestion control mechanism for NDN,\u201d Proc. IEEE HotICN 2018, pp.80-86, 2018. 10.1109\/hoticn.2018.8606039","DOI":"10.1109\/HOTICN.2018.8606039"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[18] S. Xing, B. Yin, J. Yao, H. Zhang, Q. Zhai, and H. Shi, \u201cA VCP-based congestion control algorithm in named data networking,\u201d Proc. IEEE IAEAC 2018, pp.463-468, 2018. 10.1109\/iaeac.2018.8577496","DOI":"10.1109\/IAEAC.2018.8577496"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[19] Y. Cheng, A. Afanasyev, I. Moiseenko, B. Zhang, L. Wang, and L. Zhang, \u201cA case for stateful forwarding plane,\u201d Computer Communications, vol.36, no.7, pp.779-791, April 2013. 10.1016\/j.comcom.2013.01.005","DOI":"10.1016\/j.comcom.2013.01.005"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[20] T. Kato and M. Bandai, \u201cAvoiding excessive rate reduction in rate based congestion control for named data networking,\u201d Journal of Information Processing, vol.26, pp.29-37, 2018. 10.2197\/ipsjjip.26.29","DOI":"10.2197\/ipsjjip.26.29"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[21] N. Rozhnova and S. Fdida, \u201cAn effective hop-by-hop Interest shaping mechanism for CCN communications,\u201d Proc. IEEE INFOCOM 2012, pp.322-327, March 2012. 10.1109\/infcomw.2012.6193514","DOI":"10.1109\/INFCOMW.2012.6193514"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[22] N. Rozhnova and S. Fdida, \u201cAn extended hop-by-hop interest shaping mechanism for content-centric networking,\u201d Proc. IEEE GLOBECOM 2014, Dec. 2014. 10.1109\/glocom.2014.7389766","DOI":"10.1109\/GLOCOM.2014.7389766"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[23] S. Zhong, Y. Liu, J. Li, and K. Lei, \u201cA rate-based multipath-aware congestion control mechanism in named data networking,\u201d Proc. IEEE ISPA\/IUCC 2017, pp.174-181, 2017. 10.1109\/ispa\/iucc.2017.00034","DOI":"10.1109\/ISPA\/IUCC.2017.00034"},{"key":"23","unstructured":"[24] J. Zhang, Q. Wu, Z. Li, M.A. Kaafar, and G. Xie, \u201cA proactive transport mechanism with explicit congestion notification for NDN,\u201d Proc. IEEE ICC 2015, June 2015. 10.1109\/icc.2015.7249156"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[25] M. Mahdian, S. Arianfar, J. Gibson, and D. Oran, \u201cMIRCC: Multipath-aware ICN rate-based congestion control,\u201d Proc. ACM ICN2016, pp.1-10, Sept. 2016. 10.1145\/2984356.2984365","DOI":"10.1145\/2984356.2984365"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[26] H. Khelifi, S. Luo, B. Nour, and H. Moungla, \u201cLQCC: A link quality-based congestion control scheme in named data networks,\u201d Proc. IEEE WCNC 2019, April 2019. 10.1109\/wcnc.2019.8885909","DOI":"10.1109\/WCNC.2019.8885909"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[27] A. Thibaud, J. Fasson, F. Arnal, R. Sallantin, E. Dubois, and E. Chaput, \u201cCooperative congestion control in NDN,\u201d Proc. IEEE ICC 2020, July 2020. 10.1109\/icc40277.2020.9149034","DOI":"10.1109\/ICC40277.2020.9149034"},{"key":"27","unstructured":"[28] A. Afanasyev, I. Moiseenko, L. Zhang, \u201cndnSIM: NDN simulator for NS-3,\u201d NDN, Technical Report NDN-0005, 2012, Oct. 2012."}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E105.B\/12\/E105.B_2021EBP3217\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T15:01:51Z","timestamp":1704898911000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E105.B\/12\/E105.B_2021EBP3217\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,1]]},"references-count":27,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2021ebp3217","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,1]]},"article-number":"2021EBP3217"}}