Log-time algorithms for scheduling single and multiple channel data broadcast

Sohail Hameed, Nitin H. Vaidya

Research output: Contribution to conferencePaperpeer-review

Abstract

With the increasing popularity of portable wireless computers, mechanisms to efficiently transmit information to such clients are of significant interest. The environment under consideration is asymmetric in that the information server has much more bandwidth available, as compared to the clients. It has been proposed that in such systems the server should broadcast the information periodically. A broadcast schedule determines what is broadcast by the server and when. This paper makes the simple, yet useful, observation that the problem of broadcast scheduling is closely related to the problem of fair queueing. Based on this observation, we present a log-time algorithm for scheduling broadcast, based on an existing fair queueing algorithm. This algorithm significantly improves the time-complexity over previously proposed broadcast scheduling algorithms. Also, for environments where different users may be listening to different number of broadcast channels, we present an algorithm to coordinate broadcasts over different channels. Simulation results are presented for proposed algorithms.

Original languageEnglish (US)
Pages90-99
Number of pages10
DOIs
StatePublished - 1997
EventProceedings of the 1997 3rd Annual ACM/IEEE International Conference on Mobile Computing and Networking, MobiCom'97 - Budapest, Hung
Duration: Sep 26 1997Sep 30 1997

Other

OtherProceedings of the 1997 3rd Annual ACM/IEEE International Conference on Mobile Computing and Networking, MobiCom'97
CityBudapest, Hung
Period9/26/979/30/97

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Log-time algorithms for scheduling single and multiple channel data broadcast'. Together they form a unique fingerprint.

Cite this