Research And Implementation Of P2P Streaming Media System Node Selection Mechanism

With the rapid development of Internet and information transmission technology, and thedevelopment of broadband network in recent years, the requirements of users on the quality ofservice of streaming media is increasingly higher. Streaming media system based on P2Ptechnology has become the current research hotspot, more and more people are familiar withnetwork television, video conference, distance learning, video on demand and so on, and usethese applications. As far as streaming media system with traditional C/S structure isconcerned， P2P streaming system overcome the server bottleneck problem, greatly reducesdeployment costs and complexity, has no substitute for the advantages in scalability and faulttolerance. Node selection is the core technology and research focus of field of the P2P mediastreaming. Due to the limited service capacity and diversity of P2P nodes，how to select nodeis a difficult problem.This paper fully consider super node, and propose super-node algorithm based onpartition. The partition algorithm will group the nodes of which the physical location areadjacent into the same district, which can effectively reduce the transmission delay betweennodes and nodes. Besides fully considering bandwidth, cpu, memory and other performanceparameters of nodes, and consider the load of the nodes, this paper raises an adaptivesuper-node algorithm. This algorithm adjusts the super node according to the operating statusof the super-node. When the super node is overload, the algorithm automatically updates thesuper-node, which can effectively improve the robustness of the system.This paper studies the service node selection algorithm, and proposes the double-endcooperative node selection algorithm based on the hybrid P2P architecture. The algorithm caneffectively hand out the data request of request node to the nodes that have the requestedresource on the same region or on other regions, which can effectively reduce the pressure ofthe resource server and shorten the data transfer time between nodes. This algorithm canreduce the pressure of backbone network，ensure data continuous transmission and ensure thequality of system servicerequest data requesting node distributed to the same region or other regions of therequested resource node can effectively reduce the pressure of the resource server to shorten the node data transfer time, reduce the pressure of backbone network to ensure datacontinuous transmission, to ensure the system quality of service.This paper also implements available bandwidth measurement algorithm based onself-induced congestion and the bottleneck bandwidth measurement algorithm based onpacket-pair. We have do experiments to validate these two algorithms, and applied them to thesuper-node selection algorithms and the service node selection algorithm, and note next job.