Scheduling time-critical requests for multiple data objects in on-demand broadcast

  • Authors:

  • Victor C. S. Lee;Kai Liu

  • Affiliations:

  • Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong;Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong

  • Venue:
  • Concurrency and Computation: Practice & Experience
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

On-demand broadcast is an effective data dissemination approach in mobile computing environments. Most of the recent studies on on-demand data broadcast assume that clients request only a single-data-object at a time. This assumption may not be practical for the increasingly sophisticated mobile applications. In this paper, we investigate the scheduling problem of time-critical requests for multiple data objects in on-demand broadcast environments and observe that existing scheduling algorithms designed for single-data-object requests perform unsatisfactorily in this new setting. Based on our analysis, we propose new algorithms to improve the system performance. Copyright © 2010 John Wiley & Sons, Ltd.