Abstract
In this paper, we develop a new self-stabilizing (fault tolerant) protocol for publish/subscribe scheme in a P2P network. We provide a complexity analysis of the recovery (stabilization) time of the protocol after arbitrary failures in the network. The protocol converges in at most \(n^{2}({\it \Delta}+1)m+n^{3} - n\) time in the worst case where n, m, and \({\it \Delta}\) denote respectively the number of nodes, edges, and the maximum degree of a node in the system graph (network). We also propose a a space efficient way to utilize this self-stabilizing publish/subscribe scheme, which allows flexibility in implementations.
The work was supported by an NSF Award # ANI-0219485.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Banavar, G., Chandra, T., Mukherjee, B., Nagarajarao, J.: An efficient multicast protocol for content based publish subscribe systems. In: Proceedings of the 19th International Conference on Distributed Computing Systems, ICDCS 1999 (1999)
Huang, Y., Garcia-Molina, H.: Publish/subscribe in a mobile environment. In: Proceedings of the 2nd ACM International Workshop on Data Engineering for Wireless and Mobile Access, pp. 27–34 (2001)
Castro, M., Druschel, P., Kermarrec, A., Rowstron, A.: Scribe: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications 20(8), 100–110 (2002)
Druschel, P., Rowstron, A.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Fox, G., Pallickara, S.: The narada event brokering system: Overview and extensions. In: PDPTA 2002: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 353–359. CSREA Press (2002)
Datta, A.K., Gradinariu, M., Raynal, M., Simon, G.: Anonymous publish/subscribe in p2p networks. In: the International Parallel and Distributed Processing Symposium, IPDPS 2003 (2003)
Estrin, D., Govindan, R., Heidemann, J.S., Kumar, S.: Next century challenges: Scalable coordination in sensor networks. Mobile Computing and Networking, 263–270 (1999)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17, 643–644 (1974)
Lamport, L.: Solved problems, unsolved problems, and non-problems in concurrency. In: Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing, pp. 1–11 (1984)
Schneider, M.: Self-stabilization. ACM Computing Surveys 25(1), 45–67 (1993)
Herman, T.: A comprehensive bibliograph on self-stabilization, a working paper. Chicago J. Theoretical Comput. Sci., http://www.cs.uiowa.edu/ftp/selfstab/bibliography
Couvreur, J., Francez, N., Gouda, M.: Asynchronous unison. In: ICDCS, pp. 486–493 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, Z., Srimani, P.K. (2005). Self-stabilizing Publish/Subscribe Protocol for P2P Networks. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds) Distributed Computing – IWDC 2005. IWDC 2005. Lecture Notes in Computer Science, vol 3741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603771_15
Download citation
DOI: https://doi.org/10.1007/11603771_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30959-8
Online ISBN: 978-3-540-32428-7
eBook Packages: Computer ScienceComputer Science (R0)