The Minimum Server Bandwidth in Peer-Assisted VoD Systems

Author

Lin, Song ; Wu, Jianping ; Xu, Ke ; Ma, Zhen

Author_Institution

Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China

fYear

2010

fDate

2-5 Aug. 2010

Firstpage

1

Lastpage

7

Abstract

Recent years, the wide spread peer-assisted video-on-demand (VoD) systems have generated a great attention on how to optimize these applications. In particular, how to improve the system performance has become a popular issue. In this paper, we propose how to minimize server bandwidth to satisfy user demand in peer-assisted VoD systems. Furthermore, a linear programming method is presented to calculate the optimal value. We carry out extensive simulation to show how the system performance varies with the change of system parameters. Via comparison, we find conventional peer-selection algorithms, the random algorithm and the greedy algorithm do not perform well. Further work is needed in designing better peer selection algorithms.

Keywords

greedy algorithms; linear programming; network servers; video on demand; conventional peer-selection algorithms; greedy algorithm; linear programming method; minimum server bandwidth; optimal value; peer-assisted VoD systems; random algorithm; system performance; Algorithm design and analysis; Bandwidth; Linear programming; Optimal scheduling; Peer to peer computing; Servers; Streaming media;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Communications and Networks (ICCCN), 2010 Proceedings of 19th International Conference on

Conference_Location

Zurich

ISSN

1095-2055

Print_ISBN

978-1-4244-7114-0

Type

conf

DOI

10.1109/ICCCN.2010.5560091

Filename

5560091