Title

A double patching technique for efficient bandwidth sharing in video-on-demand systems

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Keywords

multimedia communications; multicast; latency; on-demand service; performance evaluation; Computer Science, Information Systems; Computer Science, Software; Engineering; Computer Science, Theory & Methods; Engineering, Electrical; & Electronic

Abstract

Patching is an efficient bandwidth-sharing technique for video-on-demand systems. In this environment, a client joins an on-going regular multicast to receive and cache the data in a local buffer. The server needs to send only the leading portion of the video in a patching stream. When the client finishes playing back the patching data, it continues the playback using the data already cached in the buffer. Although this strategy enables stream sharing without the service delay, the performance of Patching has limitation: as the time distance to the last regular multicast enlarges, the patching cost for new requests increases and eventually, a new regular multicast must be scheduled to balance the cost. In this paper, we address this problem by proposing a new technique called Double Patching. Our research is based on the observation that a patching stream can be shared by the video requests arriving in the next w(p) time units if it delivers an additional 2.w(p) time units of video data. With these extra data, the patching cost for these requests can be dramatically reduced. In the new technique, a client uses no more than two download channels at any one time. Thus, its implementation cost is the same as that of the original Patching. As for its performance, our study shows that the improvement achieved by the proposed technique is significant. In many cases, Double Patching doubles the performance of the original Patching.

Publication Title

Multimedia Tools and Applications

Volume

32

Issue/Number

1

Publication Date

1-1-2007

Document Type

Article

Language

English

First Page

115

Last Page

136

WOS Identifier

WOS:000243049400006

ISSN

1380-7501

Share

COinS