Real time video frames allocation in mobile networks using cooperative pre-fetching

Yuen, Joe Chun-Hung; Chan, Edward; Lam, Kam-Yiu

doi:10.1007/s11042-006-0055-x

Cited by 8 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More recently, collaborative approaches have attracted significant attention. For instance, collaborative smoothing approaches jointly smooth several ongoing video streams; thus, achieving improved statistical multiplexing gains [41], [92], [93]. Similarly, with cooperative video streaming, several nodes cooperate to improve the transmission of a video stream [94]- [98].…”

Section: B Future Video Communications and Networking Research Direcmentioning

confidence: 99%

Video Transport Evaluation With H.264 Video Traces

Seeling

Reisslein

2012

IEEE Commun. Surv. Tutorials

200

150

View full text Add to dashboard Cite

Abstract-The performance evaluation of video transport mechanisms becomes increasingly important as encoded video accounts for growing portions of the network traffic. Compared to the widely studied MPEG-4 encoded video, the recently adopted H.264 video coding standards include novel mechanisms, such as hierarchical B frame prediction structures and highly efficient quality scalable coding, that have important implications for network transport. This tutorial introduces a trace-based evaluation methodology for the network transport of H.264 encoded video. We first give an overview of H.264 video coding, and then present the trace structures for capturing the characteristics of H.264 encoded video. We give an overview of the typical video traffic and quality characteristics of H.264 encoded video. Finally, we explain how to account for the H.264 specific coding mechanisms, such as hierarchical B frames, in networking studies.

show abstract

Section: B Future Video Communications and Networking Research Direcmentioning

confidence: 99%

Video Transport Evaluation With H.264 Video Traces

Seeling

Reisslein

2012

IEEE Commun. Surv. Tutorials

200

150

View full text Add to dashboard Cite

show abstract

“…This leads to inefficiencies as some amount of available transmission capacity at the end of a frame period goes unused as no frame is small enough to fit into the remaining capacity. Similar inefficiencies arise when frames are first smoothed over an MPEG Group-of-Pictures (GoP) and then scheduled using a JSQ like strategy executed on a per-frame period basis [22], or when the scheduling decisions for the transmission of individual frames are computed at discrete slot times [21], [23].…”

Section: Introductionmentioning

confidence: 99%

Continuous-Time Collaborative Prefetching of Continuous Media

Kulapala

Richa

et al. 2008

IEEE Trans. on Broadcast.

View full text Add to dashboard Cite

Abstract-The real-time streaming of bursty continuous media, such as variable-bit rate encoded video, to buffered clients over networks can be made more efficient by collaboratively prefetching parts of the ongoing streams into the client buffers. The existing collaborative prefetching schemes have been developed for discrete time models, where scheduling decisions for all ongoing streams are typically made for one frame period at a time. This leads to inefficiencies as the network bandwidth is not utilized for some duration at the end of the frame period when no video frame "fits" into the remaining transmission capacity in the schedule. To overcome this inefficiency, we conduct in this paper an extensive study of collaborative prefetching in a continuous-time model. In the continuous-time model, video frames are transmitted continuously across frame periods, while making sure that frames are only transmitted if they meet their discrete playout deadlines. We specify a generic framework for continuous-time collaborative prefetching and a wide array of priority functions to be used for making scheduling decisions within the framework. We conduct an algorithm-theoretic study of the resulting continuous-time prefetching algorithms and evaluate their fairness and starvation probability performance through simulations. We find that the continuous-time prefetching algorithms give favorable fairness and starvation probability performance.

show abstract