Scheduling web requests in broadcast environments

Jianliang XU, Wang Chien Lee, Jiangchuan Liu

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review

4 Citations (Scopus)

Abstract

On-demand broadcast has been supported in the Internet to enhance system scalability. Unfortunately, most of existing on-demand scheduling algorithms did not consider the time constraints associated with web requests. This paper proposes a novel scheduling algorithm, called Slack Inverse Number of requests (SIN), that takes into account the urgency and productivity of serving pending requests. Trace-driven experiments demonstrate that SIN significantly outperforms existing algorithms over a wide range of workloads.

Original languageEnglish
Title of host publicationProceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters
PublisherAssociation for Computing Machinery (ACM)
Pages280-281
Number of pages2
ISBN (Print)1581139128, 9781581139129
DOIs
Publication statusPublished - 19 May 2004
Event13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004 - New York, United States
Duration: 19 May 200421 May 2004

Publication series

NameProceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004

Conference

Conference13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004
Country/TerritoryUnited States
CityNew York
Period19/05/0421/05/04

Scopus Subject Areas

  • Computer Networks and Communications
  • Software

User-Defined Keywords

  • On-demand broadcast
  • Scheduling algorithms
  • Time constraints
  • Web

Fingerprint

Dive into the research topics of 'Scheduling web requests in broadcast environments'. Together they form a unique fingerprint.

Cite this