A simulation-based analysis of scheduling policies for multimedia servers

N. J. Sarhan, C. R. Das

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

Abstract

Multimedia-on-demand (MOD) has grown dramatically in popularity, especially in the domains of education, business, and entertainment. Therefore, the investigation of various alternatives to improve the performance of MOD servers has become a major research focus. The performance of these servers can be enhanced significantly by servicing multiple requests from a common set of resources. The exploited degrees of resource sharing depend greatly on how servers schedule the waiting requests. By scheduling the requests intelligently, a server can support more concurrent customers and can reduce their waiting times for service. In this paper we provide a detailed analysis of existing scheduling policies and propose two new policies, called quantized first-come-first-served (QFCFS) and enhanced minimum idling maximum loss (IML+). We demonstrate the effectiveness of these policies through simulation and show that they suit different patterns of customer waiting tolerance.

Original languageEnglish (US)
Title of host publicationProceedings - 36th Annual Simulation Symposium, ANSS 2003
PublisherIEEE Computer Society
Pages183-190
Number of pages8
ISBN (Electronic)0769519113
DOIs
StatePublished - 2003
Event36th Annual Simulation Symposium, ANSS 2003 - Orlando, United States
Duration: Mar 30 2003Apr 2 2003

Publication series

NameProceedings - Simulation Symposium
Volume2003-January
ISSN (Print)1080-241X

Other

Other36th Annual Simulation Symposium, ANSS 2003
CountryUnited States
CityOrlando
Period3/30/034/2/03

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'A simulation-based analysis of scheduling policies for multimedia servers'. Together they form a unique fingerprint.

Cite this