Skip to main content

The Subscription-Cover Based Routing Algorithm in Content-Based Publish/Subscribe

  • Conference paper
Advances in Grid and Pervasive Computing (GPC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3947))

Included in the following conference series:

Abstract

Subscription-cover relationship has been proposed to reduce the size of routing-table in intermediate brokers in the publish/subscribe network. Existing researches neglect the extent that covering can be applied and don’t give a simple approach to validate the correctness of routing-table when using subscription-cover. In this paper, we propose two routing algorithms based on subscription-cover, which are strict subscription-cover based routing (SSCBR) and relaxed subscription-cover based routing (RSCBR). The goal of the former is to maintain the least covered subscriptions. The latter maintains more covered subscriptions to balance in memory, time and network traffic. On the other hand, we propose a necessary and sufficient condition of correct routing-table configuration when applying SSCBR. We can easily validate the correctness of broker’s routing-table through it. Experiments evaluate the ability of two algorithms in reducing the routing-table size of intermediate broker and the efficiency of SSCBR and RSCBR under different subscribing/unsubscribing distribution.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Marchetti, C., Mecella, M., Scannapieco, M., Virgillito, A.: Enabling Data Quality Notification in Cooperative Information Systems through a Web-service based architecture. In: Proceedings of the 4th International Conference on Web Information Systems Engineering, Roma, Italy (2003)

    Google Scholar 

  2. Courtenage, S., Williams, S.: Automatic Hyperlink Creation Using P2P and Publish/Subscribe. In: The Workshop on Peer-to-Peer and Agent Infrastructures for Knowledge Management (PAIKM) (April 2005)

    Google Scholar 

  3. Eugster, P.T., Felber, P., Guerraoui, R., Kermarrec, A.-M.: The Many Faces of Publish/ Subscribe. ACM Journal Comput. 35(2), 114–131 (2003)

    Article  Google Scholar 

  4. Liu, Y., Plale, B.: Survey of Publish/Subscribe Event Systems, technical report, Department of Computer Science (CSCI) at Indiana University, TR574 (May 2003)

    Google Scholar 

  5. Li, G., Hou, S., Jacobsen, H.-A.: A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems Based on Modified Binary Decision Diagrams. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS 2005), pp. 447–457 (2005)

    Google Scholar 

  6. 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)

    Article  Google Scholar 

  7. IBM Corporation. Gryphon: Publish/subscribe over public networks. Technical report, IBM T. J. Watson Research Center (2001)

    Google Scholar 

  8. Cao, F., Singh, J.P.: Efficient Event Routing in Content-based Publish- Subscribe Service Networks. In: IEEE INFOCOM (2004)

    Google Scholar 

  9. Cugola, G., Di Nitto, E., Fugetta, A.: The JEDI event-based infrastructure and its application to the development of the OPSS WFMS. IEEE Transactions on Software Engineering 27, 827–850 (2001)

    Article  Google Scholar 

  10. Cugola, G., Di Nitto, E., Fuggetta, A.: Exploiting an event-based infrastructure to develop complex distributed systems. In: Proceedings of the 20th International Conference on Software Engineering, Kyoto, Japan (April 1998)

    Google Scholar 

  11. Muhl, G.: Large-Scale Content-Based Publish/Subscribe Systems, PhD thesis, Technical University of Darmstadt (2002)

    Google Scholar 

  12. Opyrchal, L., Astley, M., Auerbach, J.S., Banavar, G., Strom, R.E., Sturman, D.C.: Exploiting IP Multicast in Content-Based Publish-Subscribe Systems. In: Coulson, G., Sventek, J. (eds.) Middleware 2000. LNCS, vol. 1795, p. 185. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Ge, Z., Adler, M., Kurose, J., Towsley, D., Zabele, S.: Channelization problem in large-scale data dissemination, Technical report, University of Massachusetts at Amherst (2001)

    Google Scholar 

  14. Riabov, A., Liu, Z., Wolf, J., Yu, P., Zhang, L.: Clustering Algorithms for content-based publication-subscription systems. In: Proceedings of IEEE International Conference on Distributed Computing Systems, ICDCS 2002 (2002)

    Google Scholar 

  15. Wong, T., Katz, R., Mc Canne, S.: An evaluation of preference clustering in large scale multicast applications. In: Proceedings of IEEE INFOCOM (March 2000)

    Google Scholar 

  16. Banavar, G., Chandra, T., Mukherjee, B., et al.: An efficient multicast protocol for content-based publish-subscribe systems. In: Proceedings of the 19th IEEE International Conference on Distributed Computing Systems, pp. 262–272 (1999)

    Google Scholar 

  17. Xue, T., Feng, B.Q.: Research on routing algorithm and self-configuration in content-based publish-subscribe system. Journal of Software 16(2), 251–259 (2005)

    Article  Google Scholar 

  18. Lin, J.C., Paul, S.: A reliable multicast transport protocol. In: INFOCOM, pp. 1414–1424 (1996)

    Google Scholar 

  19. Rowstron, A.I.T., Kermarrec, A.-M., et al.: SCRIBE: The design of a large-scale event notification infrastructure. Networked Group Communication, 30–43 (2001)

    Google Scholar 

  20. Zhuang, S.Q., Zhao, B.Y., Joseph, A.D., Katz, R., Kubiatowicz, J.: Bayeux: An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination. In: Proceedings of International Workshop on Network and Operating Systems Support for Digital Audio and Video, NOSSDAV (2001)

    Google Scholar 

  21. Triantafillou, P., Aekaterinidis, I.: Content-Based Publish-Subscribe Over Structured P2P Networks. In: International Workshop on Distributed Event-Based Systems, DEBS 2004 (2004)

    Google Scholar 

  22. Hall, C.P., Carzaniga, A., Rose, J., Wolf, A.L.: A Content-Based Networking Protocol For Sensor Networks, Technical Report, Department of Computer Science, University of Colorado (August 2004)

    Google Scholar 

  23. 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 ACM PODC, Atlanta, GA, pp. 53–61 (1999)

    Google Scholar 

  24. Fabret, F., Jacobsen, H., Llirbat, F., Pereira, J., Ross, K., Shasha, D.: Filtering Algorithms and Implementations for Very Fast Publish/Subscribe Systems. In: Proceedings of ACM SIGMOD, Santa Barbara, California, pp. 115–126 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yuan, H., Guo, C., Zou, P. (2006). The Subscription-Cover Based Routing Algorithm in Content-Based Publish/Subscribe. In: Chung, YC., Moreira, J.E. (eds) Advances in Grid and Pervasive Computing. GPC 2006. Lecture Notes in Computer Science, vol 3947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11745693_11

Download citation

  • DOI: https://doi.org/10.1007/11745693_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33809-3

  • Online ISBN: 978-3-540-33810-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics