A peer-to-peer assisting scheme for live streaming services

Authors:
Jian Wan;Liangjin Lu;Xianghua Xu;Xueping Ren
Affiliations:
Institute of Software and Intelligent Technology, Hangzhou Dianzi University, Hangzhou, China;Institute of Software and Intelligent Technology, Hangzhou Dianzi University, Hangzhou, China;Institute of Software and Intelligent Technology, Hangzhou Dianzi University, Hangzhou, China;Institute of Software and Intelligent Technology, Hangzhou Dianzi University, Hangzhou, China
Venue:
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Year:
2008

Citing 3
Cited 0

Scalable application layer multicast

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal Video Replication and Placement on a Cluster of Video-on-Demand Servers

ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
SplitStream: high-bandwidth multicast in cooperative environments

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, peer-to-peer approach has emerged as an effective solution for live streaming services. However, some channels may not provide good streaming services due to their less audience, and some peers may receive bad services owning to their relatively narrower bandwidth. To address these issues, we introduce a peer-to-peer inter-channel assisting scheme for live streaming services. In the scheme, the social network theory is employed to construct the inter-channel overlay network. The scope of cooperation is scaled from intrachannel to inter-channel through active assistance and passive assistance. Besides, the relationship in social network works as the incentive mechanism to stimulate the assisting behaviors among peers. Simulations demonstrate that our scheme can promote the cooperation effectively and consequently improve the streaming qualities significantly.