Browse > Article
http://dx.doi.org/10.7236/JIWIT.2011.11.2.063

TLDP: A New Broadcast Scheduling Scheme for Multiple Broadcast-Channel Environments  

Kwon, Hyeok-Min (세명대학교 정보통신학부)
Publication Information
The Journal of the Institute of Internet, Broadcasting and Communication / v.11, no.2, 2011 , pp. 63-72 More about this Journal
Abstract
Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. With the objective of minimizing this wait time, this paper explores the problem of data broadcast over multiple channels. In traditional approaches, data items are partitioned based on their access probabilities and allocated on multiple channels, assuming flat data scheduling per channel. If the data items allocated on the same channel are broadcast in different frequencies based on their access probabilities, the performance will be enhanced further. In this respect, this paper proposes a new broadcast scheduling scheme named two level dynamic programming(TLDP) which can reflect a variation of access probabilities among data items allocated on the same channel.
Keywords
Broadcast schedule; data allocation; dynamic programming;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Acharya, "Broadcast Disks: Dissemination- based 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 (OOPSLA 97), pp. 94-105, Atlanta, GA, October 1997.
3 M. Franklin and S. Zdonik, "Data in Your Face: Push Technology in Perspective," Proc. of the 1998 ACM SIGMOD Int. Conf. on Management of Data, pp. 516-519, Seattle, WA, June 1998.
4 S. Acharya, R. Alonso, M. Franklin, and S. Zdonik, "Broadcast Disks: Data Management for Asymmetric communications environments," Proc. of the 1995 ACM SIGMOD Int. Conf. on Management of Data, pp. 199-210, San Jose, CA, May 1995.
5 S. Acharya, M. Franklin, and S. Zdonik, "Balancing Push and Pull for Data Broadcast," Proc. of the 1997 ACM SIGMOD Int. Conf. on Management of Data, pp. 183-194, Tucson, Arizona, May 1997.
6 V. Liberatore, "Caching and Scheduling for Broadcast Disk Systems," Journal of Experimental Algorithmics, Vol. 6, No. 5, 2001.
7 N.H. Vaidya and S. Hameed, "Scheduling data broadcast in asymmetric communication environments," Wireless Networks, Vol. 5, No. 3, pp. 171-182, May 1999.   DOI
8 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.
9 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
10 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.
11 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
12 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
13 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