The Community for Technology Leaders
2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel & Distributed Computing (SNPD 2012) (2012)
Kyoto
Aug. 8, 2012 to Aug. 10, 2012
ISBN: 978-1-4673-2120-4
pp: 49-53
ABSTRACT
Data request task scheduling is one of the important issues for P2P VoD systems. However the existing data scheduling strategies in P2P VoD system is not fair enough. They make many nodes, which upload data actively, bear very heavy load, while those selfish nodes providing no resource sit idle. This paper presents an admission control strategy on serving nodes combining with the incentive mechanism. The serving peers respond the requesting peers that contribute more data to systems with priority and reject some requests which can not be processed in time. The experiments show that this strategy improves the performance of the system and decreases the users' wait time for watching.
INDEX TERMS
peer-to-peer computing, scheduling, telecommunication congestion control, video on demand
CITATION

Y. Zhu, J. Bian, Q. Ji and H. Zhang, "Admission Control Strategy of Serving Peers in P2P VoD Systems," 2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel & Distributed Computing (SNPD 2012)(SNPD), Kyoto, 2012, pp. 49-53.
doi:10.1109/SNPD.2012.95
88 ms
(Ver 3.3 (11022016))