IEICE TRANSACTIONS on Communications
Feedback-Based Adaptive Video Streaming over Lossy Channels
Summary :
In packet networks including the Internet and commercial 3G wireless bearers, the network states that a streaming media application experiences are not known a priori and exhibit time-varying characteristics. For such dynamic environments, network-adaptive techniques are essential to efficiently deliver video data. In this paper, we propose a frame-based optimal scheduling algorithm which incorporates a MAP (Maximum A Posteriori) framework for adapting to varying network loss rate. The optimal transmission schedule is determined such that effective frame-rate is maximized at playback. Also, for multiple packets per frame, frame-based selection of delivery order greatly reduces computational complexity for a server scheduler when compared with packet-based scheduling techniques. In addition, by dynamically estimating instantaneous packet loss probability, the proposed scheduler performs network-adaptive transmission for streaming video over time-varying packet networks. Simulation results for test video sequence show that the proposed scheduling algorithm outperforms conventional ARQ-based schemes from a view point of reconstructed video quality as well as playable frame-rate. In particular, the proposed scheduling algorithm exhibits significant improvements of frame-rate over highly lossy channels.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E87-B No.10 pp.3076-3084
- Publication Date
- 2004/10/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Multimedia Systems for Communications" Multimedia Systems for Communications
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jong-Ok KIM, Hideki TODE, Koso MURAKAMI, "Feedback-Based Adaptive Video Streaming over Lossy Channels" in IEICE TRANSACTIONS on Communications,
vol. E87-B, no. 10, pp. 3076-3084, October 2004, doi: .
Abstract: In packet networks including the Internet and commercial 3G wireless bearers, the network states that a streaming media application experiences are not known a priori and exhibit time-varying characteristics. For such dynamic environments, network-adaptive techniques are essential to efficiently deliver video data. In this paper, we propose a frame-based optimal scheduling algorithm which incorporates a MAP (Maximum A Posteriori) framework for adapting to varying network loss rate. The optimal transmission schedule is determined such that effective frame-rate is maximized at playback. Also, for multiple packets per frame, frame-based selection of delivery order greatly reduces computational complexity for a server scheduler when compared with packet-based scheduling techniques. In addition, by dynamically estimating instantaneous packet loss probability, the proposed scheduler performs network-adaptive transmission for streaming video over time-varying packet networks. Simulation results for test video sequence show that the proposed scheduling algorithm outperforms conventional ARQ-based schemes from a view point of reconstructed video quality as well as playable frame-rate. In particular, the proposed scheduling algorithm exhibits significant improvements of frame-rate over highly lossy channels.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e87-b_10_3076/_p
Copy
@ARTICLE{e87-b_10_3076,
author={Jong-Ok KIM, Hideki TODE, Koso MURAKAMI, },
journal={IEICE TRANSACTIONS on Communications},
title={Feedback-Based Adaptive Video Streaming over Lossy Channels},
year={2004},
volume={E87-B},
number={10},
pages={3076-3084},
abstract={In packet networks including the Internet and commercial 3G wireless bearers, the network states that a streaming media application experiences are not known a priori and exhibit time-varying characteristics. For such dynamic environments, network-adaptive techniques are essential to efficiently deliver video data. In this paper, we propose a frame-based optimal scheduling algorithm which incorporates a MAP (Maximum A Posteriori) framework for adapting to varying network loss rate. The optimal transmission schedule is determined such that effective frame-rate is maximized at playback. Also, for multiple packets per frame, frame-based selection of delivery order greatly reduces computational complexity for a server scheduler when compared with packet-based scheduling techniques. In addition, by dynamically estimating instantaneous packet loss probability, the proposed scheduler performs network-adaptive transmission for streaming video over time-varying packet networks. Simulation results for test video sequence show that the proposed scheduling algorithm outperforms conventional ARQ-based schemes from a view point of reconstructed video quality as well as playable frame-rate. In particular, the proposed scheduling algorithm exhibits significant improvements of frame-rate over highly lossy channels.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Feedback-Based Adaptive Video Streaming over Lossy Channels
T2 - IEICE TRANSACTIONS on Communications
SP - 3076
EP - 3084
AU - Jong-Ok KIM
AU - Hideki TODE
AU - Koso MURAKAMI
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2004
AB - In packet networks including the Internet and commercial 3G wireless bearers, the network states that a streaming media application experiences are not known a priori and exhibit time-varying characteristics. For such dynamic environments, network-adaptive techniques are essential to efficiently deliver video data. In this paper, we propose a frame-based optimal scheduling algorithm which incorporates a MAP (Maximum A Posteriori) framework for adapting to varying network loss rate. The optimal transmission schedule is determined such that effective frame-rate is maximized at playback. Also, for multiple packets per frame, frame-based selection of delivery order greatly reduces computational complexity for a server scheduler when compared with packet-based scheduling techniques. In addition, by dynamically estimating instantaneous packet loss probability, the proposed scheduler performs network-adaptive transmission for streaming video over time-varying packet networks. Simulation results for test video sequence show that the proposed scheduling algorithm outperforms conventional ARQ-based schemes from a view point of reconstructed video quality as well as playable frame-rate. In particular, the proposed scheduling algorithm exhibits significant improvements of frame-rate over highly lossy channels.
ER -
English
