Abstract
Design of distributed architectures for content-based publish-subscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and diversified content-based pub-sub communication, we propose a new architectural design called MEDYM – Match-Early with DYnamic Multicast. MEDYM follows the End-to-End distributed system design principle. It decouples a pub-sub service into two functionalities: complex, application-specific matching at network edge, and simple, generic multicast routing in the network. This architecture achieves low computation cost in event matching and high network efficiency and flexibility in event routing. For higher scalability, we describe a novel approach to extend MEDYM to a hierarchy structure called H-MEDYM, which effectively balances the trade-off between event delivery efficiency and server states maintenance. We evaluate MEDYM and H-MEDYM using detailed simulations and real-world experiments, and compare them with major existing design approaches. Results show that MEDYM and H-MEDYM achieve high event delivery efficiency and system scalability, and their advantages are most prominent when user subscriptions are highly selective and diversified.
Chapter PDF
Similar content being viewed by others
References
Aguilera, M.K., Strom, R.E., Sturman, D.C., Astley, M., Chandra, T.D.: Matching events in a content-based subscription system. In: Proc. of ACM PODC (1999)
Boivie, R., et al.: Explicit Multicast (Xcast) Basic Specification, Internet draft, draft-ooms-xcast-basic-spec-03.txt
Calvert, K., Zegura, E., Bhattacharjee, S.: How to Model an Internet-work. In: Proc. of IEEE INFOCOM (1996)
Cao, F., Singh, J.P.: Efficient event routing in content-based publish-subscribe service network. In: Proc. of IEEE INFOCOM (2004)
Cao, F., Singh, J.P.: Towards scalable publish-subscribe service networks. Technical Report, Princeton University (2005)
Carzaniga, A., Rosenblum, D., Wolf, A.: Design and evaluation of a wide-area event notification service. In: Proc. of ACM TOCS (2001)
Carzaniga, A., Wolf, A.L.: A routing scheme for content-based networking. In: Proc. of IEEE INFOCOM (2003)
Carzaniga, A., Wolf, A.L.: Forwarding in a Content-Based Network. In: Proc. of ACM SIGCOMM (2003)
Cugola, G., Di Nitto, E., Fuggetta, A.: The JEDI Event-based Infrastructure and its Application to the Development of the OPSS WFMS. In: IEEE Transc. on Soft. Eng. (2001)
Culler, D., Singh, J.P.: Parallel Computer Architecture: A Hardware-Software Approach. Morgan Kaufmann, San Francisco (1998)
Ge, Z., Adler, M., Kurose, J., Towsley, D., Zabele, S.: Channelization problem in large scale data dissemination. In: ICNP 2001 (2001)
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proc. of SIGMOD Conference (1984)
Hall, C.P., Carzaniga, A., Rose, J., Wolf, A.L.: A content-based networking protocol for sensor networks. Tech. Report CU-CS-979-04, University of Colorado (2004)
Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. Proc. of ACM Computing Surveys 31 3, 264–323 (1999)
PlanetLab Testbed, http://planet-lab.org
Ng, T.S.E., Zhang, H.: Predicting Internet Network Distance with Coordinates-Based Approaches. In: Proc. of IEEE INFOCOM (2002)
Ratnasamy, S., Francis, P., et al.: A Scalable Content-Addressable Network. In: Proc. of ACM SIGCOMM (2001)
Riabov, A., Liu, Z., Wolf, J., Yu, P., Zhang, L.: Clustering Algorithms for content-based publication-subscription systems. In: Proc. of ICDCS (2002)
Riabov, A., Liu, Z., Wolf, J., Yu, P., Zhang, L.: New Algorithms for content-based publication-subscription systems. In: Proc. of ICDCS (2003)
Saltzer, J., Reed, D., Clark, D.: End-to-end arguments in system design. ACM Trans. Computer System 2(4), 277–288 (1984)
Segall, B., Arnold, D.: Elvin has left the building: A publish/subscribe notification service with quenching. In: Proc. of AUUG 1997, Brisbane (1997)
Tang, L., Crovella, M.: Virtual Landmark for the Internet. In: Proc. of ACM SIGCOMM Internet Measurement Conference (2003)
Triantafillou, P., Economides, A.: Subscription summarization: A new paradigm for efficient publish/subscribe systems. In: Proc. of ICDCS (2004)
Wang, Y., Qiu, L., et al.: Subscription Partitioning and Routing in Content-based Publish/Subscribe Networks. In: Proc. of Intl. Symp. on Dist. Comp, DISC (2002)
Wong, T., Katz, R., McCanne, S.: An evaluation of preference clustering in large scale multicast applications. In: Proc. of IEEE INFOCOM (2000)
Zhao, Y., Sturman, D., Bhola, S.: Subscription propagation in highly-available publish/subscribe middleware. In: Proc. ACM/IFIP/USENIX Middleware Conference (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Cao, F., Singh, J.P. (2005). MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks. In: Alonso, G. (eds) Middleware 2005. Middleware 2005. Lecture Notes in Computer Science, vol 3790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11587552_15
Download citation
DOI: https://doi.org/10.1007/11587552_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30323-7
Online ISBN: 978-3-540-32269-6
eBook Packages: Computer ScienceComputer Science (R0)