Channel Transition Invariant Fast Broadcasting Scheme
Mohammad Saidur Rahman, Ashfaqur Rahman

TL;DR
This paper introduces a modified fast broadcasting scheme that eliminates initial client waiting time and controls buffer requirements without needing extra channels, improving user experience in video streaming.
Contribution
It proposes a novel FB scheme that ensures zero initial waiting time and manages buffer size without additional bandwidth, addressing limitations of existing methods.
Findings
Achieves zero initial client waiting time.
Controls client buffer size effectively.
Demonstrates improved performance over existing schemes.
Abstract
Fast broadcasting (FB) is a popular near video-on-demand system where a video is divided into equal size segments those are repeatedly transmitted over a number of channels following a pattern. For user satisfaction, it is required to reduce the initial user waiting time and client side buffer requirement at streaming. Use of additional channels can achieve the objective. However, some augmentation is required to the basic FB scheme as it lacks any mechanism to realise a well defined relationship among the segment sizes at channel transition. Lack of correspondence between the segments causes intermediate waiting for the clients while watching videos. Use of additional channel requires additional bandwidth. In this paper, we propose a modified FB scheme that achieves zero initial clients waiting time and provides a mechanism to control client side buffer requirement at streaming without…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
