Browse > Article
http://dx.doi.org/10.7236/JIIBC.2014.14.5.35

A Broadcast Data Allocation Scheme for Multiple-Data Queries Using Moving Average of Data Access Probability  

Kwon, Hyeokmin (School of Information and Communication System, Semyung University)
Publication Information
The Journal of the Institute of Internet, Broadcasting and Communication / v.14, no.5, 2014 , pp. 35-43 More about this Journal
Abstract
A data allocation technique is essential to improve the performance of data broadcast systems. This paper explores the issues for allocating data items on broadcast channels in the environment where multiple-data queries are submitted, and proposes a new data allocation scheme named DAMA. The proposed scheme employs the strategy that the broadcast frequency of each data is determined by the moving average of its access probability. DAMA could enhance the performance of query response time since it is capable of controlling the influence of access probability properly according to the query size. Simulation is performed to evaluate the performance of the proposed scheme. The simulation results show that the performance of DAMA is superior to other schemes in terms of the average response time.
Keywords
Data allocation; broadcast schedule; moving average; simulation;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 S. Acharya, "Broadcast Disks: Disseminationbased Data Management for Asymmetric Communication Environments," Ph.D. thesis, Brown University, 1998.
2 M. Franklin and S. Zdonik, "A Framework for Scalable Dissemination-Based Systems," In the Int. Conf. on Object-Oriented Programming Languages, Systems, and Applications, pp. 94-105, Atlanta, GA, October 1997.
3 W.G. Yee, S. Navathe, E. Omiecinski, and C. Jermaine, "Efficient Data Allocation over Multiple Channels at Broadcast Servers," IEEE Trans. on Computers, Vol. 51, No. 10, pp. 1231-1236, Oct. 2002.   DOI   ScienceOn
4 S. Wang and H.L. Chen, "An O(N log K) Restricted Dynamic Programming Algorithm for Data Allocation over Multiple Channels," IEICE trans. on communications, Vol. E88-B, No. 9, pp. 3756-3764, Sep. 2005.   DOI   ScienceOn
5 S. Wang and H.L. Chen, "Near-optimal data allocation over multiple broadcast channels," Computer communications, Vol. 29, No. 9, pp. 1341-1349, Elsevier Science, 2006.   DOI   ScienceOn
6 H. M. Kwon, "TLDP: A New Broadcast Scheduling Scheme for Multiple Broadcast-Channel Environments," The Journal of the Institute of Internet, Broadcasting and Communication(JIIBC), Vol. 11, No. 2, pp. 63-72, 2011.   과학기술학회마을
7 H. M. Kwon, "A Near Optimal Data Allocation Scheme for Multiple Broadcast-Channel Environments," The Journal of the Institute of Internet, Broadcasting and Communication(JIIBC), Vol. 12, No. 1, pp. 17-27, 2012.   과학기술학회마을   DOI
8 Y. D. Chung and M. H. Kim, "Effective Data Placement for Wireless Broadcast," Distributed and Parallel Databases, Vol 9, No. 2, 2001
9 G Lee and SC Lo, "Broadcast data allocation for efficient access of multiple data items in mobile environments," Mobile Networks and Applications, Vol. 8, No. 4, pp. 365-375, 2003.   DOI
10 H. Schwetman, 'CSIM Users' Guide for Use with CSIM Revision 16', Microelectronics and Computer Technology Corporation, 1992.
11 J.L. Huang and M.S. Chen, "Dependent data broadcasting for unordered queries in a multiple channel mobile environment," IEEE Trans. on Knowledge and Data Engr., Vol. 16, No. 6, 2004.
12 H.P. Hung, J.W. Huang, J.L. Huang, and M.S. Chen, "Scheduling dependent items in data broadcasting environments," ACM SAC 2006.
13 C. Hsu, G. Lee, A.L.P. Chen, "A near optimal algorithm for generating broadcast programs on multiple channels," Proc. ACM 10th Int'l Conf. CIKM, Atlanta, Georgia, pp. 303-309, 2001.