A new hybrid broadcast scheduling algorithm for asymmetric communication systems: push and pull data based on optimal cut-off point

  • Authors:

  • Yufei Guo;Sajar K. Das;Cristina M. Pinotti

  • Affiliations:

  • Dept.of CSE, Univ. of Texas at Arlington, Arlington, TX;Dept.of CSE, Univ. of Texas at Arlington, Arlington, TX;Dipartimento di Matematica, Universita' degli Studi di Trento, Povo, 38050 (TN) Italy

  • Venue:
  • MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is believed that broadcast is an efficient way to transmit data in an asymmetric communication system. Most of the previous work focused on either pull-based or push-based scheduling. However, for systems with a very large number of data items, none of these schemes is efficient. We propose a novel scheduling algorithm which uses both pull- and push-based schemes. In our approach, data items are divided into two disjoint sets: one consisting of more-popular items and the other of less-popular items. The items in the former set are broadcast by a push-based schedule, while those in the latter set by a pull-based schedule. By optimally selecting the cut-off point to distinguish these two sets, the new hybrid scheduling algorithm achieves a lower expected access time than other existing schedules.