Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
A Decentralized, Adaptive Replica Location Mechanism
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Analyzing peer-to-peer traffic across large networks
IEEE/ACM Transactions on Networking (TON)
Characterizing the query behavior in peer-to-peer file sharing systems
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
Taming aggressive replication in the Pangaea wide-area file system
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
| Hi-index | 0.00 |
Peer-to-Peer (P2P) networks based on Gnutella locate files by flooding the network with query messages (a flooding query search). In this paper, a new P2P search paradigm is presented. The network is flooded with the list of shared files and corresponding updates instead of by queries. Novel P2P applications such as power management and ethical file sharing are now possible with this new method. A new protocol named Broadcast Updates with Local Look-up Search (BULLS) enables new applications and reduces overhead traffic by enabling a local look-up of queries (i.e., queries are not broadcast). Nodes periodically broadcast changes in their list of files shared and build a table containing the list of shared files by each node. BULLS and Gnutella are represented using finite state machines (FSM). Flow models are developed to determine the overhead traffic in messages per second. For a representative P2P network scenario, BULLS can reduce Gnutella's overhead traffic by 19%.