On optimal piggyback merging policies for video-on-demand systems
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Group-guaranteed channel capacity in multimedia storage servers
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Patching: a multicast technique for true video-on-demand services
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Efficient and scalable on-demand data streaming using UEP codes
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Selecting among replicated batching video-on-demand servers
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Scheduled video delivery for scalable on-demand service
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
The dyadic stream merging algorithm
Journal of Algorithms
Scheduling Video Streams in Video-on-Demand Systems: A Survey
Multimedia Tools and Applications
Performance Issues of Multimedia Applications
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Proxy Caching Based on Patching Scheme and Prefetching
PCM '01 Proceedings of the Second IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Efficient schemes for broadcasting popular videos
Multimedia Systems
Extended Exponential Broadcasting: A New Broadcasting Scheme for Video-on-Demand Systems
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Generalized data retrieval for pyramid-based periodic broadcasting of videos
Future Generation Computer Systems - Special issue: Semantic grid and knowledge grid: the next-generation web
Competitive on-line stream merging algorithms for media-on-demand
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Multimedia Tools and Applications
Multimedia Tools and Applications
A Novel Dynamic and Scalable Caching Algorithm of Proxy Server for Multimedia Objects
Journal of VLSI Signal Processing Systems
Journal of Parallel and Distributed Computing
Medusa: a novel stream-scheduling scheme for parallel video servers
EURASIP Journal on Applied Signal Processing
Hi-index | 0.00 |
In a video-on-demand environment, batching of video requests is often used to reduce I/O demand and improve throughput. Since viewers may defect if they experience long waits, a good video scheduling policy needs to consider not only the batch size but also the viewer defection probabilities and wait times. Two conventional scheduling policies for batching are first-come-first-served (FCFS) and maximum queue length (MQL). Neither of these policies lead to entirely satisfactory results. MQL tends to be too aggressive in scheduling popular videos by only considering the queue length to maximize batch size, while FCFS has the opposite effect. In this paper, we introduce the notion of factored queue length and propose a batching policy that schedules the video with the maximum factored queue length}. We refer to this as the MFQ policy. The factored queue length is obtained by weighting each video queue length with a factor which is biased against the more popular videos. An optimization problem is formulated to solve for the best weighting factors for the various videos. A simulation is developed to compare the proposed MFQ policy with FCFS and MQL. Our study shows that MFQ yields excellent empirical results in terms of standard performance measures such as average latency time, defection rates and fairness.