On the Server Placement Problem of P2P Live Media Streaming System

Authors:
Zhijia Chen;Chuang Lin;Hao Yin;Bo Li
Affiliations:
Tsinghua National Laboratory for Information Science and Technology (TNList), Tsinghua University, China;Tsinghua National Laboratory for Information Science and Technology (TNList), Tsinghua University, China;Tsinghua National Laboratory for Information Science and Technology (TNList), Tsinghua University, China;Hong Kong University of Science and Technology,
Venue:
PCM '08 Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Year:
2008

Citing 4
Cited 1

A case for end system multicast (keynote address)

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
An algorithm for finding a K-median in a directed tree

Information Processing Letters - Special issue analytical theory of fuzzy control with applications
An analytical study of peer-to-peer media streaming systems

ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Peer-to-peer live video streaming on the internet: issues, existing approaches, and challenges [Peer-to-Peer Multimedia Streaming]

IEEE Communications Magazine

Content and geographical locality in user-generated content sharing systems

Proceedings of the 22nd international workshop on Network and Operating System Support for Digital Audio and Video

Quantified Score

Hi-index	0.00

Visualization

Abstract

Commercial P2P media streaming systems have widely utilized servers or Content Distribution Networks (CDN) service to help alleviating the effect from high peer dynamics. While refocusing on servers becomes a MUST in large-scale commercial P2P streaming systems, it comes to the problem on how to place server nodes in best efficiency so that they can better serve the needs of peers with minimal cost. In line with this, we formulate the Server Placement (SP) problem in P2P streaming system, and propose solution schemes for the sub-problem of server selection and rate assignment. The server selection problem targets at minimizing the end-to-end user round-trip latency, and traffic transmission cost, which was finally reduced to a P-median problem and solved by Greedy Randomized Adaptive Search Procedure (GRASP). Secondly, we formulate the problem of which clients are served by which server at which rate as the rate allocation problem and optimize to minimize the total streaming cost subject to the play rate requirement. As a starting work, this paper aims to attract more researches on this challenging topic.