P2PENS: Content-based publish-subscribe over Peer-to-Peer network

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Content-based publish/subscribe systems have recently received an increasing attention. Efficient routing algorithms and selforganization are two challenges in this research area. Peer-to-peer network topologies can offer inherently bounded delivery depth, load sharing and self organization. In this paper, we present a content-based publish/subscribe system built on top of a dynamic peer-to-peer overlay network. A scalable routing algorithm using Pastry network is presented that avoids global broadcasts by creating rendezvous nodes. Selforganization and fault-tolerance mechanisms that can cope with nodes and links failures are integrated with the routing algorithm resulting in a scalable and robust system. The experiment results reveal that our system has better routing efficiency, lower cost and less routing table size at the event brokers. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Xue, T., Feng, B., & Zhang, Z. (2004). P2PENS: Content-based publish-subscribe over Peer-to-Peer network. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3251, 583–590. https://doi.org/10.1007/978-3-540-30208-7_79

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free