Web 3D virtual scene peer-to-peer transmission data scheduling method and platform

Abstract

The invention relates to a Web 3D virtual scene peer-to-peer transmission data scheduling method and platform; the method is used for realizing data block transmission of node avatars in a virtual scene and comprises the following steps: 1 ) a request node maintains a first queue of data block resources which are ordered from high to low according to the priority of the data blocks in a region ofinterest, and a data block inquiry request is sent to a super node in sequence from the head of the first queue; 2 ) the super node searches for all nodes with corresponding data blocks according to the data block query request, and the node with the minimum total loading pressure of the nodes in all the nodes is used as an optimal download source; 3 ) the request node receives return informationof the super node, and a data block downloading request is sent to the optimal download source based on a self-adaptive request data volume method, a downloading connection is established and the corresponding data block is downloaded. Compared with the prior art, the method in the invention has the advantages of improving data transmission efficiency and improving user roaming experience and thelike.

Description

technical field [0001] The invention relates to a virtual scene data transmission technology, in particular to a Web3D virtual scene peer-to-peer data scheduling method and platform. Background technique [0002] WebVR technology is developing very rapidly. With the help of browsers, it can provide users with a fully immersive virtual interactive world, which provides users with a convenient browsing experience, attracts a large number of Internet users, and is widely used in all aspects of production and life. . Because WebVR applications usually need to process a large amount of scene data and face a large number of users, the bandwidth overhead is relatively large. If the system architecture of the C / S mode is adopted, the system scalability will be limited by the performance of the server, and the system scale and throughput will be limited. The boost comes at the expense of increased hardware investment. P2P technology has proposed a new idea of ​​resource transmissio...

AI Technical Summary

Problems solved by technology

[0005] 1) Insufficient consideration of the characteristics of user scene roaming behavior: because the model distribution characteristics and user behavior characteristics in virtual scene roaming are very distinct, the general data scheduling algorithm does not fully consider these characteristics, and does not analyze the model position, rarity, and user behavior. Factors such as motion status affect transmission efficiency, resulting in low data sharing and poor transmission efficiency

[0006] 2) The filling rate of the frustum is low: the general data scheduling algorithm does not consider the influence of the amount of model data and the size of the volume on the transmission priority, and cannot give priority to the transmission of the user's frustum, which occupies a large volume and a large amount of data. Smaller models, resulting in lower frustum fill rates

[0007] 3) Low node bandwidth utilization: the network bandwidth of user nodes in the network is dynamically changing, and its transmission capacity is also changing in real time

The general data scheduling algorithm does not fully take into account the bandwidth status of user nodes and the impact of hardware capabilities on transmission efficiency, resulting in unbalanced load allocation to nodes and low node bandwidth utilization

Images