Strategies for distributed search
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Summary cache: a scalable wide-area Web cache sharing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Deterministic resource discovery in distributed networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
A Scalable Agent Location Mechanism
ATAL '99 6th International Workshop on Intelligent Agents VI, Agent Theories, Architectures, and Languages (ATAL),
Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems"
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Asynchronous Resource Discovery in Peer to Peer Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Performance Analysis of Distributed Search in Open Agent Systems
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Asynchronous resource discovery
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Cache Updates in a Peer-to-Peer Network of Mobile Agents
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Towards bidirectional distributed matchmaking
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
BlåtAnt: Bounding Networks' Diameter with a Collaborative Distributed Algorithm
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Enabling efficient information discovery in a self-structured grid
Future Generation Computer Systems
Probabilistic flooding for efficient information dissemination in random graph topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
An efficient hybridflood searching algorithm for unstructured peer-to-peer networks
ICICA'10 Proceedings of the First international conference on Information computing and applications
Information dissemination dynamics in delay tolerant network: a bipartite network approach
Proceedings of the third ACM international workshop on Mobile Opportunistic Networks
A mathematical model for human flesh search engine
APWeb'12 Proceedings of the 14th international conference on Web Technologies and Applications
Analytical studies and experimental examines for flooding-based search algorithms
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
| Hi-index | 0.00 |
We consider flooding-based resource discovery in distributed systems. With flooding, a node searching for a resource contacts its neighbors in the network, which in turn contact their own neighbors and so on until a node possessing the requested resource is located. Flooding assumes no knowledge about the network topology or the resource distribution thus offering an attractive means for resource discovery in dynamically evolving networks such as peer-to-peer systems. We provide analytical results for the performance of a number of flooding-based approaches that differ in the set of neighbors contacted at each step. The performance metrics we are interested in are the probability of locating a resource and the average number of steps and messages for doing so. We study both uniformly random resource requests and requests in the presence of popular (hot) resources. Our analysis is also extended to take into account the fact that nodes may become unavailable either due to failures or voluntary departures from the system. Our analytical results are validated through simulation.