Show simple item record

Analysis and Comparison of P2P Search Methods

dc.contributor.authorTsoumakos, Dimitriosen_US
dc.contributor.authorRoussopoulos, Nicken_US
dc.date.accessioned2004-05-31T23:33:49Z
dc.date.available2004-05-31T23:33:49Z
dc.date.created2003-11en_US
dc.date.issued2003-11-25en_US
dc.identifier.urihttp://hdl.handle.net/1903/1323
dc.description.abstractThe popularity and bandwidth consumption attributed to current Peer-to-Peer file-sharing applications makes the operation of these distributed systems very important for the Internet community. Efficient object discovery is the first step towards the realization of distributed resource-sharing. In this work, we present a detailed overview of recent and existing search methods for unstructured Peer-to-Peer networks. We analyze the performance of the algorithms relative to various metrics, giving emphasis on the success rate, bandwidth-efficiency and adaptation to dynamic network conditions. Simulation results are used to empirically evaluate the behavior of nine representative schemes under a variety of different environments. (UMIACS-TR-2003-107)en_US
dc.format.extent216979 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4539en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-2003-107en_US
dc.titleAnalysis and Comparison of P2P Search Methodsen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record