Data scheduling for multi-item requests in multi-channel on-demand broadcast environments

Document Type

Conference Proceeding

Publication Date

2008

DOI

10.1145/1626536.1626546

Abstract

On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and capability to handle dynamic user access patterns. With the rapid development of mobile applications, there is an increasing need for systems to support efficient processing of requests for multiple data items in multiple channels broadcast environments. Few studies, however, have considered the on-demand scheduling mechanisms for multi-item requests in multi-channel broadcast environments. In this paper, we investigate the scheduling problems arising in this new environment and observe that existing single-item requests based algorithms are unable to perform efficiently. Two potential problems are identified and examined. First, these algorithms take an excessively long time to serve the last few data items in a request because they disregard the relationship between data items and their parent requests. We claim that these algorithms suffer the request starvation problem in scheduling multi-item requests. Second, these algorithms cannot achieve the expected performance gain with multiple channels. We observed a broadcast mismatch problem in multi-channel broadcast environments. Thus, we propose an innovative algorithm to solve these two potential problems. The simulation results show that the performance of the proposed algorithm is superior to other classical algorithms under a variety of circumstances.

Source Publication

The 7th ACM International Workshop on Data Engineering for Wireless and Mobile Access (MobiDE 2008), Vancouver, Canada.

ISBN

9781605582214

First Page

47

Last Page

54

This document is currently not available here.

Link to Publisher’s Version

Share

COinS