The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2012 vol.23)
pp: 844-852
Hojjat Jafarpour , NEC Laboratoriess America Inc., Cupertino
Bijit Hore , University of California, Irvine, Irvine
Sharad Mehrotra , University of California, Irvine, Irvine
Nalini Venkatasubramanian , University of California, Irvine, Irvine
ABSTRACT
In this paper, we propose a content-based publish/subscribe (pub/sub) framework that delivers matching content to subscribers in their desired format. Such a framework enables the pub/sub system to accommodate richer content formats including multimedia publications with image and video content. In our proposed framework, users (consumers) in addition to specifying their information needs (subscription queries), also specify their profile which includes the information about their receiving context which includes characteristics of the device used to receive the content (e.g., resolution of a PDA used by a consumer). The pub/sub system besides being responsible for matching and routing the published content, also becomes responsible for converting the content into the suitable format for each user. Content conversion is achieved through a set of content adaptation operators (e.g., image transcoder, document translator, etc.). We study algorithms for placement of such operators in heterogeneous pub/sub broker overlay in order to minimize the communication and computation resource consumption. Our experimental results show that careful placement of operators in pub/sub overlay network results in significant cost reduction.
INDEX TERMS
Publish/subscribe, operator placement, customized content dissemination.
CITATION
Hojjat Jafarpour, Bijit Hore, Sharad Mehrotra, Nalini Venkatasubramanian, "CCD: A Distributed Publish/Subscribe Framework for Rich Content Formats", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 5, pp. 844-852, May 2012, doi:10.1109/TPDS.2011.212
REFERENCES
[1] S. Castelli, P. Costa, and G.P. Picco, "HyperCBR: Large-Scale Content-Based Routing in a Multidimensional Space," Proc. IEEE INFOCOM, 2008.
[2] I. Aekaterinidis and P. Triantafillou, "PastryStrings: A Comprehensive Content-Based Publish/Subscribe DHT Network," Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2006.
[3] H. Jafarpour, B. Hore, S. Mehrotra, and N. Venkatasubramanian, "CCD: Efficient Customized Content Dissemination in Distributed Publish/Subscribe," Proc. ACM/IFIP/USENIX Int'l Conf. Middleware, 2009.
[4] F. Cao and J. Pal Singh, "MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks," Proc. ACM/Usenix/IFIP Int'l Conf. Middleware, 2005.
[5] G. Li, V. Muthusamy, and H.A. Jacobsen, "Adaptive Content-Based Routing in General Overlay Topologies," Proc. ACM/Usenix/IFIP Int'l Conf. Middleware, 2008.
[6] B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J. Kubiatowicz, "Tapestry: A Resilient Global-Scale Overlay for Service Deployment," IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 41-53, Jan. 2004.
[7] A. Rowstron and P. Druschel, "Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems," Middleware: Proc. ACM/Usenix/IFIP Int'l Conf. Distributed Systems, 2001.
[8] S.Q. Zhuang, B.Y. Zhao, A.D. Joseph, R.H. Katz, and J. Kubiatowicz, "Bayeux: An Architecture for Scalable and Fault-Tolerant Wide-Area Data Dissemination," Proc. 11th Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), 2001.
[9] R. Baldoni, C. Marchetti, A. Virgillito, and R. Vitenberg, "Content-Based Publish-Subscribe over Structured Overlay Networks," Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2005.
[10] A. Gupta, O. Sahin, D. Agrawal, and A. El Abbadi, "Meghdoot: Content-Based Publish/Subscribe over P2P Networks," Proc. ACM/Usenix/IFIP Fifth Int'l Middleware Conf., 2004.
[11] M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, "Approximation Algorithms for Directed Steiner Problems," Proc. ACM-SIAM Symp. Discrete Algorithms, 1998.
[12] A. Henig and D. Raz, "Efficient Management of Transcoding and Multicasting Multimedia Streams," Proc. Ninth IFIP/IEEE Int'l Symp. Integrated Network Management, 2005.
[13] T. Lambrecht, B. Duysburgh, T. Wauters, F. De TurckBart Dhoedt, and P. Demeester, "Optimizing Multimedia Transcoding Multicast Trees," Computer Networks, vol. 50, no. 1, pp. 29-45, Jan. 2006.
[14] R. Shah, Z. Ramzan, R. Jain, R. Dendukuri, and F. Anjum, "Efficient Dissemination of Personalized Information Using Content-Based Multicast," IEEE Trans. Mobile Computing, vol. 3, no. 4, pp. 394-408, Oct.-Dec. 2004.
[15] Y. Diao, S. Rizvi, and M.J. Franklin, "Towards an Internet-Scale XML Dissemination Service," Proc. Very Large Databases (VLDB) Conf., Aug. 2004.
[16] K. Nahrstedt, B. Yu, J. Liang, and Y. Cui, "Hourglass Content and Service Composition Framework for Pervasive Environments," Pervasive and Mobile Computing, Elsevier, 2005.
[17] C.-Y. Chang and M.-S. Chen, "On Exploring Aggregate Effect for Efficient Cache Replacement in Transcoding Proxies," IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 7, pp. 611-624, June 2003.
[18] G. Eisenhauer, K. Schwan, and F.E. Bustamante, "Publish-Subscribe for High-Performance Computing," IEEE Internet Computing, vol. 10, no. 1, pp. 40-47, Jan./Feb. 2006.
[19] U. Srivastava, K. Munagala, and J. Widom, "Operator Placement for In-Network Stream Query Processing," Proc. 24th ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems (PODS), 2005.
[20] Y. Zhu and M. Ammar, "Algorithms for Assigning Substrate Network Resources to Virtual Network Components," Proc. IEEE INFOCOM, 2006.
14 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool