A Network Channel Buffer Scheduling Algorithm for an Interactive VOD Server

A VOD server handles various types of media such as continuous media (CM) and non-continuous media (NM). Conventional VOD server buffer scheduling algorithms like Round Robin (RR) and Earliest Deadline First (EDF) have tradeoffs between guaranteeing the deadline of CM and getting a fast response time of NM. The former performs well in a NM environment while the latter is suitable for CM. In this paper, we present a network channel buffer scheduling algorithm to support VOD server based on the dynamic-Critical Task Indicating algorithm [8] which was developed by the authors. The goal of the proposed algorithm is to get fast response time for NM while guaranteeing the deadlines of CM. Our simulation study show that the proposed algorithm demonstrates a similar blocking rate for CM, however considerable improvement of the average response time for NM compared to EDF scheduling.

• Type: Conference
• Year: 1995
• Where: FTDCS
• Authors: Sungyoung Lee, Hyungill Kim, Jongwon Lee
• Keywords: Conventional VOD Server, Distributed And Parallel Computing, Fast Response Time, FTDCS 1995, VoD Server