¡@

Modern information dissemination services can dynamically produce real-time data that is valid and useful depending on users¡¦on-demand data requests. Information servers must adopt a scheduling approach to maintain timely data access and system performance. Most previous studies on scheduling such data discuss on-demand data broadcasting and real-time task processing with various performance metrics. This paper exploits the attributes of request urgency, service productivity, and access fairness, and proposes an adaptive scheduling scheme for delivering on-demand, time-critical data objects over a data broadcast channel. In terms of request satisfaction and mean access time, performance results show that the proposed scheduling approach is amenable under dynamic on-demand time-critical requests, simultaneously achieving a low mean access time and request deadline miss rate.

Keywords: scheduling, on-demand request, real-time transaction, data broadcasting, information dissemination

Retrieve PDF document (201111_11.pdf)

Received February 25, 2010; revised July 19 & September 19, 2010; accepted October 6, 2010.
Communicated by Tei-Wei Kuo.
^* This article was aimed at supplanting the previous conference version, presented in Proceedings of the 21st IEEE International Conference on Advanced Information Networking and Applications, Niagara Falls, Canada, May 21-23, 2007. This article contains fully materials of case studies, extended scheme design and development, algorithmic forms, newly extensive performance evaluation, and a review of related works. This work was supported in part by the National Science Council of Taiwan, R.O.C., under Contracts No. NSC 97-2218- E-008-009 and NSC 99-2221-E-008-011.