{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:47:36Z","timestamp":1649173656715},"reference-count":3,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2009,3]]},"abstract":"<jats:p> Unstructured peer-to-peer (P2P) networks suffer from the increased volume of traffic produced by flooding. Methods such as random walks or dynamic querying managed to limit the traffic at the cost of reduced network coverage. In this paper, we propose a partitioning method of the unstructured overlay network into a relative small number of distinct subnetworks. The partitioning is driven by the categorization of keywords based on a uniform hash function. The method proposed in this paper is easy to implement and results in significant benefit for the blind flood method. Each search is restricted to a certain partition of the initial overlay network and as a result it is much more targeted. Last but not least, the search accuracy is not sacrificed to the least since all related content is searched. The benefit of the proposed method is demonstrated with extensive simulation results, which show that the overhead for the implementation and maintenance of this system is minimal compared to the resulted benefit in traffic reduction. <\/jats:p>","DOI":"10.1142\/s0129626409000067","type":"journal-article","created":{"date-parts":[[2009,1,6]],"date-time":"2009-01-06T09:42:22Z","timestamp":1231234942000},"page":"57-71","source":"Crossref","is-referenced-by-count":0,"title":["HASH-BASED OVERLAY PARTITIONING IN UNSTRUCTURED PEER-TO-PEER SYSTEMS"],"prefix":"10.1142","volume":"19","author":[{"given":"HARRIS","family":"PAPADAKIS","sequence":"first","affiliation":[{"name":"Foundation for Research and Technology-Hellas, Institute of Computer Science, N. Plastira 100, Vassilika Vouton, GR-70013 Heraklion, Crete, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PARASKEVI","family":"FRAGOPOULOU","sequence":"additional","affiliation":[{"name":"Foundation for Research and Technology-Hellas, Institute of Computer Science, N. Plastira 100, Vassilika Vouton, GR-70013 Heraklion, Crete, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"EVANGELOS P.","family":"MARKATOS","sequence":"additional","affiliation":[{"name":"Foundation for Research and Technology-Hellas, Institute of Computer Science, N. Plastira 100, Vassilika Vouton, GR-70013 Heraklion, Crete, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MARIOS D.","family":"DIKAIAKOS","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Cyprus, 1678 Nicosia, Cyprus"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALEXANDROS","family":"LABRINIDIS","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2006.12.003"},{"key":"rf22","volume":"22","author":"Zhao B. Y.","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626409000067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:25:18Z","timestamp":1565108718000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626409000067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":3,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2009,3]]}},"alternative-id":["10.1142\/S0129626409000067"],"URL":"https:\/\/doi.org\/10.1142\/s0129626409000067","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}