Performance analysis of data scheduling algorithms for multi-item requests in multi-channel broadcast environments

  • Authors:
  • Kai Liu;Victor C. S. Lee

  • 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:
  • International Journal of Communication Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Nowadays querying multiple-dependent data items in a request is common in many advanced mobile applications, such as traffic information enquiry services. In addition, multi-channel architectures are widely deployed in many data dissemination systems. In this paper, we extend a number of data productivity-based scheduling algorithms and evaluate their performance in scheduling multi-item requests in multi-channel broadcast environments. We observe from the experimental results two performance problems that render these algorithms ineffective. Lastly, we discuss possible causes of these problems to give insights in the design of a better solution. Copyright © 2009 John Wiley & Sons, Ltd. Querying multiple-dependent data items is common in many advanced mobile applications, such as traffic information enquiry services. In this paper, we extend a number of representative scheduling algorithms designed for data broadcast systems and evaluate their performance in scheduling multi-item requests in multi-channel broadcast environments. We observe from the experimental results two performance problems that render these algorithms ineffective. Lastly, we discuss possible causes of these problems to give insights in the design of a better solution. Copyright © 2009 John Wiley & Sons, Ltd.