As streaming video and audio over the Internet become popular, the deployment of a large-scale multimedia streaming application requires an enormous amount of server and network resources. In a video-on-demand environment, batching of video requests are often used to reduced I/O demand and improve throughput. Since users may leave if they experience long waits, a good video scheduling policy needs to consider not only the batch size but also the user defection probabilities and wait times. The common scheduling policies are the first-come-first-served (FCFS), the maximum queue length (MQL), and the maximum factored queue length (MFQL). But these schemes may choose the same video and serve the same video requests. Users choosing other video can not receive the video segment and may leave after waiting a long time.
In this paper, we propose a batching policy that schedules the video with the concept of the bandwidth balancing scheme in DQDB networks. We refer to this as the SPBB policy. Our goal is to make sure that users can get the video segment and don¡¦t leave the video-on-demand system.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0824105-162832 |
| Date | 24 August 2005 |
| Creators | Sung, Hsin-Hung |
| Contributors | Wei-kuang Lai, Chung-nan Lee, Tsang-Ling Sheu, Sheau-Ru Tong, Hsu-Yang Kung |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824105-162832 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0021 seconds