Generalized Fibonacci broadcasting an efficient VOD scheme with user bandwidth limit

Authors:
Mingjun Edward Yan;Tsunehiko Kameda
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, BC, Canada;School of Computing Science, Simon Fraser University, Burnaby, BC, Canada
Venue:
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Year:
2006

Citing 9
Cited 1

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
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
Scheduling techniques for media-on-demand

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the Design of Efficient Video-on-Demand Broadcast Schedules

MASCOTS '99 Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Fast broadcasting for hot video access

RTCSA '97 Proceedings of the 4th International Workshop on Real-Time Computing Systems and Applications
A Low Bandwidth Broadcasting Protocol for Video on Demand

IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An optimization problem related to vod broadcasting

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Harmonic block windows scheduling through harmonic windows scheduling

MIS'05 Proceedings of the 11th international conference on Advances in Multimedia Information Systems

An interleaving crescent broadcasting protocol for near video-on-demand services

Multimedia Tools and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Broadcasting is attractive in delivering popular videos in video-on-demand service, because the server broadcast bandwidth is independent of the number of users. However, the required server bandwidth does depend on how much bandwidth each user can use, as well as on the user's initial waiting time. This paper addresses the issue of limiting the user bandwidth, and proposes a new broadcasting scheme, named Generalized Fibonacci Broadcasting (GFB). In terms of many performance graphs, we show that, for any given combination of the server bandwidth and user bandwidth, GFB can achieve the least waiting time among all the currently known fixed-delay broadcasting schemes. Furthermore, it is very easy to implement GFB. We also demonstrate that there is a trade-off between the user waiting time and the buffer requirement at the user.