A P2P information monitoring system supporting conjunctive continual queries

Authors:
Kouta Maruyama;Shigeaki Tagashira;Satoshi Fujita
Affiliations:
Department of Information Engineering, Graduate School of Engineering, Hiroshima University;Department of Information Engineering, Graduate School of Engineering, Hiroshima University;Department of Information Engineering, Graduate School of Engineering, Hiroshima University
Venue:
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Year:
2007

Citing 6
Cited 0

Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Information Monitoring on the Web: A Scalable Solution

World Wide Web
Continual Queries for Internet Scale Event-Driven Information Delivery

IEEE Transactions on Knowledge and Data Engineering
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
SCRIBE: The Design of a Large-Scale Event Notification Infrastructure

NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
PeerCQ: A Decentralized and Self-Configuring Peer-to-Peer Information Monitoring System

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a P2P information monitoring system to support the processing of conjunctive queries. The proposed system is an extension of PeerCQ, and our main contribution in this paper is the following three points: 1) we provide a detailed specification of Conjunctive Continual Queries (CCQs) that is an agent to check the satisfaction of a given conjunction, 2) we propose a mapping of CCQs to peers by considering the similarity of the referred data items, and 3) we improve the utility function used in PeerCQ in such a way that the trade-off between the load of each peer and the overall load of the system can be explicitly controlled. The effect of the proposed method is evaluated by simulation. The result of simulation indicates that the proposed utility functions certainly improves the performance of the resultant scheme, and the trade-off can be controlled by tuning a parameter in the utility function.