{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:28:03Z","timestamp":1649129283400},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,11,20]],"date-time":"2013-11-20T00:00:00Z","timestamp":1384905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s11277-013-1461-9","type":"journal-article","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T08:20:16Z","timestamp":1384849216000},"page":"2165-2180","source":"Crossref","is-referenced-by-count":1,"title":["Impact of Bloom Filter on Infection Rate in Epidemic Forwarding for ICNs"],"prefix":"10.1007","volume":"75","author":[{"given":"Shailendra","family":"Shukla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nishant","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajiv","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,20]]},"reference":[{"key":"1461_CR1","unstructured":"Vahdat, A., & Becker, D. (2000). Epidemic routing for partially-connected ad hoc networks. Duke University Technical, Report CS-200006."},{"key":"1461_CR2","doi-asserted-by":"crossref","unstructured":"Lindgren, A., Doria, A., & Schelen, O. (2004). Probabilistic routing in intermittently connected networks. In Proceedings of the first international workshop on assurance with partial and intermittent resources (SAPIR). Fortaleza, Brazil.","DOI":"10.1007\/978-3-540-27767-5_24"},{"key":"1461_CR3","doi-asserted-by":"crossref","unstructured":"Groenevelt, R., Koole, G., & Nain, P. (2005). The message delay in mobile ad hoc networks. Performance Evaluation, 62(1\u20134) (presented at Performance 2005 conference, Juan-les-Pins).","DOI":"10.1016\/j.peva.2005.07.018"},{"key":"1461_CR4","unstructured":"Zhang, X., Neglia, G., Kurose, J., & Towsley, D. (2005). Performance modeling of epidemic routing. University of Massachusetts Technical Report CMPSCI 05\u201344."},{"key":"1461_CR5","doi-asserted-by":"crossref","unstructured":"Tower, J. P., & Thomas L. D. (2008) A proposed scheme for epidemic routing with active curing for opportunistic networks. In Advanced information networking and applications-workshops, 2008. AINAW 2008. 22nd international conference on. IEEE.","DOI":"10.1109\/WAINA.2008.247"},{"issue":"1","key":"1461_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/TNET.2007.897964","volume":"16","author":"T Spyropoulos","year":"2008","unstructured":"Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008). Efficient routing in intermittently connected mobile networks: The multiple-copy case. Networking, IEEE\/ACM Transactions on, 16(1), 77\u201390.","journal-title":"Networking, IEEE\/ACM Transactions on"},{"issue":"5","key":"1461_CR7","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1109\/JSAC.2008.080605","volume":"26","author":"T Matsuda","year":"2008","unstructured":"Matsuda, T., & Takine, T. (2008). (p, q)-Epidemic routing for sparsely populated mobile ad hoc networks. Selected Areas in Communications, IEEE Journal on, 26(5), 783\u2013793.","journal-title":"Selected Areas in Communications, IEEE Journal on"},{"issue":"7","key":"1461_CR8","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B. H. (1970). Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7), 422\u2013426.","journal-title":"Communications of the ACM"},{"issue":"4","key":"1461_CR9","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1145\/285243.285287","volume":"28","author":"L Fan","year":"1998","unstructured":"Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (1998). Summary cache: A scalable wide-area web cache sharing protocol. SIGCOMM Computer Communications Review, 28(4), 254\u2013265.","journal-title":"SIGCOMM Computer Communications Review"},{"issue":"5","key":"1461_CR10","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/TNET.2002.803864","volume":"10","author":"M Mitzenmacher","year":"2002","unstructured":"Mitzenmacher, M. (2002). Compressed bloom filters. IEEE\/ACM Transactions on Networking (TON), 10(5), 604\u2013612.","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"key":"1461_CR11","unstructured":"Zhu, Y., Jiang, H., & Wang, J. (2004). Hierarchical bloom filter arrays (hba): a novel, scalable metadata management system for large cluster-based storage. In Cluster computing, 2004 IEEE international conference on. IEEE."},{"key":"1461_CR12","unstructured":"Laufer, R. P., Velloso, P. B., & Duarte, O. C. M. B. (2005). Generalized bloom filters. In Electrical engineering program, COPPE\/UFRJ, Tech. Rep. GTA-05-43."},{"key":"1461_CR13","doi-asserted-by":"crossref","unstructured":"Bruck, J., Gao, J., & Jiang, A. (2006). Weighted bloom filter. In Information theory, 2006 IEEE international symposium on. IEEE.","DOI":"10.1109\/ISIT.2006.261978"},{"issue":"6","key":"1461_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.ipl.2006.10.007","volume":"101","author":"PS Almeida","year":"2007","unstructured":"Almeida, P. S., et al. (2007). Scalable bloom filters. Information Processing Letters, 101(6), 255\u2013261.","journal-title":"Information Processing Letters"},{"key":"1461_CR15","doi-asserted-by":"crossref","unstructured":"Bruck, J., Gao, J., & Jiang, A. A. (2006). Adaptive bloom filter.","DOI":"10.1109\/ISIT.2006.261978"},{"issue":"1","key":"1461_CR16","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/TKDE.2009.57","volume":"22","author":"D Guo","year":"2010","unstructured":"Guo, D., et al. (2010). The dynamic bloom filters. Knowledge and Data Engineering, IEEE Transactions on, 22(1), 120\u2013133.","journal-title":"Knowledge and Data Engineering, IEEE Transactions on"},{"key":"1461_CR17","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Wu, J. (2010). B-sub: A practical bloom-filter-based publish-subscribe system for human networks. In Distributed computing systems (ICDCS), 2010 IEEE 30th international conference on. IEEE.","DOI":"10.1109\/ICDCS.2010.89"},{"key":"1461_CR18","unstructured":"Small, T., & Haas, Z. J. (2003). The shared wireless infostation model: A new ad hoc networking paradigm(or where there is a whale, there is a way). In International symposium on mobile ad hoc networking & computing: proceedings of the 4 th ACM international symposium on mobile ad hoc networking & computing (Vol. 1., No. 03)."},{"key":"1461_CR19","unstructured":"Groenevelt, R. (2005). Stochastic models in mobile ad hoc networks. Sophia Antipolis: University of Nice."},{"key":"1461_CR20","unstructured":"Apple by, Austin. Murmurhash 2.0. (2008)."},{"issue":"9","key":"1461_CR21","first-page":"107","volume":"22","author":"B Jenkins","year":"1997","unstructured":"Jenkins, B. (1997). Hash functions. Dr Dobbs Journal, 22(9), 107.","journal-title":"Dr Dobbs Journal"},{"key":"1461_CR22","doi-asserted-by":"crossref","unstructured":"Bacon, D. F., Fink, S. J., & Grove, D. (2002). Space-and time-efficient implementation of the Java object model. ECOOP. Vol. 2. minutes.","DOI":"10.1007\/3-540-47993-7_5"},{"key":"1461_CR23","doi-asserted-by":"crossref","unstructured":"Kernen, A., Jrg, O., & Teemu, K. (2009). The ONE simulator for DTN protocol evaluation. In Proceedings of the 2nd international conference on simulation tools and techniques. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-013-1461-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-013-1461-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-013-1461-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T14:18:42Z","timestamp":1564755522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-013-1461-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,20]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["1461"],"URL":"https:\/\/doi.org\/10.1007\/s11277-013-1461-9","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,20]]}}}