JOURNAL BROWSE
Search
Advanced SearchSearch Tips
An Interdependent Data Allocation Scheme Using Square Root Rule of Data Access Probability
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
An Interdependent Data Allocation Scheme Using Square Root Rule of Data Access Probability
Kwon, Hyeokmin;
  PDF(new window)
 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 to process multiple-data queries in the environment where query profiles and query request rates are given, and proposes a new data allocation scheme named IDAS. The proposed scheme employs the strategy that the broadcast frequency of each data is determined by the square root value of its relative access probability. IDAS could enhance the performance of query response time since it can process queries of high request rate fast and show a resonable degree of query data adjacency. Simulation is performed to evaluate the performance of the proposed scheme. The simulation results show that IDAS outperforms other schemes in terms of the average response time.
 Keywords
Data allocation;broadcast schedule;simulation;
 Language
Korean
 Cited by
1.
A Query-Based Data Allocation Scheme for Multiple Broadcast-Channel Environments, The Journal of the Institute of Internet Broadcasting and Communication, 2016, 16, 6, 165  crossref(new windwow)
 References
1.
S. Acharya, "Broadcast Disks: Disseminationbased Data Management for Asymmetric Communication Environments," Ph.D. thesis, Brown University, 1998.

2.
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. crossref(new window)

3.
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. crossref(new window)

4.
H.M. Kwon, "TLDP: A New Broadcast Scheduling Scheme for Multiple Broadcast- Channel Environments," The Journal of the Institute of Webcasting, Internet and Telecommunication, Vol. 11, No. 2, pp. 63-72, 2011.

5.
H.M. Kwon, "A Near Optimal Data Allocation Scheme for Multiple Broadcast-Channel Environments," The Journal of the Institute of Webcasting, Internet and Telecommunication, Vol. 12, No. 1, pp. 17-27, 2012.

6.
H.P. Hung, J.W. Huang, J.L. Huang, and M.S. Chen, "Scheduling dependent items in data broadcasting environments," ACM SAC 2006.

7.
S.W. Park and S.W. Jung, "Interdependent Data Allocation a scheme over Multiple Wireless Vroadcast Channels," Journal of KIISE : Database, Vol. 36, No. 1, pp. 30-43, 2009.

8.
Y.D. Chung and M.H. Kim, "Effective Data Placement for Wireless Broadcast," Distributed and Parallel Databases, Vol 9, No. 2, 2001

9.
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.

10.
H.M. Kwon, "A Broadcast Data Allocation Scheme for Multiple-Data Queries Using Moving Average of Data Access Probability," The Journal of the Institute of Webcasting, Internet and Telecommunication, Vol. 14, No. 5, pp. 35-43, 2014.

11.
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.

12.
H. Schwetman, 'CSIM Users' Guide for Use with CSIM Revision 16', Microelectronics and Computer Technology Corporation, 1992.