Smooth fast broadcasting (SFB) for compressed videos

Hsiang Fu Yu, Hung Chang Yang, Yi Ming Chen, Li Ming Tseng, Chen Yi Kuo

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

9 Scopus citations

Abstract

One way to broadcast a popular video is to partition the video into segments, which are broadcasted on several streams periodically. The approach lets multiple users share streams; thus, the stress on the scarce bandwidth can be alleviated without sacrificing viewers' waiting time. One representative approach is the Fast Broadcasting (FB) scheme. The scheme does not obtain shortest waiting time but it can offer a more reliable video transmission on wireless networks. However, the scheme mainly supports transmission of CBR-encoded videos. In this paper, we propose a FB-based scheme for VBR-encoded videos. The scheme can smooth required bandwidth. From the simulation results, the SFB scheme has smaller required bandwidth, buffers, and disk transfer rate than the FB scheme. For a video, the maximum difference of its required bandwidth is less or equal to max(Bmaxi - B mini), where Bmaxi and B mini represent the maximum and minimum required bandwidth on stream i.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsPeter Langendoerfer, Mingyan Liu, Ibrahim Matta, Vassilis Tsaoussidis
PublisherSpringer Verlag
Pages272-283
Number of pages12
ISBN (Print)3540209549, 9783540209546
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2957
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Smooth fast broadcasting (SFB) for compressed videos'. Together they form a unique fingerprint.

Cite this