Skip to main content
SpringerLink
Log in

Covering-Based Routing Algorithms for Cyclic Content-Based P/S Overlays

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Content-based routing (CBR) publish/subscribe (P/S) system is an important class of distributed systems. This system differs from classical paradigms as messages are routed based on their content rather than their destination address, so as to provide a fine-granularity event dissemination, and support more flexibility decoupling applications. Covering-based routing is a typical optimization method of CBR and has been widely used as a building block in many distributed P/S systems, for it maintains a compact routing table and reduces the costs of communications and matching computations. So far as we know, this optimization method can only be implemented on acyclic overlay network, but cannot be directly utilized on cyclic networks. As the CBR in cyclic systems becomes a new focus of research, developing covering-based protocols and algorithms for cyclic P/S system is becoming significantly important. This paper contributes the cyclic covering-based routing protocol with corresponding algorithms to support covering-based protocol in cyclic P/S system, and implements it in PADRES, a distributed event management infrastructure based on the publish/subscribe model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Eugster P T, Felber P A, Guerraoui R, Kermarrec A M. The many faces of publish/subscribe. ACM Computing Surveys, 2003, 35(2): 114–131.

    Article  Google Scholar 

  2. Carzaniga A, Rosenblum D S, Wolf A L. Design and evaluation of a wide-area event notification service. ACM ToCS, 2001, 19(3): 332–383.

    Article  Google Scholar 

  3. Carzaniga A, Wolf A L. Forwarding in a content-based network. In Proc. Conf. Applications, Technologies, Architectures, and Protocols for Computer Communications, Karlsrule, Germany, Aug. 25-29, 2003, pp.163–174.

  4. Li G L, Muthusamy V, Jacobsen H A. Adaptive contentbased routing in general overlay topologies. In Proc. the 9th ACM/IFP/USENIX Int. Conf. Middleware, Leuven, Belgium, Dec. 1-5, 2008, pp.1–21.

  5. Li G L, Jacobsen H A. Composite subscriptions in content-based publish/subscribe systems. In Proc. ACM/IFIP/USENIX Int. Conf. Middleware, Grenoble, France, Nov. 1, 2005, pp.249–269.

  6. Muhl G, Fiege L, Gartner F, Buchmann A. Evaluating advanced routing algorithms for content-based publish/subscribe systems. In Proc. MASCOTS 2002, Fort Worth, USA, Oct. 11-16, 2002, pp.167–176.

  7. Yan W, Hu S L, Muthusamy V, Jacobsen H A, Zha L. Efficient event-based resource discovery. In Proc. DEBS, Nashville, USA, Jul. 6-9, 2009, Article No. 19.

  8. Hu S L, Muthusamy V, Li G L, Jacobsen H A. Distributed automatic service composition in large-scale systems. In Proc. DEBS, Rome, Italy, Jul. 1-4, 2008, pp.233–244.

  9. Chen M W, Hu S L, Liu Z Y. Covering-based routing algorithms for cyclic content-based P/S system. In Proc. the 3rd International Workshop on Frontiers in Algorithmics, Hefei, China, Jun. 20-23, 2009, pp.51–62.

  10. Dalal Y K, Metcalfe R M. Reverse path forwarding of broadcast packets. Communications of the ACM, 1978, 21(12): 1040–1047.

    Article  MATH  Google Scholar 

  11. 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 Proc. ICDCS, Columbus, USA, Jun. 6-10, 2005, pp.447–457.

  12. Carzaniga A. Architectures for an event notification service scalable to wide-area networks [Dissertation]. Politecnico di Milano, Milano, Italy, 1998.

  13. Muhl G. Large-scale content-based publish/subscribe systems [Dissertation]. Darmstadt University of Technology, Germany, 2002.

  14. 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, 2006, 29(10): 1804–1812. (in Chinese)

    Google Scholar 

  15. Riabov A, Liu Z, Wolf J L, Yu P S, Zhang L. Clustering algorithms for content-based publication-subscription systems. In Proc. the 22nd International Conference on Distributed Computing Systems (ICDCS 2002), Vienna, Austria, Jul. 2-5, 2002, p.133.

  16. Aguilera M K, Strom R E, Sturman D C, Astley M, Chandra T D. Matching events in a content-based subscription system. In Proc. the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, Atlanta, USA, May 4-6, 1999, pp.53–61.

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Technology, Chinese Academy of Sciences, Beijing, 100190, China

    Ming-Wen Chen, Jian Zhang, Song-Lin Hu (Senior Member, CCF) & Zhi-Yong Liu (Senior Member, CCF)

  2. Graduate University of Chinese Academy of Sciences, Beijing, 100049, China

    Ming-Wen Chen & Jian Zhang

Authors
  1. Ming-Wen Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jian Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Song-Lin Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhi-Yong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ming-Wen Chen.

Additional information

The paper is supported by the National Natural Science Foundation of China under Grant Nos. 61070027, 60752001, the National Basic Research 973 Program of China under Grant No. 2007CB310805, the National High-Tech Research and Development 863 Program of China under Grant No. 2006AA01A106, the Beijing Science and Technology Plan Projects under Grant No. Z09000100960907, the Beijing Natural Science Foundation under Grant No. 4092043, and the Co-Building Program of Beijing Municipal Education Commission.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, MW., Zhang, J., Hu, SL. et al. Covering-Based Routing Algorithms for Cyclic Content-Based P/S Overlays. J. Comput. Sci. Technol. 25, 1214–1224 (2010). https://doi.org/10.1007/s11390-010-9400-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-010-9400-7

Keywords

Search

Navigation