The Community for Technology Leaders
RSS Icon
Issue No.02 - February (2009 vol.21)
pp: 273-286
Chih-Lin Hu , National Taiwan University, Taipei
Ming-Syan Chen , National Taiwan University, Taipei
The scalability of data broadcasting has been manifested by prior studies on the base of the traditional data management systems where data objects, mapped to a pair of state and value in the database, are independent, persistent, and static against simple queries. However, many modern information applications spread dynamic data objects and process complex queries for retrieving multiple data objects. Particularly, the information servers dynamically generate data objects that are dependent and can be associated into a complete response against complex queries. Accordingly, the study in this paper considers the problem of scheduling dynamic broadcast data objects in a clients-providers-servers system from the standpoint of data association, dependency, and dynamics. Since the data broadcast problem is NP-hard, we derive the lower and the upper bounds of the mean service access time. In light of the theoretical analyses, we further devise a deterministic algorithm with several gain measure functions for the approximation of schedule optimization. The experimental results show that the proposed algorithm is able to generate a dynamic broadcast schedule and also minimize the mean service access time to the extent of being very close to the theoretical optimum.
Push, broadcast, periodicity, scheduling, query processing, data dissemination, mobile database.
Chih-Lin Hu, Ming-Syan Chen, "Online Scheduling Sequential Objects with Periodicity for Dynamic Information Dissemination", IEEE Transactions on Knowledge & Data Engineering, vol.21, no. 2, pp. 273-286, February 2009, doi:10.1109/TKDE.2008.148
[1] S. Acharya et al., “Broadcast Disks: Data Management for Asymmetric Communications Environments,” Proc. ACM SIGMOD'95, pp. 199-210, May 1995.
[2] M.H. Ammar and J.W. Wong, “On the Optimality of Cyclic Transmission in Teletext Systems,” IEEE Trans. Comm., vol. 35, no. 11, pp. 1159-1170, 1987.
[3] D. Barbará, “Mobile Computing and Database—A Survey,” IEEE Trans. Knowledge and Data Eng., vol. 11, no. 1, pp. 108-117, Jan./Feb. 1999.
[4] T. Imielinski and B.R. Badrinath, “Mobile Wireless Computing: Challenges in Data Management,” Comm. ACM, vol. 37, no. 10, pp.18-28, 1994.
[5] K.-L. Tan and B.C. Ooi, Data Dissemination in Wireless Computing Environments. Kluwer Academic Publishers, 2000.
[6] G. Lee, S. Lo, and A. Chen, “Data Allocation on Wireless Broadcast Channels for Efficient Query Processing,” IEEE Trans. Computers, vol. 51, no. 10, pp. 1237-1252, Oct. 2002.
[7] A. Bar-Noy and Y. Shilo, “Optimal Broadcasting of Two Files over an Asymmetric Channel,” Proc. IEEE INFOCOM '99, pp. 267-274, 1999.
[8] Y. Chung and M. Kim, “Efficient Data Placement for Wireless Broadcast,” Distributed and Parallel Database, vol. 9, no. 2, pp.133-150, Mar. 2001.
[9] A. Si and H. Leong, “Query Optimization for Broadcast Database,” Data and Knowledge Eng., vol. 29, no. 3, pp. 351-380, 1999.
[10] T. Bowen et al., “The Datacycle Architecture,” Comm. ACM, vol. 35, no. 12, pp. 71-81, 1992.
[11] E. Pitoura, R. Chrusanthis, and K. Ramamritham, “Characterizing the Temporal and Semantic Coherency of Broadcast-Based Data Dissemination,” Proc. Ninth Int'l Conf. Database Theory (ICDT), 2003.
[12] J. Shanmugasundaram et al., “Efficient Concurrency Control for Broadcast Environment,” Proc. ACM SIGMOD, 1999.
[13] A. Bar-Noy, J. Naor, and B. Schiber, “Pushing Dependent Data in Clients-Providers-Servers Systems,” Proc. ACM MobiCom '00, pp. 222-230, 2000.
[14] C.-L. Hu and M.-S. Chen, “Dynamic Data Broadcasting with Traffic Awareness,” Proc. 22nd IEEE Int'l Conf. Distributed Computing Systems (ICDCS '02), July 2002.
[15] C.-J. Su, L. Tassiulas, and V.J. Tsotras, “Broadcast Scheduling for Information Distribution,” ACM/Baltzer Wireless Networks, vol. 5, no. 2, pp. 137-147, 1999.
[16] A. Bar-Noy, R. Bhatia, J. Naor, and B. Schiber, “Minimizing Service and Operation Costs of Periodic Scheduling,” Proc. Ninth ACM-SIAM Symp. Discrete Algorithms (SODA '98), pp.11-20, Jan. 1998.
[17] V. Gondhalekar, R. Jain, and J. Werth, “Scheduling on Airdisks: Efficient Access to Personalized Information Services via Periodic Wireless Data Broadcast,” Proc. IEEE Int'l Conf. Comm. (ICC '97), pp. 1276-1280, 1997.
[18] C. Kenyon and N. Schabanel, “The Data Broadcast Problem with Non-Uniform Transmission Times (Revised Version),” Proc. 10th ACM-SIAM Symp. Discrete Algorithms (SODA '99), Jan. 1999.
[19] E. Pitoura and R. Chrusanthis, “Scalable Processing of Read-Only Transactions in Broadcast Push,” Proc. 19th IEEE Int'l Conf. Distributed Computing Systems (ICDCS '99), Sept. 1999.
[20] E. Pitoura and R. Chrusanthis, “Multiversion Data Broadcast,” IEEE Trans. Computers, vol. 51, no. 10, pp. 1224-1230, Oct. 2002.
[21] H. Leung, J. Yuen, K. Lam, and E. Chan, “Enhanced Multiversion Data Broadcast Scheme for Time-Constrained Mobile Computing Systems,” Proc. 13th Int'l Conf. Database and Expert Systems Applications (DEXA), 2002.
[22] S. Acharya, M.J. Franklin, and S.B. Zdonik, “Prefetching from Broadcast Disks,” Proc. 12th IEEE Int'l Conf. Data Eng. (ICDE '96), pp. 276-285, Feb. 1996.
[23] K.-L. Wu, P.S. Yu, and M.-S. Chen, “Energy-Efficient Caching for Bandwidth-Limited Wireless Mobile Computing,” Proc. 12th IEEE Int'l Conf. Data Eng. (ICDE '96), pp. 335-343, Feb. 1996.
[24] J. Cai and K.-L. Tan, “Tuning Integrated Dissemination-Based Information Systems,” Data and Knowledge Eng., vol. 30, no. 1, pp. 1-21, 1999.
[25] M.-S. Chen, P.S. Yu, and K.-L. Wu, “Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 1, pp. 161-173, Jan./Feb. 2003.
[26] Q. Hu, W.-C. Lee, and D.L. Lee, “Indexing Techniques for Wireless Data Broadcast under Data Clustering and Scheduling,” Proc. Eighth ACM Int'l Conf. Information and Knowledge Management (CIKM), 1999.
[27] T. Imielinski, S. Viswanathan, and B.R. Badrinath, “Data on Air: Organization and Access,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 3, pp. 353-372, May/June 1997.
[28] J. Xu et al., “An Error-Resilient and Tunable Distributed Indexing Scheme for Wireless Data Broadcast,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 3, pp. 392-404, Mar. 2006.
[29] S. Acharya, M.J. Franklin, and S.B. Zdonik, “Balancing Push and Pull for Data Broadcast,” Proc. ACM SIGMOD '97, pp. 183-194, May 1997.
[30] C.-L. Hu and M.-S. Chen, “Adaptive Multi-Channel Data Dissemination: Support of Dynamic Traffic Awareness and Push-Pull Time Balance,” IEEE Trans. Vehicular Technology, vol. 54, no. 2, 2005.
[31] J.-H. Hu, K.L. Yeung, G. Fend, and K. Leung, “A Novel Push-and-Pull Hybrid Data Broadcast Scheme for Wireless Information Networks,” Proc. IEEE Int'l Conf. Comm. (ICC '00), pp. 1778-1782, June 2000.
[32] K. Stathatos, N. Roussopoulos, and J.S. Baras, “Adaptive Data Broadcast in Hybrid Networks,” Proc. 23rd Int'l Conf. Very Large Data Bases (VLDB '97), Aug. 1997.
[33] Y.-I. Chang, C.-N. Yang, and J.-H. Shen, “A Binary-Number-Based Approach to Data Broadcasting in Wireless Information Systems,” Proc. IEEE Int'l Conf. Wireless Networks, Comm. and Mobile Computing (WirelessCom '05), pp. 348-353, June 2005.
[34] P. Nicopolitidis, G.I. Papadimitriou, and A.S. Pomportsis, “Exploiting Locality of Demand to Improve the Performance of Wireless Data Broadcasting,” IEEE Trans. Vehicular Technology, vol. 55, no. 4, pp. 1347-1361, 2006.
[35] W.-C. Peng and M.-S. Chen, “Efficient Channel Allocation Tree Generation for Data Broadcasting in a Mobile Computing Environment,” Wireless Networks, vol. 9, no. 2, pp. 117-129, 2003.
[36] W. Wang and C.V. Ravishankar, “Adaptive Data Broadcasting in Asymmetric Communication Environments,” Proc. Eighth Int'l Database Eng. and Applications Symp. (IDEAS '04), pp. 27-36, July 2004.
[37] S. Hameed and N.H. Vaidya, “Efficient Algorithms for Scheduling Data Broadcast,” ACM/Baltzer Wireless Networks, vol. 5, no. 3, pp. 183-193, 1999.
[38] N.H. Vaidya and S. Hameed, “Scheduling Data Broadcast in Asymmetric Communication Environments,” ACM/Baltzer Wireless Networks, vol. 5, no. 3, pp. 171-182, 1999.
[39] N. Schabanel, “The Data Broadcast Problem with Preemption,” Proc. 17th Int'l Symp. Theoretical Computer Science (STACS '00), pp. 181-192, Feb. 2000.
[40] G. Lee, M. Yeh, S. Lo, and A. Chen, “A Strategy for Efficient Access of Multiple Data Items in Mobile Environments,” Proc. Third Int'l Conf. Mobile Data Management, pp. 71-78, 2002.
[41] Y.D. Chung and M.H. Kim, “QEM: A Scheduling Method for Wireless Broadcast Data,” Proc. Int'l Conf. Database Systems for Advanced Applications (DSFAA '99), pp. 135-142, 1999.
[42] J.-L. Huang and M.-S. Chen, “Broadcasting Dependent Data for Ordered Queries without Replication in a Multi-Channel Mobile Environment,” Proc. 19th IEEE Int'l Conf. Data Eng. (ICDE '03), Mar. 2003.
[43] J.-L. Huang and M.-S. Chen, “Broadcast Program Generation for Unordered Queries with Data Replication,” Proc. 18th ACM Symp. Applied Computing (SAC '03), Mar. 2003.
[44] F.J.O. Martinwz, U.S. Gonzalez, and I. Stojmenovic, “A Parallel Hill Climbing Algorithm for Pushing Dependent Data in Clients-Providers-Servers Systems,” Proc. Seventh IEEE Symp. Computers and Comm. (ISCC '02), July 2002.
[45] G.K. Zipf, Human Behaviour and the Principle of Least Effort. Addison-Wesley, 1949.
[46] M. Arlitt and C. Williamson, “Internet Web Servers: Workload Characterization and Performance Implications,” IEEE/ACM Trans. Networking, vol. 5, no. 5, pp. 631-645, 1997.
[47] B. Krishnamurthy and J. Rexford, Web Protocols and Practice: HTTP/1.1, Networking Protocols, Caching, and Traffice Measurement. Addison-Wesley, 2001.
[48] X. Tang, J. Xu, and S.T. Chanson, Web Content Delivery. Springer, 2005.
[49] L. Breslau et al., “Web Caching and Zipf-Like Distributions: Evidence and Implications,” Proc. IEEE INFOCOM '99, pp.126-134, Mar. 1999.
[50] P. Barford and M. Crovella, “Generating Representative Web Workloads for Network and Server Performance Evaluations,” ACM SIGMETRICS Performance Evaluation Rev., vol. 26, no. 1, pp.151-160, 1998.
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool