Gang scheduling strategy for request processing in cluster based video-on-demand systems

Abstract

The recent advances and development of inexpensive computers and high speed networking technology have enabled the Video on Demand (VoD) application to connect to shared-computing servers, replacing the traditional computing environments where each application was having its own dedicated computing hardware. The VoD application enables the viewer to select, from a list of video files, their favourite video file and watch it at their will. As VoD is becoming more ubiquitous, users are expecting more features. The overall objective of a VoD service provider is to provide a better Quality of Service (QoS). There are many ways to achieve higher level of QoS. One such solution is to avoid client starvation period / time by using effective scheduling strategy. This paper proposes a gang scheduling framework for video request processing in Video-on-Demand Systems. The simulation results show that the number of requests being rejected is 8.5%. © 2012 Springer-Verlag GmbH Berlin Heidelberg.