Browse > Article
http://dx.doi.org/10.9717/kmms.2011.14.9.1165

Two Level Bin-Packing Algorithm for Data Allocation on Multiple Broadcast Channels  

Kwon, Hyeok-Min (세명대학교 정보통신학부)
Publication Information
Journal of Korea Multimedia Society / v.14, no.9, 2011 , pp. 1165-1174 More about this Journal
Abstract
In data broadcasting systems, servers continuously disseminate data items through broadcast channels, and mobile client only needs to wait for the data of interest to present on a broadcast channel. However, because broadcast channels are shared by a large set of data items, the expected delay of receiving a desired data item may increase. This paper explores the issue of designing proper data allocation on multiple broadcast channels to minimize the average expected delay time of all data items, and proposes a new data allocation scheme named two level bin-packing(TLBP). This paper first introduces the theoretical lower-bound of the average expected delay, and determines the bin capacity based on this value. TLBP partitions all data items into a number of groups using bin-packing algorithm and allocates each group of data items on an individual channel. By employing bin-packing algorithm in two step, TLBP can reflect a variation of access probabilities among data items allocated on the same channel to the broadcast schedule, and thus enhance the performance. Simulation is performed to compare the performance of TLBP with three existing approaches. The simulation results show that TLBP outperforms others in terms of the average expected delay time at a reasonable execution overhead.
Keywords
Broadcast Schedule; Data Allocation; Bin-Packing; Mobile Computing;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 J.W. Wong, "Broadcast Delivery," Proc. of the IEEE, Vol.76, No.12, pp. 1566-1577, 1988.   DOI   ScienceOn
2 S. Wang and H.L. Chen, "Near-Optimal Data Allocation Over Multiple Broadcast Channels," Computer communications, Vol.29, No.9, pp. 1341-1349, 2006.   DOI   ScienceOn
3 C. Hsu, G. Lee, and A.L.P. Chen, "A Near Optimal Algorithm for Generating Broadcast Programs on Multiple Channels," Proc. ACM 10th Int'l Conf. CIKM, pp. 303-309, 2001.
4 D. Johnson, A. Demers, J. Ullman, M. Garey, and M. Graham, "Worst-Case Performance Bounds for Simple one Dimensional Bin Packing Algorithms," SIAM J. on Computing, Vol. 3, No.4, pp. 299-325, 1974.   DOI
5 K. Prabhakara, K. A. Hua, and J. Oh "Multi- Level Multi-Channel Air Cache Designs for Broadcasting in a Mobile Environment," Proc. Int'l Conf. Data Eng. (ICDE), 2000.
6 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.   DOI   ScienceOn
7 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, 2002.   DOI   ScienceOn
8 M. Franklin and S. Zdonik, "A Framework for Scalable Dissemination-Based Systems," Proc. ACM OOPSLA Conf., pp. 94-105, 1997.
9 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, 2005.   DOI   ScienceOn
10 S. Acharya, "Broadcast Disks: Disseminationbased Data Management for Asymmetric Communication Environments," Ph.D. thesis, Brown University, 1998.
11 M. Franklin and S. Zdonik, "Data in Your Face: Push Technology in Perspective," Proc. ACM SIGMOD Conf., pp. 516-519, 1998.
12 S. Acharya, R. Alonso, M. Franklin, and S. Zdonik, "Broadcast Disks: Data Management for Asymmetric Communications environments," Proc. ACM SIGMOD Conf., pp. 199- 210, 1995.
13 N.H. Vaidya and S. Hameed, "Scheduling Data Broadcast in Asymmetric Communication Environments," Wireless Networks, Vol.5, No.3, pp. 171-182, 1999.   DOI
14 J.H. Min, J.Y.Hwang, and D.W. Paik, "A Data Scheduling Algorithm Considering the Request Probability for Data Broadcasting," Journal of Korea Multimedia Society Vol.11, No.3, pp. 398-403, 2008.