An ontology and peer-to-peer based data and service unified discovery system
Expert Systems with Applications: An International Journal
Plexus: a scalable peer-to-peer protocol enabling efficient subset search
IEEE/ACM Transactions on Networking (TON)
Mobile P2P fast similarity search
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
BF-chord: an improved lookup protocol to chord based on Bloom Filter for wireless P2P
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Efficient search technique for agent-based P2P information retrieval
AIS-ADM'07 Proceedings of the 2nd international conference on Autonomous intelligent systems: agents and data mining
Advances In Peer-To-Peer Content Search
Journal of Signal Processing Systems
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
The state of peer-to-peer network simulators
ACM Computing Surveys (CSUR)
Hi-index | 0.07 |
Flexibility and efficiency are the prime requirements for any P2P search mechanism. Existing P2P systems do not provide satisfactory solution for achieving these two conflicting goals. Unstructured search protocols (as adopted in Gnutella and FastTrack) provide search flexibility but exhibit poor performance characteristics. Structured search techniques (mostly Distributed Hash Table (DHT)-based), on the other hand, can efficiently route queries but support exact-match semantic only. In this paper we have defined Distributed Pattern Matching (DPM) problem and have presented a novel P2P architecture, named Distributed Pattern Matching System (DPMS), as a solution. Possible application areas of DPM include P2P search, service discovery and P2P databases. In DPMS, advertised patterns are replicated and aggregated by the peers, organized in a lattice-like hierarchy. Replication Improves availability and resilience to peer failure, and aggregation reduces storage overhead. An advertised pattern can be discovered using any subset of its 1-bits. Search complexity in DPMS is logarithmic to the total number of peers in the system. Advertisement overhead and guarantee on search completeness is comparable to that of DHT-based systems. We have presented mathematical analysis and simulation results to demonstrate the effectiveness of DPMS