Share Email Print

Proceedings Paper

Recursive patching: a bandwidth-efficient delivery protocol for multicast video-on-demand systems
Author(s): Zhi Shi; C.-C. Jay Kuo
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A new scheme called recursive patching is proposed in this research to reduce the service bandwidth consumption of a video-on-demand (VOD) system by allowing later clients to merge their services with that of a preceding client that requests the same media. A series of practical on-line algorithms are presented to reduce the high complexity of the optimal recursive patching. A control window is introduced to regulate the degree of service merging. A simple greedy method without control does not work well while a cost-aware method with a carefully chosen control window can provide a simple and robust solution. Furthermore, two starting rules are considered. Our results indicate that the starting rule should be chosen carefully to match different recursive patching schemes. It is demonstrated that a cost-aware recursive patching scheme with a proper starting rule can successfully adapt to various incoming arrival distribution.

Paper Details

Date Published: 12 November 2001
PDF: 12 pages
Proc. SPIE 4518, Multimedia Systems and Applications IV, (12 November 2001); doi: 10.1117/12.448200
Show Author Affiliations
Zhi Shi, Univ. of Southern California (United States)
C.-C. Jay Kuo, Univ. of Southern California (United States)

Published in SPIE Proceedings Vol. 4518:
Multimedia Systems and Applications IV
Andrew G. Tescher; Bhaskaran Vasudev; V. Michael Bove, Editor(s)

© SPIE. Terms of Use
Back to Top