{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:58:29Z","timestamp":1760709509416,"version":"3.37.3"},"reference-count":16,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation for Outstanding Excellent young scholars of China","doi-asserted-by":"publisher","award":["61422214"],"award-info":[{"award-number":["61422214"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772544"],"award-info":[{"award-number":["61772544"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Basic Research Program (973 program)","award":["2014CB347800"],"award-info":[{"award-number":["2014CB347800"]}]},{"name":"Hunan Provincial Natural Science Fund for Distinguished Young Scholars","award":["2016JJ1002"],"award-info":[{"award-number":["2016JJ1002"]}]},{"name":"Guangxi Cooperative Innovation Center of cloud computing and Big Data","award":["YD16507","YD17X11"],"award-info":[{"award-number":["YD16507","YD17X11"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/lcomm.2018.2798668","type":"journal-article","created":{"date-parts":[[2018,1,26]],"date-time":"2018-01-26T19:14:26Z","timestamp":1516994066000},"page":"700-703","source":"Crossref","is-referenced-by-count":9,"title":["Optimization of Multicast Source-Routing Based on Bloom Filter"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5519-1375","authenticated-orcid":false,"given":"Geyao","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4894-5540","authenticated-orcid":false,"given":"Deke","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lailong","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yudong","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2342155"},{"journal-title":"Yes-no bloom filter A way of representing sets with fewer false positives","year":"2016","author":"carrea","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.12785\/amis\/080445"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2013.09.002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TST.2016.7442499"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.6312192"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288961"},{"key":"ref3","first-page":"770","article-title":"Improved Steiner tree approximation in graphs","author":"robins","year":"1999","journal-title":"Proc SODA"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.031611.00024"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.11"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ColComCon.2015.7152107"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2010.5700387"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009758919736"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1041"},{"key":"ref9","first-page":"1","article-title":"Developing information networking further: From PSIRP to PURSUIT","author":"fotiou","year":"2010","journal-title":"Proc Broadband Commun Netw Syst"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/8334015\/08270684.pdf?arnumber=8270684","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T04:15:00Z","timestamp":1643170500000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8270684\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":16,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2018.2798668","relation":{},"ISSN":["1089-7798"],"issn-type":[{"type":"print","value":"1089-7798"}],"subject":[],"published":{"date-parts":[[2018,4]]}}}