Circular node organizing method in reciprocal network request broadcast system

Abstract

This invention discloses a method for organizing ring nodes in the broadcast-selection system of peer-to-peer network flow media including: 1, a newly added node P gets an initial member node list from an index server, 2, P utilizes the initial member node to set up its adjacent nodes and distributes them to the corresponding [l d l / alpha] layer of ring based on the distance from the adjacent node to itself so as to constitute an initial logic ring and form far and near hop neighbor nodes, 3, node P transmits position information to a neighbor node on the ring to inform its existence and receives the forward information from the neighbor node to discover new member nodes to ensure there are k nerghbors in the inner ring and 1 neighbor in the outer ring to maintain a stable ring structure and users can quickly find out the neighbor nodes near the target position when dragging, 4, node P stops the current channel and informs all neighbor nodes on the ring about its leaving.

Description

technical field [0001] The invention belongs to the cross field of distributed processing technology and streaming media technology, and specifically relates to a method for organizing ring nodes in a peer-to-peer network on-demand system, which is suitable for providing high-quality, low-cost, and large-scale streaming media within the scope of a wide area network On-demand service. Background technique [0002] The application of streaming media technology has always been the main way to disseminate multimedia information on the Internet. With the increasing popularity of broadband networks, video-on-demand services, one of the killer applications of the Internet, have attracted widespread attention from academia and business circles. The traditional streaming media on-demand system stores a large amount of media data on a group of centrally managed video servers, and the video server is responsible for responding to all clients' on-demand requests. In this client / server ...

AI Technical Summary

Problems solved by technology

However, since the logical relationship between nodes is random, it is difficult to quickly find new adjacent nodes when a neighboring node leaves or is dragged to a new position

A feasible method is to use a centralized index server to record the location information of all nodes, but when the scale of nodes expands to a certain extent, the index server will easily become the performance bottleneck of the system

Images