Sasu Tarkoma
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.
- R. Baldoni, R. Beraldi, L. Querzoni, and A. Virgillito. Efficient Publish/Subscribe through a Self-Organizing Broker Overlay and its Application to SIENA. The Computer Journal, 50(4):444--459, 7 2007. Google Scholar
Digital Library
- F. Cao and J. P. Singh. Efficient event routing in content-based publish-subscribe service networks. In INFOCOM. IEEE, 2004.Google Scholar
- 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. Google ScholarDigital Library
- A. Carzaniga, D. S. Rosenblum, and A. L. Wolf. Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems, 19(3):332--383, Aug. 2001. Google ScholarDigital Library
- C.-Y. Chan, F. Wenfei, P. Felber, M. Garofalakis, and R. Rastogi. Tree pattern aggregation for scalable XML data dissemination. In Proocedings of the 28th VLDB Conference, 2002. Google ScholarDigital Library
- Y. Chen, K. Schwan, and D. Zhou. Opportunistic channels: Mobility-aware event delivery. In Middleware 2003, 2003. Google ScholarDigital Library
- G. Chockler, R. Melamed, Y. Tock, and R. Vitenberg. Spidercast: a scalable interest-aware overlay for topic-based pub/sub communication. In DEBS '07: Proceedings of the 2007 inaugural international conference on Distributed event-based systems, pages 14--25, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
- A. Crespo, O. Buyukkokten, and H. Garcia-Molina. Query merging: Improving query subscription processing in a multicast environment. IEEE Trans. on Knowledge and Data Engineering, pages 174--191, jan 2003. Google ScholarDigital Library
- P. T. Eugster, P. A. Felber, R. Guerraoui, and A.-M. Kermarrec. The many faces of publish/subscribe. ACM Computing Surveys, (2):114--131, 2003. Google ScholarDigital Library
- M. Guimaraes and L. Rodrigues. A genetic algorithm for multicast mapping in publish-subscribe systems. In Proceedings of the 2nd IEEE International Symposium on Network Computing and Applications, pages 67--74, 2003. Google ScholarDigital Library
- S. Kale, E. Hazen, F. Cao, and J. P. Singh. Analysis and Algorithms for Content-based Event Matching. In Proceedings of the Fourth International Workshop on Distributed Event-Based Systems (DEBS '05), 2005. Google ScholarDigital Library
- A. Kiani and N. Shiri. Containment of conjunctive queries with arithmetic expressions. In CoopIS, pages 439--452, 2005. Google ScholarDigital Library
- G. Li, S. Hou, and H.-A. Jacobsen. A unified approach to routing, covering and merging in publish/subscribe systems based on modified binary decision diagrams. In ICDCS, pages 447--457, 2005. Google ScholarDigital Library
- W. Litwin, J. Menon, and T. Risch. LH* schemes with scalable availability. Research Report RJ10121 (91937), IBM, 1998.Google Scholar
- G. Mühl. Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis, Darmstadt University of Technology, September 2002.Google Scholar
- R. K. N. Karmarkar. The differencing method of set partitioning. Technical Report UCB/CSD 82/113, University of California, Berkeley, 1982.Google ScholarDigital Library
- L. Opyrchal, M. Astley, J. S. Auerbach, G. Banavar, R. E. Strom, and D. C. Sturman. Exploiting IP multicast in content-based publish-subscribe systems. In Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2000), pages 185--207, 2000. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- A. Riabov, Z. Liu, J. Wolf, P. Yu, and L. Zhang. Clustering algorithms for content-based publication-subscription systems. In Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS'02), Vienna, Austria, 2002. Google ScholarDigital Library
- S. Tarkoma and J. Kangasharju. Optimizing Content-based Routers: Posets and Forests. Distributed Computing, 19(1):62--77, Sept. 2006.Google ScholarDigital Library
- Y.-M. Wang, L. Qiu, C. Verbowski, D. Achlioptas, G. Das, and P. Larson. Summary-based routing for content-based event distribution networks. 34:59--74, 2004. Google ScholarDigital Library
- 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.Google Scholar
Index Terms
- Dynamic content-based channels: meeting in the middle
Recommendations
Content-based communication: a research agenda
SEM '06: Proceedings of the 6th international workshop on Software engineering and middlewareA content-based publish/subscribe system is a message-oriented communication facility based on the idea of interest-driven routing. A message, published by the sender without a set destination, is delivered to any and all the receivers that expressed an ...
NR-DCSK Based Chaotic Communications in MIMO Multipath Channels
In this paper, digital chaotic communications in multiple-input---multiple-output (MIMO) wireless multipath fading channels is considered. A noise reduction-differential chaos shift keying (NR-DCSK) scheme is employed to modulate data symbols at each ...
Dirty-paper coding versus TDMA for MIMO Broadcast channels
We compare the capacity of dirty-paper coding (DPC) to that of time-division multiple access (TDMA) for a multiple-antenna (multiple-input multiple-output (MIMO)) Gaussian broadcast channel (BC). We find that the sum-rate capacity (achievable using DPC) ...
Comments