A nondisruptive adaptation scheme for peer-to-peer live video streaming during vertical handoff

Authors:
Seungik Lee;Yangwoo Ko;Dongman Lee;Soon J. Hyun
Affiliations:
School of Engineering, Information and Communications University, Daejeon, Rep. of Korea;School of Engineering, Information and Communications University, Daejeon, Rep. of Korea;School of Engineering, Information and Communications University, Daejeon, Rep. of Korea;School of Engineering, Information and Communications University, Daejeon, Rep. of Korea
Venue:
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Year:
2009

Citing 6
Cited 0

Measurements and analysis of end-to-end Internet dynamics

Measurements and analysis of end-to-end Internet dynamics
Equation-based congestion control for unicast applications

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Detecting shared congestion of flows via end-to-end measurement

IEEE/ACM Transactions on Networking (TON)
Resource-aware service composition for video multicast to heterogeneous mobile users

Proceedings of the first ACM international workshop on Multimedia service composition
P2P-based mobile IPTV: Challenges and opportunities

AICCSA '08 Proceedings of the 2008 IEEE/ACS International Conference on Computer Systems and Applications
Overview of the Scalable Video Coding Extension of the H.264/AVC Standard

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose QoS-constrained peer selection and nondisruptive rate adaptation schemes with considering shared bottleneck problem to provide a stable peer-to-peer live video streaming service during vertical handoff. In the proposed scheme, a QoS-constrained peer is selected by estimating bandwidth with active probing, and a reception rate converges to a stable state without any QoS degradation with help of multi-path handoff. The shared bottleneck problem is addressed by adjusting the estimated bandwidth and yielding the redundant bandwidth usage.