Dynamic content-based channels: meeting in the middle

ABSTRACT

We present a novel framework for supporting dynamic content-based communication channels. The system generalizes channel splits and joins in terms of arbitrary filters, where content-based message processing expands and contracts over a set of distributed nodes. The framework consists of two core functions, namely splitting and joining two channels. We consider different ways of doing the split operation and taking into account current load and expected workload through absolute and expected overlap between content descriptors, namely filters. The framework can be used with both centralized and decentralized split and join decision making. We present experimental results pertaining to joins, merges, and client-side performance. The mechanism presented may also be used in allocating clients to multicast channels at runtime.

REFERENCES

• 1: Roberto Baldoni , Roberto Beraldi , Leonardo Querzoni , Antonino Virgillito, Efficient Publish/Subscribe Through a Self-Organizing Broker Overlay and its Application to SIENA, The Computer Journal, v.50 n.4, p.444-459, July 2007 [doi>10.1093/comjnl/bxm002]
• 2: F. Cao and J. P. Singh. Efficient event routing in content-based publish-subscribe service networks. In INFOCOM. IEEE, 2004.
• 3: F. Cao and J. P. Singh. Medym: Match-early with dynamic multicast for content-based publish-subscribe networks. In Proceedings of the ACM/IFIP/USENIX 6th International Middleware Conference (Middleware 2005), 2005.
• 4: Antonio Carzaniga , David S. Rosenblum , Alexander L. Wolf, Design and evaluation of a wide-area event notification service, ACM Transactions on Computer Systems (TOCS), v.19 n.3, p.332-383, Aug. 2001 [doi>10.1145/380749.380767]
• 5: Chee-Yong Chan , Wenfei Fan , Pascal Felber , Minos Garofalakis , Rajeev Rastogi, Tree pattern aggregation for scalable XML data dissemination, Proceedings of the 28th international conference on Very Large Data Bases, p.826-837, August 20-23, 2002, Hong Kong, China
• 6: Y. Chen, K. Schwan, and D. Zhou. Opportunistic channels: Mobility-aware event delivery. In Middleware 2003, 2003.
• 7: Gregory Chockler , Roie Melamed , Yoav Tock , Roman Vitenberg, SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication, Proceedings of the 2007 inaugural international conference on Distributed event-based systems, June 20-22, 2007, Toronto, Ontario, Canada [doi>10.1145/1266894.1266899]
• 8: Arturo Crespo , Orkut Buyukkokten , Hector Garcia-Molina, Query Merging: Improving Query Subscription Processing in a Multicast Environment, IEEE Transactions on Knowledge and Data Engineering, v.15 n.1, p.174-191, January 2003 [doi>10.1109/TKDE.2003.1161589]
• 9: Patrick Th. Eugster , Pascal A. Felber , Rachid Guerraoui , Anne-Marie Kermarrec, The many faces of publish/subscribe, ACM Computing Surveys (CSUR), v.35 n.2, p.114-131, June 2003 [doi>10.1145/857076.857078]
• 10: Mário Guimarães , Luís Rodrigues, A Genetic Algorithm for Multicast Mapping in Publish-Subscribe Systems, Proceedings of the Second IEEE International Symposium on Network Computing and Applications, p.67, April 16-18, 2003
• 11: Satyen Kale , Elad Hazan , Fengyun Cao , Jaswinder Pal Singh, Analysis and Algorithms for Content-Based Event Matching, Proceedings of the Fourth International Workshop on Distributed Event-Based Systems (DEBS) (ICDCSW'05), p.363-369, June 06-10, 2005 [doi>10.1109/ICDCSW.2005.40]
• 12: A. Kiani and N. Shiri. Containment of conjunctive queries with arithmetic expressions. In CoopIS, pages 439--452, 2005.
• 13: Guoli Li , Shuang Hou , Hans-Arno Jacobsen, A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems Based on Modified Binary Decision Diagrams, Proceedings of the 25th IEEE International Conference on Distributed Computing Systems, p.447-457, June 06-10, 2005 [doi>10.1109/ICDCS.2005.8]
• 14: W. Litwin, J. Menon, and T. Risch. LH* schemes with scalable availability. Research Report RJ10121 (91937), IBM, 1998.
• 15: G. Mühl. Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis, Darmstadt University of Technology, September 2002.
• 16: R. K. N. Karmarkar. The differencing method of set partitioning. Technical Report UCB/CSD 82/113, University of California, Berkeley, 1982.
• 17: Lukasz Opyrchal , Mark Astley , Joshua Auerbach , Guruduth Banavar , Robert Strom , Daniel Sturman, Exploiting IP multicast in content-based publish-subscribe systems, IFIP/ACM International Conference on Distributed systems platforms, p.185-207, April 03-07, 2000, New York, New York, United States
• 18: A. M. Ouksel, O. Jurca, I. Podnar, and K. Aberer. Efficient probabilistic subsumption checking for content-based publish/subscribe systems. In M. van Steen and M. Henning, editors, Middleware, volume 4290 of Lecture Notes in Computer Science, pages 121--140. Springer, 2006.
• 19: Anton Riabov , Zhen Liu , Joel L. Wolf , Philip S. Yu , Li Zhang, Clustering Algorithms for Content-Based Publication-Subscription Systems, Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02), p.133, July 02-05, 2002
• 20: S. Tarkoma and J. Kangasharju. Optimizing Content-based Routers: Posets and Forests. Distributed Computing, 19(1):62--77, Sept. 2006.
• 21: Yi-Min Wang , Lili Qiu , Chad Verbowski , Dimitris Achlioptas , Gautam Das , Paul Larson, Summary-based routing for content-based event distribution networks, ACM SIGCOMM Computer Communication Review, v.34 n.5, p.59-74, October 2004 [doi>10.1145/1039111.1039113]
• 22: W. Y.-M., L. Qiu, D. Achlioptas, D. Gautam, P. Larson, and H. Wang. Subscription partitioning and routing in content-based publish/subscribe systems. Technical report, Microsoft Research, 2003.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.4 Distributed Systems

Keywords:
content-based communication, event channels