Tree pattern matching and subset matching in randomized O(nlog3m) time
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An architecture for a secure service discovery service
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Approximate subset matching with Don't Cares
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A Scalable and Ontology-Based P2P Infrastructure for Semantic Web Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Adaptive Probabilistic Search for Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Proceedings of the 13th international conference on World Wide Web
XPath lookup queries in P2P networks
Proceedings of the 6th annual ACM international workshop on Web information and data management
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
Enabling Flexible Queries with Guarantees in P2P Systems
IEEE Internet Computing
LSH forest: self-tuning indexes for similarity search
WWW '05 Proceedings of the 14th international conference on World Wide Web
FS-Chord: A New P2P Model with Fractional Steps Joining
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Characterizing unstructured overlay topologies in modern P2P file-sharing systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Locating data sources in large distributed systems
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A robust and scalable peer-to-peer gossiping protocol
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
Design and evaluation of a distributed scalable content discovery system
IEEE Journal on Selected Areas in Communications
Keyword search in DHT-based peer-to-peer networks
IEEE Journal on Selected Areas in Communications
Distributed pattern matching: a key to flexible and efficient P2P search
IEEE Journal on Selected Areas in Communications
The resource efficient forwarding in the content centric network
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Towards a Kademlia DHT-based n-tuple store
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
SMBSRP: a search mechanism based on interest similarity, query relevance and distance prediction
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advances in computational intelligence - Volume Part I
Hi-index | 0.00 |
Efficient discovery of information, based on partial knowledge, is a challenging problem faced by many large scale dis-tributed systems. This paper presents Plexus, a peer-to-peer search protocol that provides an efficient mechanism for advertising a bit-sequence (pattern), and discovering it using any subset of its 1-bits. A pattern (e.g., Bloom filter) summarizes the properties (e.g., key-words, service description) associated with a shared object (e.g., document, service). Plexus has a partially decentralized architecture involving super-peers. It adopts a novel structured routing mechanism derived from the theory of Error Correcting Codes (ECC). Plexus achieves better resilience to peer failure by utilizing replication and redundant routing paths. Routing efficiency in Plexus scales logarithmically with the number of superpeers. The concept presented in this paper is supported with theoretical analysis, and simulation results ob-tained from the application of Plexus to partial keyword search utilizing the extended Golay code.