Abstract
Content-based publish/subscribe systems have recently received an increasing attention. Efficient routing algorithms and self-organization 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. Self-organization 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Segall, B., Arnold, D., Boot, J., Henderson, M., Phelps, T.: Content based routing with elvin4. In: Proceedings AUUG2K, Canberra, Australia (June 2000)
IBM. Gryphon: Publish/subscribe over public networks. Technical report, IBM T. J. Watson Research Center (2001)
Banavar, G., Chandra, T., Mukherjee, B., Nagarajarao, J., Strom, R., Sturman, D.: An Efficient Multicast Protocol for Content-based Publish-Subscribe Systems. In: Proceedings of IEEE International Conference on Distributed Computing Systems 1999, Austin, TX (1999)
Carzaniga, A., Rosenblum, D.S., Wolf, A.L.: Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems 19(3), 332–383 (2001)
Carzaniga, A., Wolf, A.L.: Content-based networking: A new communication infrastructure. In: NSF Workshop on an Infrastructure for Mobile and Wireless Systems, Scottsdale, AZ (October 2001)
Cugola, G., DiNitto, E., Fuggetta, A.: The JEDI event-based infrastructure and its application to the development of the OPSS WFMS. IEEE Transactions on Software Engineering 27(9) (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: Proc. SIGCOMM (2001)
Stoica, I., Morris, R., Karger, D.: Kaashoek, H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proc. SIGCOMM (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for faulttolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, Computer Science Division, U. C. Berkeley (April 2001)
Cabrera, L.F., Jones, M.B., Theimer, M.: Herald: Achieving a Global Event Notification Service. In: Proc. of the 8th Workshop on Hot Topics in Operating Systems, HotOS-VIII (2001)
Ballardie, T., Francis, P., Crowcroft, J.: Core Based Trees (CBT). In: ACM SIGCOMM 1993, Ithaca, N.Y., USA (1993)
Rice University, Houston, USA. Pastry project, http://freepastry.rice.edu/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xue, T., Feng, B., Zhang, Z. (2004). P2PENS: Content-Based Publish-Subscribe over Peer-to-Peer Network. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004. GCC 2004. Lecture Notes in Computer Science, vol 3251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30208-7_79
Download citation
DOI: https://doi.org/10.1007/978-3-540-30208-7_79
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23564-4
Online ISBN: 978-3-540-30208-7
eBook Packages: Springer Book Archive