Response time in data broadcast systems: mean, variance and tradeoff

  • Authors:
  • Shu Jiang;Nitin H. Vaidya

  • Affiliations:
  • Texas A&M University, College Station, TX;Texas A&M University, College Station, TX

  • Venue:
  • Mobile Networks and Applications
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data broadcast has been suggested as a promising method of information dissemination [2,33]. In such an environment, the information server cannot afford to serve the requests from a large population of users individually. Instead, the server uses a broadcast channel to deliver information to all users. A single transmission of a data item satisfies all pending requests for that item. The response time of a request depends on the broadcast time of the desired data item, which is scheduled by the server according to the overall demands for various data items. Therefore, the response time may vary in a large range. We argue that, in addition to mean response time, the variance of response time should also be taken into account by the broadcast scheduler. In this paper, we address the issue of variance optimization in regard to response time. Building on our previous research on mean response time optimization, we propose an algorithm which can minimize the variance of response time. Furthermore, we evaluate an algorithm that facilitates a tradeoff between the mean and variance of response time. Numerical examples that illustrate the performance of our algorithms are also presented.