Admission Control Strategy of Serving Peers in P2P VoD Systems

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.