Key Technology Research On Interactive Video On Demand In Peer-to-Peer Network

In recent years, with the development of Internet and P2P technology, video-on-demandsystem which lets uses choose interesting video segment to watch at any time based on P2Ptechnology, has been developed rapidly. The key of interactive video-on-demand in P2Pnetwork is how users in the shortest time to find the most wanted resources and can’tsignificantly increase the maintaining overhead.This dissertation takes advantage of vEB tree which has low overhead in querying，inserting and deleting and modifies vEB tree taking into account the network location. Thedissertation proposes a new overlay network-vEB-Mesh. It puts users into different areas.Each area forms a vEB tree structure. Each node within a area maintains extra nodes’ IPaddress of the largest segment on jumping probability, except for maintaining nodes’ IPaddress of the stored sequence of relations, the root chain of relations and the tree of relations.Resource can be found over a hop by adding new additional links rather than more hops. Itadopts the distributed means algorithm proposed by previous scholars to estimate the segmentglobal popularity. This dissertation which considering supply and demand relationship of eachsegment in the network proposes a new storage strategy based on popularity of the segmentfor load balancing. The new arriving node stores segment based on the difference betweendemand and supply by estimating the popularity and the supply rate of every segment. Thegreater the difference is between supply and demand, the greater the probability of new nodesstore the segment. When a node’s buffer is full, the segment needs to be replaced. Thedissertation analyzes the limitations of LRU and LFU in the VoD system, and proposes a newalgorithm LFLRU. Due to the differences of the global popularity and the local popularity, thedissertation which considers video segment local popularity, time interval and accessingfrequency defines a new value indicator of replacement. If a peer takes place replacement,priority to replace the minimum value of the values.Using NS2to do network simulation, simulation results show that the overlay networkproposed in this dissertation reduces the jump delay. Storage strategy and LRLFU algorithmnot only improves hit rate, but also reduces the node query delay.