{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T16:55:48Z","timestamp":1783097748798,"version":"3.54.6"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,31]],"date-time":"2011-03-31T00:00:00Z","timestamp":1301529600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s12083-011-0101-y","type":"journal-article","created":{"date-parts":[[2011,3,30]],"date-time":"2011-03-30T05:06:29Z","timestamp":1301461589000},"page":"1-13","source":"Crossref","is-referenced-by-count":28,"title":["Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured P2P networks"],"prefix":"10.1007","volume":"5","author":[{"given":"Hassan","family":"Barjini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed","family":"Othman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hamidah","family":"Ibrahim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nur Izura","family":"Udzir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,3,31]]},"reference":[{"key":"101_CR1","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1016\/j.comnet.2008.03.006","volume":"52","author":"M Elena","year":"2008","unstructured":"Elena M, Janne R, Marina P, Petri, M (2008) A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks. Comput Networks 52:2097\u20132128","journal-title":"Comput Networks"},{"key":"101_CR2","doi-asserted-by":"crossref","unstructured":"Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Acm Sigcomm 2001, vol 31, pp 149\u2013160","DOI":"10.1145\/383059.383071"},{"key":"101_CR3","doi-asserted-by":"crossref","unstructured":"Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. In: Acm Sigcomm 2001, vol 31, pp 161\u2013172","DOI":"10.1145\/383059.383072"},{"key":"101_CR4","unstructured":"Napster. http:\/\/music.napster.com\/napsterhomemain.htm . Last visited on 18 January 2011"},{"key":"101_CR5","doi-asserted-by":"crossref","unstructured":"Yang B, Garcia-Molina H (2002) Improving search in peer-to-peer networks. In: International conference on distributed computing systems, vol 22, pp 5\u201314","DOI":"10.1109\/ICDCS.2002.1022237"},{"key":"101_CR6","unstructured":"kaza. http:\/\/www.kazaa.com\/us\/index.htm . Last visited on 18 January 2011"},{"key":"101_CR7","unstructured":"Cohen B (2003) Incentives build robustness in bittorrent. In: 1st workshop on economics of peer-to-peer systems, pp 251\u2013260"},{"key":"101_CR8","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TNET.2007.892877","volume":"15","author":"AO Stauffer","year":"2007","unstructured":"Stauffer AO, Barbosa VC (2007) Probabilistic heuristics for disseminating information in networks. IEEE Trans Netw 15:425\u2013435","journal-title":"IEEE Trans Netw"},{"key":"101_CR9","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/TNET.2007.892880","volume":"15","author":"NB Chang","year":"2007","unstructured":"Chang NB, Liu M (2007) Controlled flooding search in a large network. IEEE Trans Netw 15:436\u2013449","journal-title":"IEEE Trans Netw"},{"key":"101_CR10","unstructured":"Yingwu Z (2005) Enhancing search performance in peer-to-peer networks. PhD thesis, University of Cincinati Departement of Electronic & Computer Engineering and Computer Science"},{"key":"101_CR11","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/COMST.2005.1610546","volume":"7","author":"EK Lua","year":"2005","unstructured":"Lua EK, Crowcroft J, Pias, MSRLS (2005) A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys & Tutorials 7:72\u201393","journal-title":"IEEE Communications Surveys & Tutorials"},{"key":"101_CR12","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/j.comcom.2007.08.011","volume":"31","author":"S Chen","year":"2008","unstructured":"Chen S, Shi B (2008) Efficient file search in non-dht p2p networks. Comput Commun 31:304\u2013317","journal-title":"Comput Commun"},{"key":"101_CR13","doi-asserted-by":"crossref","unstructured":"Oliveira L, Siqueira I, Macedo D, Loureiro A, Wong HC, Nogueira J (2005) Evaluation of peer-to-peer network content discovery techniques over mobile ad hoc networks. In: WoWMoM. Sixth IEEE international symposium on a multimedia networks, pp 51\u201356","DOI":"10.1109\/WOWMOM.2005.40"},{"key":"101_CR14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.orl.2003.08.007","volume":"32","author":"Y Baryshnikov","year":"2004","unstructured":"Baryshnikov Y, Coffman E, Jelenkovic P, Momcilovic P, Rubenstein D (2004) Flood search under the california split rule. Oper Res Lett 32:199\u2013206","journal-title":"Oper Res Lett"},{"key":"101_CR15","unstructured":"Jiang S, Zhang X (2003) Floodtrail: an efficient file search technique in unstructured peer-to-peer systems. In: Global telecommunications conference. Globecom, vol 5, pp 2891\u20132895"},{"issue":"5","key":"101_CR16","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/TPDS.2007.70772","volume":"19","author":"S Jiang","year":"2008","unstructured":"Jiang S, Guo L, Zhang X, Wang H (2008) Lightflood: minimizing redundant messages and maximizing scope of peer-to-peer search. IEEE Trans Parallel Distrib Syst 19(5):601\u2013614","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"101_CR17","doi-asserted-by":"crossref","unstructured":"Sripanidkulchai K, Maggs B, Zhang H (2003) Efficient content location using interest-based locality in peer-to-peer systems. In: IEEE Infocom, vol 3, pp 2166\u20132176","DOI":"10.1109\/INFCOM.2003.1209237"},{"key":"101_CR18","doi-asserted-by":"crossref","unstructured":"Lv Q, Ratnasamy S, Shenker S (2002) Can heterogeneity make gnutella scalable? In: Proc first int workshop peer-to-peer systems (IPTPS \u201902), vol 2429, pp 94\u2013103","DOI":"10.1007\/3-540-45748-8_9"},{"key":"101_CR19","unstructured":"Aberer K, Hauswirth M (2002) An overview on peer-to-peer information systems. In: WDAS, pp 171\u2013188"},{"key":"101_CR20","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TPDS.2007.70732","volume":"19","author":"Z Zhu","year":"2008","unstructured":"Zhu Z, Kalnis P, Bakiras S (2008) Dcmp: a distributed cycle minimization protocol for peer-to-peer networks. IEEE Trans Parallel Distrib Syst 19:363\u2013377","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"11","key":"101_CR21","doi-asserted-by":"crossref","first-page":"1668","DOI":"10.1109\/TPDS.2009.24","volume":"20","author":"HC Hsiao","year":"2009","unstructured":"Hsiao HC, Liao H, Huang CC (2009) Resolving the topology mismatch problem in unstructured peer-to-peer networks. IEEE Trans Parallel Distrib Syst 20(11):1668\u20131681","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"101_CR22","unstructured":"Medina A, Byers J, Matta I (2000-005) Brite: a flexible generator of internet topologies. Tech. Rep., Boston, MA, USA"},{"key":"101_CR23","doi-asserted-by":"crossref","unstructured":"Chang N, Liu M (2004) Revisiting the ttl-based controlled flooding search: optimality and randomization. In: Mobile computing and networking, pp 85\u201399","DOI":"10.1145\/1023720.1023730"},{"key":"101_CR24","unstructured":"Jahan Hassan SJ (2005) On the optimization trade-offs of expanding ring search. LNCS, vol 3326. Springer, pp 489\u2013494"},{"key":"101_CR25","unstructured":"Chou CC (2007) Techniques for peer-to-peer content distribution over mobile ad hoc networks. PhD thesis, University of Southern California Department of Electrical Engineering"},{"key":"101_CR26","unstructured":"Pu IM, Shen Y (2009) Enhanced blocking expanding ring search in mobile ad hoc networks. In: 3rd international conference on new technologies, mobility and security (NTMS), pp 1\u20135"},{"key":"101_CR27","unstructured":"Tsoumakos D, Roussopoulos N (2003) A comparison of peer-to-peer search methods. In: Proceedings of the sixth international workshop on the web and databases, San Diego, USA"},{"key":"101_CR28","unstructured":"Lv Q, Cao P, Cohen E, Li K, Shenker S (2002) Search and replication in unstructured peer-to-peer networks. In: Proceedings of the 16th international conference on supercomputing, vol 30, pp 84\u201395"},{"key":"101_CR29","doi-asserted-by":"crossref","unstructured":"Kalogeraki V, Zeinalipour-Yazti D, Gunopulos D (2002) A local search mechanism for peer-to-peer networks. In: Conference on information and knowledge management, CIKM 2002. Association for Computing Machinery, pp 300\u2013307","DOI":"10.1145\/584792.584842"},{"issue":"11","key":"101_CR30","doi-asserted-by":"crossref","first-page":"1242","DOI":"10.1109\/TPDS.2006.161","volume":"17","author":"V Vassilios","year":"2006","unstructured":"Vassilios V, Dimakopoulos EP (2006) On the performance of flooding-based resource discovery. IEEE Trans Parallel Distrib Syst 17(11):1242\u20131252","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"101_CR31","doi-asserted-by":"crossref","unstructured":"Bloom BH (1970) Space\/time trade-offs in hash coding with allowable errors. In: Communications of the ACM, vol 13, pp 422\u2013426","DOI":"10.1145\/362686.362692"},{"key":"101_CR32","doi-asserted-by":"crossref","unstructured":"Fan L, Cao P, Almeida J, Broder AZ (1998) Summary cache: a scalable wide-area web cache sharing protocol. In: Proceedings of the ACM conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM), pp 291\u2013293","DOI":"10.1145\/285237.285287"},{"key":"101_CR33","unstructured":"Rhea SC, Kubiatowicz J (2002) Probabilistic location and routing. In: Proc. IEEE Infocom\u201802, vol 3, pp 1248\u20131257"},{"key":"101_CR34","unstructured":"Kumar A, Xu J, Zegura EW (2005) Efficient and scalable query routing for unstructure peer-to-peer networks. In: Proc. IEEE Infocom\u201805, vol 2, pp 1162\u20131173"},{"key":"101_CR35","unstructured":"Broder A, Mitzenmacher M (2002) Network applications of bloom filters: a survey. In: Proceedings of the annual allerton conference on communication control and computing, vol 40, pp 636\u2013646"},{"key":"101_CR36","doi-asserted-by":"crossref","first-page":"3373","DOI":"10.1016\/j.comnet.2010.07.003","volume":"54","author":"B Donnet","year":"2010","unstructured":"Donnet B, Baynat B, Friedman T (2010) Improving retouched bloom filter for trading off selected false positives against false negatives. Comput Netw Elsevier 54:3373\u20133378","journal-title":"Comput Netw Elsevier"},{"key":"101_CR37","doi-asserted-by":"crossref","unstructured":"Chawathe Y, Ratnasamy S, Breslau L, Lanham N, Shenker S (2003) Making gnutella-like p2p systems scalable. In: Computer communication review, vol 33, pp 407\u2013418","DOI":"10.1145\/863955.864000"},{"key":"101_CR38","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1109\/TPDS.2007.1060","volume":"18","author":"D Zeinalipour-Yazti","year":"2007","unstructured":"Zeinalipour-Yazti D, Vana Kalogeraki DG (2007) pfusion: A p2p architecture for internet-scale content-based search and retrieval. IEEE Trans Parallel Distrib Syst 18:804\u2013817","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"10","key":"101_CR39","doi-asserted-by":"crossref","first-page":"2818","DOI":"10.1016\/j.comnet.2006.12.002","volume":"51","author":"S Jin","year":"2007","unstructured":"Jin S, Jiang H (2007) Novel approaches to efficient flooding search in peer-to-peer networks. Comput Networks 51(10):2818\u20132832","journal-title":"Comput Networks"},{"key":"101_CR40","unstructured":"Clip2 (2007) http:\/\/www.clip2.com"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-011-0101-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12083-011-0101-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-011-0101-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T10:40:42Z","timestamp":1560076842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12083-011-0101-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,31]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["101"],"URL":"https:\/\/doi.org\/10.1007\/s12083-011-0101-y","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,31]]}}}