Abstract

VITAL is a novel P2P indexing structure that provides on top of exact search a similarity search of multidimensional vectors. It is designed to scale to millions of peers and billions of shared documents and to adapt to high network dynamics. To exploit peer heterogeneity, VITAL is a super-peer (SP) network where every peer is an SP candidate and a simple election protocol is run to select SPs. On the other hand, every SP locally monitors its “vital” signs of memory, processing, and bandwidth and initiates the SP election protocol based on its capacity and load limits. In addition, the SP overlay is structured as CAN distributed hash table to guarantee both the correctness and responsiveness of the query protocol. A novel data replication model is introduced, where every peer clusters its shared documents to local clusters (LCs) and each LC summary is published at few SPs to achieve content-based clustering and firework query propagation. Every peer establishes TCP connections with many SPs that maintain its LC summaries. VITAL has no central component and does not require global knowledge, however it requires identifying a set of global cluster (GC) centriods to be disjointly managed by the elected SPs. In addition, CAN zone overloading is seamlessly applied to relief overwhelmed SPs and it provided an extra layer of physical proximity clustering. The scalability analysis shows that peer index requires less than 3 % of extra storage and a query (on average) can be satisfied by visiting 1.6 % of the number of established TCP connections.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.