DOI QR코드

DOI QR Code

A Hybrid Data Broadcast Scheduling Scheme Using Moving Average of Data Access Probability

데이터 액세스 확률의 이동 평균을 이용한 하이브리드 데이터 방송 스케줄링 기법

  • Kwon, Hyeokmin (School of Information and Communication, Semyung University)
  • 권혁민 (세명대학교 정보통신학부)
  • Received : 2018.08.15
  • Accepted : 2018.10.05
  • Published : 2018.10.31

Abstract

A broadcast scheduling scheme is an essential technique to improve the performance of data broadcast systems. This paper explores the problem of data broadcast over multiple channels to reduce query response time, and proposes a new hybrid data broadcast scheduling scheme named HDAMA. The proposed scheme employs the strategy that combines the advantages of push-based broadcast and pull-based broadcast. HDAMA could enhance the performance of query response time since it is capable of controlling the influence of access probability properly reflecting the characteristics of multi-data queries and broadcasting pull data items relatively on time. Simulation is performed to evaluate the performance of the proposed scheme. The simulation results show that the performance of HDAMA is superior to other schemes in terms of the average response time.

방송 스케줄링 기법은 데이터 방송 시스템의 성능을 향상시키기 위해서 필수적인 기술이다. 본 논문은 질의의 응답시간을 줄이기 위하여 다중 채널을 통한 데이터 방송의 문제를 연구하여 HDAMA로 명명된 새로운 하이브리드 데이터 방송 스케줄링 기법을 제안한다. 제안된 기법은 푸쉬기반 방송과 풀기반 방송의 장점을 결합하는 전략을 채택한다. HDAMA는 다중 데이터 질의의 특성을 반영하여 액세스 확률의 영향력을 적절하게 제어할 수 있고, 풀 데이터를 비교적 적시에 방송할 수 있기 때문에 질의 응답시간의 성능을 향상시킬 수 있다. 제안된 기법의 성능 평가를 위해 시뮬레이션이 수행되었다. 실험 결과에 따르면, 평균 응답시간의 성능에서 HDAMA는 다른 기법보다 우수한 성능을 보인다.

Keywords

References

  1. M. Narvekar, H. Mukadam, and S.S. Mantha, "Comparison of Broadcast Scheduling Techniques in Mobile Computing Environment," Procedia Computer Sciences Vol. 45, pp. 706-711, 2015. DOI: https://doi.org/10.1016/j.procs.2015.03.136
  2. D. Aksoy and M.S. Leung, "Pull vs Push: A Quantitative Comparison for Data Broadcast," in Proc. of the 47th IEEE Global Telecommunications Conference (GLOBECOM'04), pp. 1464-1468, 2004. DOI: https://doi.org/10.1109/GLOCOM.2004.1378225
  3. J. Lv, V.C.S. Lee, M. Li, and E. Chen, "Profit-based scheduling and channel allocation for multi-item requests in real-time on-demand data broadcast systems," Data & Knowledge Engineering, Vol. 73, pp. 23-42, 2012. DOI: https://doi.org/10.1016/j.datak.2011.09.005
  4. S. Acharya, "Broadcast Disks: Disseminationbased Data Management for Asymmetric Communication Environments," Ph.D. thesis, Brown University, 1998.
  5. 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: https://doi.org/10.1109/TC.2002.1039849.
  6. 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. DOI: https://doi.org/10.7236/JIWIT.2012.12.1.17.
  7. H.P. Hung, J.W. Huang, J.L. Huang, and M.S. Chen, "Scheduling dependent items in data broadcasting environments," ACM SAC 2006. DOI: https://doi.org/10.1145/1141277.1141555
  8. 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 Internet, Broadcasting and Communication(JIIBC), Vol. 14, No. 5, pp. 35-43, 2014. DOI: https://doi.org/10.7236/JIIBC.2014.14.5.35.
  9. D. Aksoy and M. Franklin, "$R{\times}W$: a scheduling approach for large-scale on-demand data broadcast," IEEE/ACM Trans. on Networking, Vol. 7, No. 6, pp. 846-860, 1999. DOI: https://doi.org/10.1109/90.811450
  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. DOI: https://doi.org/10.1145/502585.502637.
  11. H. Schwetman, 'CSIM Users' Guide for Use with CSIM Revision 16', Microelectronics and Computer Technology Corporation, 1992.