TY - GEN
T1 - A simulation-based analysis of scheduling policies for multimedia servers
AU - Sarhan, N. J.
AU - Das, C. R.
N1 - Publisher Copyright:
© 2003 IEEE.
PY - 2003
Y1 - 2003
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84941361760&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84941361760&partnerID=8YFLogxK
U2 - 10.1109/SIMSYM.2003.1192812
DO - 10.1109/SIMSYM.2003.1192812
M3 - Conference contribution
AN - SCOPUS:84941361760
T3 - Proceedings - Simulation Symposium
SP - 183
EP - 190
BT - Proceedings - 36th Annual Simulation Symposium, ANSS 2003
PB - IEEE Computer Society
T2 - 36th Annual Simulation Symposium, ANSS 2003
Y2 - 30 March 2003 through 2 April 2003
ER -