A local search mechanism for peer-to-peer networks
Explore this paper's citation graph
Summary
The modified Breadth-First Search (BFS) mechanism, is an extension of the current Gnuttela protocol, allows searching with keywords, and is designed to minimize the number of messages that are needed to search the network.
- Type
- article
- Published
- 2002-11-04
- Cited by
- 460
- References
- 21
- OpenAlex
- https://openalex.org/W2098125775
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:320602
Keywords
Computer science, Scalability, Peer-to-peer, Middleware (distributed applications), Distributed computing
References
- Search in Power-Law Networks
- Generalizing GlOSS to Vector-Space Databases and Broker Hierarchies
- Efficient search in peer to peer networks
- The Effects of Query-Based Sampling on Automatic Database Selection Algorithms
- Comparing the performance of database selection algorithms
- Let's browse: a collaborative Web browsing agent
- Effective retrieval with distributed collections
- The impact of database selection on distributed searching
- Towards a highly-scalable and effective metasearch engine
- Building a distributed full-text index for the Web
- Using Memex to archive and mine community Web browsing experience
- Pattern classification and scene analysis
- Comparing Hybrid Peer-to-Peer Systems
- Improving search in peer-to-peer networks
- Routing indices for peer-to-peer systems
- Using the small-world model to improve Freenet performance
- Chord: A scalable peer-to-peer lookup service for internet applications
- Empirical Analysis of Predictive Algorithms for Collaborative Filtering
- Building a distributed full-text index for the web
- Using the small-world model to improve freenet performance
Cited by
- An adaptive randomised structured search network for locating objects in a distributed computing system
- Implementation of Resource Discovery Mechanisms on PeerSim: Enabling up to One Million Nodes P2P Simulation
- A System of P2P Contents Distribution Taking Advantage of Uneven Web Contents Distribution
- Search Request Routing in Bittorrent and other P2P based File Sharing Networks
- Information Retrieval in Peer-to-Peer Networks
- Large-scale distributed coalition formation
- Node selection in distributed overlays
- Ontology engineering and routing in distributed knowledge management applications
- Searching Technique in Peer-to-Peer Networks by Detecting Stable Nodes
- A Framework for Structured Search of Distributed Research Resources
- Smart PIN: performance and cost-oriented context-aware personal information network
- Dezentrale, kontextbasierte Steuerung der Suche im Internet
- Searching using probabilistic hints in unstructured peer-to-peer networks
- Search in Peer-to-Peer File-Sharing System: Like Metasearch Engines, But Not Really
- A Comparison of Peer-to-Peer Search Methods
- Content-Based Music Information Retrieval in Wireless Ad-Hoc Networks
- Exploiting Rateless Coding in Structured Overlays to Achieve Persistent Storage. (L'Exploitation de Codes Fontaines pour un Stockage Persistant des Données dans les Réseaux d'Overlay Structurés)
- Learning Profiles for Heterogeneous Distributed Information Sources
- Content-Based Community Formation in Hybrid Peer-to-Peer Networks
- Búsqueda de recursos en redes peer-to-peer totalmente descentralizadas basada en redes neuronales artificiales
Related papers
- Scalability Issues of Blockchain Technology
- On the scalability of multistage interconnection networks
- INVITED PAPER: Scalability and Performance Issues in Deeply Embedded Sensor Systems
- Evaluating The Scalability of Big Data Frameworks
- Measuring the scalability of parallel computer systems
- A Study on Scalability of Middleware Systems
- Scalability evaluation of a peer-to-peer market place based on micro payments
- DUMPLING: A Novel Dynamic Search Engine