This Article 
 Bibliographic References 
 Add to: 
Efficient Dissemination of Personalized Information Using Content-Based Multicast
October 2004 (vol. 3 no. 4)
pp. 394-408
There has been a surge of interest in the delivery of personalized information to users (e.g., personalized stocks or travel information), particularly as mobile users with limited terminal device capabilities increasingly desire updated and targeted information in real time. When the number of information recipients is large and there is sufficient commonality in their interests, as is often the case, IP multicast is an efficient way of delivering the information. However, IP multicast services do not consider the structure and semantics of the information in the multicast process. We propose the use of Content-Based Multicast (CBM) where extra content filtering is performed at the interior nodes of the IP multicast tree; this will reduce network bandwidth usage and delivery delay, as well as the computation required at the sources and sinks. In this paper, we evaluate the situations in which CBM is advantageous. The benefits of CBM depend critically upon how well filters are placed at interior nodes of the IP multicast tree and the costs depend upon those introduced by filters themselves. Further, we consider the benefits of allowing the filters to be mobile so as to respond to user mobility or changes in user interests and the corresponding costs of filter mobility. The criterion that we consider is the total network bandwidth utilization. For this criterion, we develop an optimal filter placement algorithm, as well as a heuristic that executes faster than the optimal algorithm. We evaluate the algorithms by means of simulation experiments. Our results indicate that filters can be effective in substantially reducing bandwidth. We also find filter mobility is worthwhile if there is marked large-scale user mobility. We conclude with suggestions for further work.

[1] M. Adler, Z. Ge, J. Kurose, D. Towsley, and S. Zabele, “Channelization Problem in Large Scale Data Dissemination,” Proc. IEEE Int'l Conf. Network Protocols (ICNP), 2001.
[2] A. Adya, P. Bahl, and L. Qiu, “Analyzing the Browse Patterns of Mobile Clients,” Proc. SIGCOMM Internet Measurement Workshop (IMW 2001), 2001.
[3] L.A. Adamic and B.A. Huberman, “Zipf's Law and the Internet,” Glottometrics 3, pp. 143-150, 2002.
[4] M. Aguilera, R. Strom, D. Sturman, M. Astley, and T. Chandra, “Matching Events in a Content-Based Subscription System,” Proc. 18th ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing, pp. 53-61, 1999,
[5] G. Banavar, T. Chandra, B. Muhkerjes, J. Nagarajarao, R.E. Strom, and D.C. Sturman, “An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems,” Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS '99), 1999.
[6] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and Implication,” Proc. IEEE Infocom '99, Mar. 1999.
[7] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Comm. & Mobile Computing (WCMC): Special Issue on Mobile Ad Hoc Networking: Research, Trends and Applications, vol. 2, no. 5, pp. 483-502, 2002.
[8] A. Carzaniga, D. S. Rosenblum, and A.L. Wolf, “Design of Scalable Event Notification Service: Interface and Architecture,” Technical Report CU-CS-863-98, Univ. of Colorado, Dept. of Computer Science, 1998.
[9] A. Carzaniga and A. Wolf, “Content-Based Networking: A New Communication Infrastructure,” Proc. NSF Workshop Infrastructure for Mobile and Wireless Systems, 2001.
[10] R. Chalmers and K. Almeroth, “Modeling the Branching Characteristics and Efficiency Gains of Global Multicast Trees,” Proc. IEEE Infocom 2001, 2001, available from http://www.nmsl.cs.ucs b.edumwalk/.
[11] R. Chalmers and K. Almeroth, “Developing a Multicast Metric,” IEEE Globecom 2000, 2000, available from http://www.nmsl.cs.ucsb.edumwalk/.
[12] Y. Chawathe, S. McCanne, and E.A. Brewer, “An Architecture for Internet Content Distribution as an Infrastructure Service,” unpublished work, Feb. 2000.
[13] M. Chrobak, L. Larmore, and W. Rytter, “The $k$ -Median Problem for Directed Trees,” Proc. Int'l Symp. Math. Foundations of Computer Science, 2001.
[14] Y. Chu, S. Rao, and H. Zhang, “A Case for End-Systems Only Multicast,” Proc. ACM Sigmetrics, June 2000.
[15] C. Diot, B. Levine, B. Lyles, H. Kassem, and D. Balensiefeh, “Deployment Issues for IP Multicast Service and Architecture,” IEEE Network, Jan/Feb. 2000.
[16] M. Donahoo, “Application-Based Enhancement to Network-Layer Multicast,” PhD thesis, Georgia Inst. of Tech nology, 1998.
[17] M.D. Dorsch, T. Kostas, and V. Skowronski, “Reducing Bandwidth Requirements of Distributed Simulations,” Proc. Interservice/Industry Training, Simulation and Education Conf., 2002.
[18] P. Francis, “Yoid: Extending the Internet Multicast Architecture,” http:/ Sept. 1999.
[19] R. Huebsch and B.T. Loo, “Content-Based Multicast: Comparison of Overlay Network Implementation,” Project Report for Univ. of California at Berkeley Class CS268, available from http://www.cs. cs268cs268.pdf.
[20] S.K. Kasera, S. Bhattacharyya, M. Keaton, D. Kiwior, J. Kurose, D. Towsley, and S. Zabele, “Scalable Fair Reliable Multicast Using Active Services,” IEEE Network Magazine, special issue on multicast, Jan./Feb. 2000.
[21] R. Koblick, “Concordia,” Comm. ACM, vol. 42, no. 3, pp. 96-97, Mar. 1999.
[22] B. Li, M. Golin, G. Italiano, X. Deng, and K. Sohraby, “On the Optimal Placement of Web Proxies in the Internet,” Proc. IEEE Infocom '99, 1999.
[23] Object Management Group, “CORBAServices: Common Object Services Specification,”, Dec. 1997.
[24] M. Oliviera, J. Crowcroft, and C. Diot, “Router Level Filtering for Receiver Interest Delivery,” Proc. ACM Second Int'l Workshop Networked Group Comm. (NGC-2000), Nov. 2000.
[25] 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,” Proc. Middleware 2000, pp. 185-207, 2000.
[26] V.N. Padmanabhan and L. Qiu, “The Content and Access Dynamics of a Busy Web Site: Findings and Implications,” Proc. ACM SIGCOMM 2000, Aug. 2000.
[27] G. Rajappan, M. Dalal, and T. Kostas, “Reliable Multicast with Active Filtering for Distributed Simulation,” Proc. Milcom '03, 2003.
[28] S. Rak and D. Hook, “Evaluation of Grid-Based Relevance Filtering for Multicast Group Assignment,” Proc. Workshop Standards for the Interoperability of Distributed Simulations, pp. 739-747, Mar. 1996.
[29] R. Shah, R. Jain, S. Rajagopalan, and F. Anjum, “Mobile Filters for Efficient Dissemination of Personalized Information Using Content-Based Multicast,” DIMACS Technical Report 2001-20, June 2001.
[30] Tai H. and K. Kosaka, “The Aglets Project,” Comm. ACM, vol. 42, no. 3, pp. 100-101, Mar. 1999.
[31] A. Tamir, “An $O(pn^2)$ Algorithm for $p$ -Median and Related Problems on Tree Graphs,” Operations Research Letters, vol. 19, pp. 59-94, 1996.
[32] A. Vignette, L. Gao, M.J. Golin, G.F. Italiano, and B. Li, “An Algorithm for Finding a $k$ -Median in a Directed Tree,” Information Processing Letters, vol. 74, nos. 1-2, pp. 81-88, 2000.
[33] S. Wen, J. Griffioen, and K.L. Calvert, “Building Multicast Services from Unicast Forwarding and Ephemeral State,” Proc. IEEE Open Architectures and Network Programming (OpenArch), 2001.
[34] S. Zabele, M. Dorsch, Z. Ge, P. Ji, M. Keaton, J. Kurose, J. Shapiro, and D. Towsley, “SANDS: Specialized Active Networking for Distributed Simulation,” Proc. IEEE DARPA Active Networks Conf. and Exposition, May 2002.
[35] H. Zhou and S. Singh, “Content Based Multicast (CBM) in Ad-Hoc Networks,” Proc. First Ann. Workshop Mobile and Adhoc Networking and Computing, pp 51-60, 2000.
[36] G.K. Zipf, Selected Studies of the Principle of Relative Frequency in Language. Cambridge, Mass.: Harvard Univ. Press, 1932.
[37] G.K. Zipf, Human Behavior and Principle of Least Effort. Cambridge, Mass.: Addison-Wesley, 1949.

Index Terms:
IP multicast, application layer multicast, content-based multicast, content distribution networks, personalized information, mobile computing, mobile software, mobile agents.
Rahul Shah, Zulfikar Ramzan, Ravi Jain, Raghu Dendukuri, Farooq Anjum, "Efficient Dissemination of Personalized Information Using Content-Based Multicast," IEEE Transactions on Mobile Computing, vol. 3, no. 4, pp. 394-408, Oct. 2004, doi:10.1109/TMC.2004.38
Usage of this product signifies your acceptance of the Terms of Use.