{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:54:21Z","timestamp":1761663261830},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"High Speed Networks Laboratory at the Budapest University of Technology and Economics"},{"name":"Hungarian Scientific Research Fund","award":["K108947"],"award-info":[{"award-number":["K108947"]}]},{"name":"TAMOP-4.2.2.C-11\/1\/KONV-2012-0001 project"},{"name":"European Union, cofinanced by the European Social Fund"},{"name":"J\u00e1nos Bolyai Research Scholarship of the Hungarian Academy of Sciences (MTA)"},{"name":"FP7 PURSUIT project grant"},{"name":"European Union under the FP7 G\u00c9ANT project","award":["605243"],"award-info":[{"award-number":["605243"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1109\/tnet.2014.2342155","type":"journal-article","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T22:22:16Z","timestamp":1407968536000},"page":"1832-1845","source":"Crossref","is-referenced-by-count":28,"title":["Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding"],"prefix":"10.1109","volume":"23","author":[{"given":"Janos","family":"Tapolcai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jozsef","family":"Biro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Babarczi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andras","family":"Gulyas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zalan","family":"Heszberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Trossen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/78952.78953"},{"key":"ref11","author":"deering","year":"1988","journal-title":"?Distance vector multicast routing protocol ?"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.17487\/rfc4601"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/ietcom\/e88-b.10.4000"},{"key":"ref14","author":"bion","year":"2000","journal-title":"?Explicit Route Multicast (ERM) ?"},{"key":"ref15","first-page":"1282","article-title":"Linkcast: Fast and scalable multicast routing protocol","author":"bag-mohammadi","year":"2004","journal-title":"Proc IFIP Netw"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2012.6503540"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2013.6655118"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1764873.1764878"},{"key":"ref4","first-page":"2399","article-title":"Forwarding anomalies in Bloom filter-based multicast","author":"s\ufffdrel\ufffd","year":"2011","journal-title":"Proc IEEE InfoCom"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159917"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1282427.1282402"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658941"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2377677.2377693"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2012.6231280"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592592"},{"key":"ref9","first-page":"553","article-title":"Data center networking with in-packet Bloom filters","author":"rothenberg","year":"2010","journal-title":"Proc of the Brazilian Symposium on Computer Networks (SBRC)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1341431.1341440"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"ref22","first-page":"456","article-title":"Less hashing, same performance: Building a better Bloom filter","volume":"14","author":"kirsch","year":"2005","journal-title":"Proc ESA"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.05.018"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.752162"},{"key":"ref23","year":"2014","journal-title":"Intel 64 and IA-32 Architectures Optimization Reference Manual"},{"key":"ref26","author":"knight","year":"2013","journal-title":"?The Internet Topology Zoo ?"},{"key":"ref25","year":"2006","journal-title":"?Survivable fixed telecommunication network design library ?"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/7358195\/06877748.pdf?arnumber=6877748","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:28:21Z","timestamp":1642004901000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6877748\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":26,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2014.2342155","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12]]}}}