Research On Progressive Transmission For Peer-to-Peer Network In3D Virtual Scene

As an important development direction in future of the Internet,three-dimensional virtual scene has become a new hot spot for the industrydevelopment of the global IT. The part of three-dimensional scene that user can seeshould be promptly downloaded to the local, so that they can real-time roam. Due tosharp increase of the scene size and complexity, and the system user, the contradictionbetween the fast downloading of a mass scene data and limited bandwidth, and thecontradiction between many request from users and the server load have become themain factor to limit its development. Therefore, how to quickly download the scenedata and increase the system capacity becomes the key to the further development ofthree-dimensional virtual scene. This paper has further analysis and research onprogressive transmission and peer-to-peer network.Firstly, an transmission method based on the priority order of the scene object ispresented from the viewpoint of the scene progressive transmission. This paper makesuse of the distance between the object and the viewpoint and the angle of the objectdeviating from the visual vector to obtain the importance of all objects in the area ofinterest, the interest of user is obtained by the statistics of frequency and time thatusers concerned about the object. Then, calculate the priority of the object accordingto the weight formula of the visual importance and the interest of user. The strategythat progressively download and transfer scene data by the priority of the object,reduces the user’s waiting time and realize the timely download of the requirementdata from user.Secondly, a node selection algorithm based on the quality of service is proposedfrom the viewpoint of peer-to-peer network. Compute the quality of service of a nodeby the performance and the data availability, and select the node whice owns the bestquality of service to provide service for user. This algorithm of node selection reducesthe transmission time and the execution time of the data, uses fewer spending, and improves the success rate and the downloading efficiency of the data that user request.Finally, respectively verify the strategy and algorithm through experiments, andthe experimental results show that the transmission strategy based on the objectpriority not only to meet the requirement of the user on the object accuracy and also toreduce the waiting time, and compared with the algorithm of random selection, thenode selection algorithm based on the quality of service has improved performance.