Channel Transition Invariant Fast Broadcasting Scheme

November 22, 2017 Β· Declared Dead Β· πŸ› International Forum on Strategic Technology

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Mohammad Saidur Rahman, Ashfaqur Rahman arXiv ID 1711.08118 Category cs.MM: Multimedia Citations 1 Venue International Forum on Strategic Technology Last Checked 3 months ago
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 requiring additional channels. We present several results to demonstrate the effectiveness of the proposed FB scheme over the existing ones.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Multimedia

R.I.P. πŸ‘» Ghosted

Video Generation From Text

Yitong Li, Martin Renqiang Min, ... (+3 more)

cs.MM πŸ› AAAI πŸ“š 300 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted