The Journal of the Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회논문지)

The Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회)
권호 표지
DOI QR코드

DOI QR Code

A Near Optimal Data Allocation Scheme for Multiple Broadcast-Channel Environments

다중 방송 채널 환경을 위한 유사 최적화 데이터 할당 기법

  • Kwon, Hyeok-Min (Dept. of Information and Communication System, Semyung University)
  • 권혁민 (세명대학교 정보통신학부)
  • Received : 2012.01.05
  • Accepted : 2012.02.10
  • Published : 2012.02.29
Download PDF
⟨ Previous Next ⟩

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. This paper explores the issue of designing proper data allocation on multiple broadcast channels to reduce this wait time, and proposes a new data allocation scheme named near optimal data allocation(NODA). The proposed scheme first partitions all data items in K group based on the theoretical lower-bound of the average expected delay to determine data items which each broadcast channel has to broadcast. Then, NODA further partitions each group of data items in B groups using extended dynamic programming algorithm to broadcast data items allocated on the same broadcast channel in different frequencies. The proposed scheme is capable of minimizing the average expected delay time since it can broadcast data items allocated on the same channel reflecting their popularities.

방송 기반의 데이터 전파는 모바일 컴퓨팅 환경에서 보편적으로 받아들여지는 통신 방식이다. 그러나 많은 데이터를 방송해야 할 경우에 방송 채널의 순차성으로 인하여 원하는 데이터를 수신하기까지의 예상 지연시간이 증가한다. 이 대기시간을 줄이기 위하여 본 논문은 다중 채널에 적절하게 데이터를 할당하기 위한 주제를 연구하여 NODA(near optimal data allocation)로 명명된 새로운 데이터 할당 기법을 제안한다. 제안된 기법은 우선 각 방송 채널이 방송해야 하는 데이터들을 결정하기 위하여 평균 예상지연시간의 이론적 하한 값에 기초하여 전체 데이터들을 K개의 그룹으로 분할한다. 그리고 나서 NODA는 동일 방송 채널에 할당된 데이터들을 다른 빈도로 방송하기 위하여, 각 그룹의 데이터들을 확장된 동적 프로그래밍 알고리즘을 사용하여 B개의 그룹으로 분할한다. 제안된 기법은 동일 채널에 할당된 데이터들을 그들의 인기도를 반영하여 방송할 수 있기 때문에 평균 예상지연시간을 최소화할 수 있다.

Keywords

References

  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. 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. N.H. Vaidya and S. Hameed, "Scheduling Data Broadcast in Asymmetric Communication Environments," Wireless Networks, Vol. 5, No. 3, pp. 171-182, May 1999. https://doi.org/10.1023/A:1019142809816
  5. J.W. Wong, "Broadcast Delivery," Proc. of the IEEE, Vol. 76, No. 12, pp. 1566-1577, 1988. https://doi.org/10.1109/5.16350
  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. https://doi.org/10.1023/A:1021837531806
  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, Oct. 2002. https://doi.org/10.1109/TC.2002.1039849
  8. 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. https://doi.org/10.1093/ietcom/e88-b.9.3756
  9. 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. https://doi.org/10.1016/j.comcom.2005.10.011
  10. 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.
  11. C. Hsu, G. Lee, A.L.P. Chen, "A Near Optimal Algorithm for Generating Broadcast Programs on Multiple Channels," Proc. ACM 10th Int. Conf. CIKM, Atlanta, Georgia, pp. 303-309, 2001.

Cited by

  1. A study for object recognition based on location information vol.14, pp.4, 2013, https://doi.org/10.5762/KAIS.2013.14.4.1988
  2. A Broadcast Data Allocation Scheme for Multiple-Data Queries Using Moving Average of Data Access Probability vol.14, pp.5, 2014, https://doi.org/10.7236/JIIBC.2014.14.5.35