A Unified Framework for Sub-stream Scheduling in P2P Hybrid Streaming Systems and How to Do Better?

Authors:
Zhenjiang Li;Yao Yu;Xiaojun Hei;Danny Hin-Kwok Tsang
Affiliations:
Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology,;Department of Electronics Science and Engineering, Nanjing University,;Department of Electronics and Information Engineering, Huazhong University of Science and Technology,;Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology,
Venue:
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Year:
2009

Citing 6
Cited 1

Introduction to Algorithms

Introduction to Algorithms
Meridian: a lightweight network location service without virtual coordinates

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Towards low-redundancy push-pull P2P live streaming

Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
A Measurement Study of a Large-Scale P2P IPTV System

IEEE Transactions on Multimedia
An Empirical Study of the Coolstreaming+ System

IEEE Journal on Selected Areas in Communications
Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?

IEEE Journal on Selected Areas in Communications

Efficient push-based packet scheduling for Peer-to-Peer live streaming

Cluster Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The pull-push hybrid P2P streaming, as an emerging and promising approach, has achieved some success in delivering live video traffic. The sub-stream scheduling problem is a key design issue in a hybrid system. In this paper, we propose a max-flow model for unifying this sub-stream scheduling problem. We find that the sub-stream scheduling problem in GridMedia, CoolStreaming+ and LStreaming can be formulated into a special case of the proposed max-flow model. We further propose a min-cost flow model to combat peer heterogeneity in scheduling sub-streams. This min-cost flow model is implemented in a prototype system, LStreaming+. The accuracy of the max-flow model and the outstanding performance of LStreaming+ are demonstrated by extensive simulations. We also show that LStreaming+ achieves excellent performance in prototype experiments.