{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T11:07:31Z","timestamp":1778756851654,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T00:00:00Z","timestamp":1677801600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T00:00:00Z","timestamp":1677801600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"2021 scientific research project of Hebei Energy Technology Service Co., Ltd. of State Grid","award":["TSS2021-015"],"award-info":[{"award-number":["TSS2021-015"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. Adv. Signal Process."],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In order to solve the problem that the original path forwarding traffic caused by congestion that cannot be recovered in time in Smart Grid Communication, a congestion control scheme RFCC (Router Forwarding Congestion Control) based on path recovery is proposed, which not only supports the receiving end combined with router nodes to relieve congestion, it can also solve the problem of low transmission performance caused by not being able to restore the original path in time after the traffic is transferred. Active queue management technology is used to detect congestion and notify downflow nodes (users and routers) in time, which trigger downflow users to adjust the request sending window and intermediate routers to transfer packets. In addition, the original path traffic is restored in time through the path recovery policy. Firstly, the path traffic is recovered according to the congestion mark carried by the subsequent content packets. Secondly, the transmission frequency of the probe packets is calculated according to the information such as the packet queue length of routers and the available bandwidth of the congested path, and the probe packets are periodically sent to the congested path, and the traffic is sent to the congested path in time. The alternate path is transferred back to the original path. This paper implements the scheme in NS-3, and extensive experiments show that the proposed scheme outperforms the comparison schemes, which not only higher and more stable throughput can be obtained, but also shorter and more stable transmission delay can be obtained. In addition, the optimal path transmission volume and link utilization are improved.<\/jats:p>","DOI":"10.1186\/s13634-023-00989-1","type":"journal-article","created":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T10:02:39Z","timestamp":1677837759000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A congestion control scheme based on path recovery for smart grid communication"],"prefix":"10.1186","volume":"2023","author":[{"given":"Yanpeng","family":"Ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siming","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianli","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liangshuai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiyan","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingdi","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deliang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,3]]},"reference":[{"key":"989_CR1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.comnet.2017.05.030","volume":"125","author":"M Faran Majeed","year":"2017","unstructured":"M. Faran Majeed et al., Multimedia streaming in information-centric networking: a survey and future perspectives. Comput. Netw. 125, 103\u2013121 (2017)","journal-title":"Comput. Netw."},{"key":"989_CR2","doi-asserted-by":"crossref","unstructured":"L., Zhang, et al., Named data networking. ACM SIGCOMM Comput. Commun. Rev. 44(3) (2014)","DOI":"10.1145\/2656877.2656887"},{"key":"989_CR3","doi-asserted-by":"crossref","unstructured":"S., Bell, et al. TILE64 - processor: A 64-core SoC with mesh interconnect. In: 2008 IEEE International Solid-State Circuits Conference - Digest of Technical Papers (2008).","DOI":"10.1109\/ISSCC.2008.4523070"},{"issue":"1","key":"989_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13638-016-0554-z","volume":"2016","author":"Z Li","year":"2016","unstructured":"Z. Li et al., NDN-GSM-R: a novel high-speed railway communication system via named data networking. EURASIP J. Wirel. Commun. Netw. 2016(1), 1\u20135 (2016)","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"issue":"2","key":"989_CR5","doi-asserted-by":"publisher","first-page":"1950","DOI":"10.1109\/COMST.2018.2880444","volume":"21","author":"Z Li","year":"2019","unstructured":"Z. Li et al., Packet forwarding in named data networking requirements and survey of solutions. IEEE Commun Surv Tutor 21(2), 1950\u20131987 (2019)","journal-title":"IEEE Commun Surv Tutor"},{"key":"989_CR6","doi-asserted-by":"crossref","unstructured":"K., Schneider, et al. A practical congestion control scheme for named data networking. In: Proceedings of the 3rd ACM Conference on Information-Centric Networking (2016)","DOI":"10.1145\/2984356.2984369"},{"issue":"2","key":"989_CR7","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/TNET.2021.3119769","volume":"30","author":"Z Li","year":"2022","unstructured":"Z. Li et al., Smart name lookup for NDN forwarding plane via neural networks. IEEE\/ACM Trans Netw 30(2), 529\u2013541 (2022)","journal-title":"IEEE\/ACM Trans Netw"},{"key":"989_CR8","doi-asserted-by":"crossref","unstructured":"L., Yan, Z., Li, K., Liu, Learning tree: neural network-based index for NDN forwarding plane. In: Proceedings of the ACM SIGCOMM 2019 Conference Posters and Demos (2019)","DOI":"10.1145\/3342280.3342308"},{"key":"989_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comcom.2016.04.017","volume":"86","author":"Y Ren","year":"2016","unstructured":"Y. Ren et al., Congestion control in named data networking: a survey. Comput. Commun. 86, 1\u201311 (2016)","journal-title":"Comput. Commun."},{"key":"989_CR10","doi-asserted-by":"crossref","unstructured":"Carofiglio, G., et al., ICP: design and evaluation of an interest control protocol for content-centric networking, In: 2012 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS). 2012: IEEE Conference on Computer Communications (INFOCOM). pp. 304\u2013309 (2012)","DOI":"10.1109\/INFCOMW.2012.6193510"},{"key":"989_CR11","doi-asserted-by":"crossref","unstructured":"L., Saino, et al., CCTCP: a scalable receiver-driven congestion control protocol for content centric networking, In: 2013 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC). 2013: IEEE International Conference on Communications (ICC). pp. 3775\u20133780 (2013)","DOI":"10.1109\/ICC.2013.6655143"},{"key":"989_CR12","doi-asserted-by":"crossref","unstructured":"N., Rozhnova, S., Fdida, IEEE: an effective hop-by-hop Interest shaping mechanism for CCN communications, In: 2012 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS). 2012: IEEE Conference on Computer Communications (INFOCOM). pp. 322\u2013327 (2012)","DOI":"10.1109\/INFCOMW.2012.6193514"},{"key":"989_CR13","doi-asserted-by":"crossref","unstructured":"K., Schneider, et al., A practical congestion control scheme for named data networking, In: PROCEEDINGS OF THE 2016 3RD ACM CONFERENCE ON INFORMATION-CENTRIC NETWORKING (ACM-ICN '16). 2016: 3rd ACM International Conference on Information-Centric Networking (ACM-ICN). pp. 21\u201330 (2016)","DOI":"10.1145\/2984356.2984369"},{"key":"989_CR14","doi-asserted-by":"crossref","unstructured":"R., Pan, et al. PIE: a lightweight control scheme to address the bufferbloat problem. In: 2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR) (2013).","DOI":"10.1109\/HPSR.2013.6602305"},{"key":"989_CR15","doi-asserted-by":"crossref","unstructured":"Y., Ren, et al. An explicit congestion control algorithm for named data networking. In: 2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) (2016)","DOI":"10.1109\/INFCOMW.2016.7562089"},{"key":"989_CR16","doi-asserted-by":"crossref","unstructured":"Wang, Y., et al. An improved hop-by-hop interest shaper for congestion control in named data networking. In: Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking. (Hong Kong, China: Association for Computing Machinery, 2013)","DOI":"10.1145\/2491224.2491233"},{"issue":"4","key":"989_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/2534169.2491233","volume":"43","author":"Y Wang","year":"2013","unstructured":"Y. Wang et al., An improved hop-by-hop interest shaper for congestion control in named data networking. SIGCOMM Comput. Commun. Rev. 43(4), 55\u201360 (2013)","journal-title":"SIGCOMM Comput. Commun. Rev."}],"container-title":["EURASIP Journal on Advances in Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-023-00989-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13634-023-00989-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-023-00989-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T10:06:44Z","timestamp":1677838004000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-023-00989-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,3]]},"references-count":17,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["989"],"URL":"https:\/\/doi.org\/10.1186\/s13634-023-00989-1","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2368709\/v1","asserted-by":"object"}]},"ISSN":["1687-6180"],"issn-type":[{"value":"1687-6180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,3]]},"assertion":[{"value":"12 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"28"}}