Abstract
The covering-based routing, which maintains a compact routing table and reduces the costs of communications and matching computations by removing redundant subscriptions, is a typical optimization method in content-based distributed publish/subscribe systems. Although it has been widely used as a fundamental part in acyclic systems, no research on covering-based routing for cyclic networks has been reported as we know. As the cyclic systems become a new focus of research for they have advantages over acyclic ones, developing covering-based protocols and algorithms for routing optimization on cyclic networks is significant to distribute publish/subscribe systems. Since current covering optimization methods of acyclic topologies can not be directly utilized on cyclic networks, this paper contributes the Cyclic Covering-Based Routing protocol with corresponding algorithms to support covering-based protocol in cyclic network, which enable efficiently path sharing among related subscriptions with covering relationships so as to reduce the costs of communications and matching computations in cyclic systems. Correctness proofs of the proposed algorithms are also presented in this paper.
This is a preview of subscription content, log in via an institution to check access.
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
Eugster, P.T., Felber, P.A., Guerraoui, R., Kermarrec, A.M.: The many faces of publish/subscribe. ACM Computing Surveys 35(2), 114–131 (2003)
Carzaniga, D.S., Rosenblum, Wolf, A.L.: Design and evaluation of a wide-area event notification service. ACM ToCS 19(3), 332–383 (2001)
Carzaniga, Wolf, A.: Forwarding in a content-based network. In: SIGCOMM (2003)
Carzaniga: Architectures for an Event Notification Service Scalable to Wide-area Networks. PhD thesis, Politecnico di Milano, Milano, Italy (1998)
Li G.L., Hou S., Jacobsen H.A: A unified approach to routing, covering and merging in publish/subscribe systems based on modified binary decision diagrams. In: ICDCS 2005 (2005)
Muhl, G.: Large-scale content-based publish/subscribe systems. PhD thesis, Darmstadt University of Technology, Germany (2002)
Dalal Yogen, K., Metcalfe Robert, M.: Reverse Path Forwarding of Broadcast Packets. Communications of the ACM 21(12), 1040–1047 (1978)
Yuan, H.L., Shi, D.X., Wang, H.M., Zou, P.: Research on Routing Algorithm Based on Subscription Covering in Content-Based Publish/Subscribe. Chinese Journal Of Computers 29(10) (2006)
Li, G.L., Muthusamy, V., Jacobsen, H.A.: Adaptive Content-Based Routing in General Overlay Topologies. In: Middleware (2008)
Fiege, L., Mezini, M., Mühl, G., Buchmann, A.P.: Engineering event-based systems with scopes. In: Magnusson, B. (ed.) ECOOP 2002. LNCS, vol. 2374, pp. 309–333. Springer, Heidelberg (2002)
Cugola, G., Nitto, E.D., Fuggetta, A.: The JEDI event-based infrastructure and its application to the development of the OPSS WFMS. ToSEÂ 27(9) (2001)
Dalal Yogen, K., Metcalfe Robert, M.: Reverse Path Forwarding of Broadcast Packets. Communications of the ACM 21(12), 1040–1047 (1978)
Bollobas, B.: Morden Graph Theory. Spriger-Verlag, New York (1988)
Li, G., Jacobsen, H.-A.: Composite subscriptions in content-based publish/Subscribe systems. In: Alonso, G. (ed.) Middleware 2005. LNCS, vol. 3790, pp. 249–269. Springer, Heidelberg (2005)
Aguilera, M.K., Strom, R.E., Sturman, D.C., Astley, M., Chandra, T.D.: Matching events in a content-based subscription system. In: Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mingwen, C., Songlin, H., Zhiyong, L. (2009). Covering-Based Routing Algorithms for Cyclic Content-Based P/S System. In: Deng, X., Hopcroft, J.E., Xue, J. (eds) Frontiers in Algorithmics. FAW 2009. Lecture Notes in Computer Science, vol 5598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02270-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-02270-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02269-2
Online ISBN: 978-3-642-02270-8
eBook Packages: Computer ScienceComputer Science (R0)