CN101924777A - Method, system and equipment for searching active nodes in P2P streaming media system - Google Patents

Method, system and equipment for searching active nodes in P2P streaming media system Download PDF

Info

Publication number
CN101924777A
CN101924777A CN 200910086676 CN200910086676A CN101924777A CN 101924777 A CN101924777 A CN 101924777A CN 200910086676 CN200910086676 CN 200910086676 CN 200910086676 A CN200910086676 A CN 200910086676A CN 101924777 A CN101924777 A CN 101924777A
Authority
CN
China
Prior art keywords
node
candidate nodes
piece
sub
tracker
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN 200910086676
Other languages
Chinese (zh)
Other versions
CN101924777B (en
Inventor
张云飞
邓光青
彭晋
段晓东
魏冰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Mobile Communications Group Co Ltd
Original Assignee
China Mobile Communications Group Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Mobile Communications Group Co Ltd filed Critical China Mobile Communications Group Co Ltd
Priority to CN 200910086676 priority Critical patent/CN101924777B/en
Priority to PCT/CN2010/000863 priority patent/WO2010145199A1/en
Priority to US13/378,982 priority patent/US8762461B2/en
Publication of CN101924777A publication Critical patent/CN101924777A/en
Application granted granted Critical
Publication of CN101924777B publication Critical patent/CN101924777B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Information Transfer Between Computers (AREA)
  • Computer And Data Communications (AREA)

Abstract

The invention discloses a method for searching active nodes in a P2P streaming media system. The method comprises the following steps: simply and efficiently reporting self-subblock information, such as the number of continuous subblocks of a cache, the serial number of the first subblock in the continuous subblocks, the total number of the subblocks of the cache and the like to a tracking device by selective nodes; and when the tracking device selects appropriate candidate nodes for a request node, using the subblock information of the selective nodes to select the candidate nodes meeting the requirements of predetermined conditions, and indicating the request node to determine at least one candidate node as the active node from the candidate nodes. By the invention, the selective nodes can report complete subblock information to the tracking device through less bytes to further select the appropriate candidate nodes, thus ensuring that the request node can determine the active nodes without the need of sending a great amount of detection to the candidate nodes, avoiding the waste of communication resources and reducing bandwidth consumption. The invention also discloses a system and equipment for finding the active nodes in the P2P streaming media system.

Description

In the P2P stream media system, search method, system and the equipment of active node
Technical field
The present invention relates to the P2P technology, relate in particular to a kind of method, system and equipment of in the P2P stream media system, searching active node.
Background technology
It is point-to-point that (Peer-to-Peer, P2P) system becomes the ideal platform of carrying out streaming media service with its good extensibility, robustness.In P2P (Tracker-based P2P) system, there is a large amount of tracing equipment (Tracker) based on tracing equipment, at different broadcasting channels, nodal informations such as the IP addresses of nodes that each Tracker buffer memory is relevant with corresponding data, port, the node that newly adds the P2P stream media system also need to report to Tracker nodal informations such as its own IP address, port.
The node that has added the P2P stream media system can be to Tracker sending node list request (Peerlistrequest), and data download from other nodes is wished in expression.The node that sends the Peerlist request is referred to as requesting node, is referred to as active node for this requesting node provides the node of data download.In existing Tracker-based P2P system, the process that requesting node is searched active node mainly comprises the steps: as shown in Figure 1
The first step: requesting node (Peer_1) sends the Peerlist request to Tracker, and Tracker selects a plurality of nodes according to the nodal information of buffer memory, and after the nodal information of a plurality of nodes that will select writes Peerlist and tabulate, returns to requesting node.
In this step, Tracker can determine corresponding node according to the nodal information of buffer memory, and therefrom selects the node of some at random, and also principle that can be approaching according to the geographical position is selected and the more approaching node in requesting node position.For example, if determine that according to the IP address of requesting node the requesting node attributed region is the Beijing area, then Tracker can be the node of Beijing area according to the IP address choice attributed region of buffer memory, as selecting Peer_2, Peer_3, Peer_4 and Peer_5 among Fig. 1.
Second step: after requesting node received the Peerlist tabulation, the node in the Peerlist tabulation sent detection information, to determine active node.
In the P2P stream media system, a played file is divided into the experimental process piece, and played file is that the unit transmits between node with sub-piece, and node is represented the situation of the sub-piece of self buffer memory by bit diagram (bitmap).Each bit among the bitmap is corresponding with a sub-piece, if nodal cache certain height piece, the bit position corresponding with this sub-piece is changed to " 1 " among the bitmap so; Otherwise this bit position is " 0 ".In this step, the requesting node at first a certain node in the Peerlist tabulation sends detection information, send detection information as Peer_1 to Peer_2, the concatenation ability of inquiry Peer_2, and when Peer_2 has the ability active node as Peer_1, exchange the bitmap of self between Peer_1 and Peer_2, know the situation of the sub-piece of the other side's buffer memory.Can Peer_2 offer Peer_1 according to the sub-piece of the bitmap judgement that receives self buffer memory, if can, then send success response information to Peer_1, become the active node of requesting node; Otherwise, send failure response information to Peer_1.
In addition, the node in requesting node and Peerlist tabulation exchange Peerlist is mutually tabulated, and is used to enlarge the hunting zone of active node.
By above two steps, requesting node has been finished the search procedure to active node, and then can carry out for the 3rd step: requesting node Peer_1 prepares displaying video from active node Peer_2 data download.
In existing Tracker-based P2P system, search under the mode of active node, because Tracker only knows in optional each node, nodal informations such as each IP addresses of nodes, port, therefore, node may be the less node of available sub-piece of buffer memory in the Peerlist tabulation, cause requesting node needs each node transmission detection information in tabulation respectively, cause requesting node may need to take the suitable active node of mass communication resource lookup, the waste communication resource.
Summary of the invention
The embodiment of the invention provides a kind of method, system, Tracker equipment and node device of searching active node in the P2P stream media system, to solve in searching the process of active node, because the node that Tracker selects may be the less node of available sub-piece of buffer memory, cause requesting node in the Peerlist tabulation, to send detection information to search suitable active node by each node, cause the problem of communication resource waste.
A kind of method of searching active node in the P2P stream media system reports the sequence number of first sub-piece in the number of continuous sub-piece of buffer memory and the described continuous sub-piece by optional node to tracing equipment Tracker;
Described method of searching active node comprises:
After Tracker receives the node listing request of requesting node transmission, initial sub-piece sequence number according to the requesting node data to be downloaded that comprise in the node listing request, select a plurality of optional nodes as both candidate nodes, wherein, in the both candidate nodes buffer memory the initial sub-piece of described data to be downloaded;
Tracker returns to requesting node with the nodal information of both candidate nodes by node listing, and indication described request node determines that according to the nodal information in the node listing at least one both candidate nodes is as active node.
A kind of system of in the P2P stream media system, searching active node, described system comprises requesting node, optional node and Tracker, wherein:
Optional node is used for reporting the number of continuous sub-piece of buffer memory and the sequence number of first sub-piece of described continuous sub-piece to Tracker;
Requesting node is used for to Tracker sending node list request, and the nodal information in the node listing that returns according to Tracker, determines that at least one both candidate nodes is as active node;
Tracker, be used for after receiving the node listing request, initial sub-piece sequence number according to the requesting node data to be downloaded that comprise in the node listing request, select a plurality of optional nodes as both candidate nodes, wherein, in the both candidate nodes buffer memory the initial sub-piece of described data to be downloaded, and the nodal information of the both candidate nodes selected returned to requesting node by node listing.
A kind of tracing equipment is applied in the P2P stream media system, and described tracing equipment comprises:
The request receiver module is used for the receiving node list request, the initial sub-piece sequence number of the requesting node data to be downloaded that comprise in the described node listing request;
Information receiving module is used for receiving the number of continuous sub-piece of the buffer memory that optional node reports and the sequence number of first sub-piece of described continuous sub-piece;
First selects module, is used for the initial sub-piece sequence number according to data to be downloaded, selects a plurality of optional nodes as both candidate nodes, wherein, in the both candidate nodes buffer memory the initial sub-piece of described data to be downloaded;
The tabulation sending module, the nodal information that is used for the both candidate nodes that will select returns to requesting node by node listing.
A kind of node device, described node device comprises:
The information reporting module is used for reporting the number of continuous sub-piece of buffer memory and the sequence number of first sub-piece of described continuous sub-piece to Tracker;
Data outputting module is used for uploading data to other node devices according to the request of other node devices.
Because among the present invention program, Tracker receives the sequence number of first sub-piece in the number of continuous sub-piece of optional node buffer memory and the described continuous sub-piece in advance, the information that makes Tracker take a few bytes by reception just can be known the available sub-block message of optional node, and then when selecting both candidate nodes according to the initial sub-piece sequence number of the data to be downloaded of requesting node request, the initial sub-piece of buffer memory data to be downloaded in the both candidate nodes that guarantees to select, therefore, requesting node is when determining active node from both candidate nodes, need not to survey the initial sub-piece sequence number that whether has data to be downloaded to each both candidate nodes, avoid the waste of the communication resource, reduced bandwidth consumption.
Description of drawings
Fig. 1 is the existing active node schematic diagram of searching;
Fig. 2 is for searching the method schematic diagram of active node in the P2P stream media system in the embodiment of the invention one;
Fig. 3 is a node bitmap schematic diagram in the embodiment of the invention;
The system schematic of Fig. 4 for searching active node in the P2P stream media system in the embodiment of the invention five;
Fig. 5 is a tracing equipment schematic diagram in the embodiment of the invention six;
Fig. 6 is a node device schematic diagram in the embodiment of the invention seven.
Embodiment
In order to realize the object of the invention, the present invention transforms optional node in the system and Tracker, make optional node report the availability information of the sub-piece of self buffer memory to Tracker, Tracker is after the node listing request that receives the requesting node transmission, be not blindly with the optional node in the system as the alternative active node of requesting node, but optional node is selected according to the availability information of the sub-piece of optional node buffer memory, the sub-piece that the nodal cache requesting node that assurance is selected is badly in need of most, thereby eliminated requesting node and determined by the transmission of the node in Peerlist probe message whether the node among the Peerlist has the process of the sub-piece of being badly in need of most, avoid the waste of the communication resource, reduced bandwidth consumption.
The Tracker that relates in the embodiment of the invention can be an improved equipment on the basis of existing Tracker, also can be the equipment with correlation function of embodiment of the invention needs.
Below in conjunction with Figure of description the embodiment of the invention is described in detail.
As shown in Figure 2, for searching the method step schematic diagram of active node in the embodiment of the invention one, said method comprising the steps of:
Step 101: optional node reports the sequence number of first sub-piece in the number of continuous sub-piece of self buffer memory and the described continuous sub-piece to Tracker.
The node of current access Tracker can be used as optional node.
Optional node in the P2P system needs periodically or reports to Tracker in real time the relevant information of the sub-piece of self buffer memory, as report the position of each sub-piece of self buffer memory, just reporting at which to be " 1 " in the bit position of sub-piece correspondence constantly, is " 0 " in the bit position of which sub-piece correspondence of the moment.But, consider when full detail with the bit position reports Tracker and need take a large amount of bytes, consume too much resource, therefore, in the embodiment of the invention one, optional node reports Tracker with the sequence number of first sub-piece in the number of the continuous sub-piece of self buffer memory and the described continuous sub-piece.
As shown in Figure 3, be respectively the bitmap schematic diagram of requesting node and some optional nodes in the embodiment of the invention, suppose that two width of cloth bitmap schematic diagrames are at same time period of same played file.
As can be seen from Figure 3, there is one section continuous sub-piece in optional node, and its number is designated as Counter_One, and quantity is that the sequence number of 10, the first sub-pieces is represented with Offset_One, and the sequence number in Fig. 3 is the t1 moment.If the offset of optional sub-piece Bitmap takies 4 bytes, Counter_One takies 2 bytes, then only needs 6 bytes just can report the continuous sub-block message of self to Tracker.
Step 102: requesting node inserts Tracker, and to Tracker sending node list request.
Requesting node in the present embodiment can be the node of current access Tracker, also can need to redefine the node of active node.
Comprise the sub-piece that requesting node is badly in need of most in the node listing request, the described sub-piece of being badly in need of most can be in the not played data of buffer memory in the requesting node, and first bit position is 0 sub-piece.Because the bit position is a not buffer memory of 0 this sub-piece of expression, therefore, the sub-piece of being badly in need of most can be regarded as the initial sub-piece of data to be downloaded.The sequence number of the initial sub-piece of data to be downloaded can be represented with Offset_Zero.
Simultaneously, requesting node can also report the information of the sub-piece of self buffer memory to Tracker, as the number of the continuous sub-piece of self buffer memory and as described in the sequence number of first sub-piece in the continuous sub-piece.
Because the information of having preserved the sub-piece of each optional node buffer memory among the Tracker, therefore, the both candidate nodes when the optional sub-piece that the follow-up sub-block message that can select buffer memory satisfies the demands is selected active node as requesting node.
Step 103:Tracker selects to satisfy a plurality of both candidate nodes of alternative condition from optional node.
Alternative condition comprises: in the both candidate nodes buffer memory the initial sub-piece of described data to be downloaded.
The concrete selection mode of this step can for:
At first, Tracker determines that according to the sequence number of first sub-piece in the number of known continuous sub-piece and the described continuous sub-piece which the bit position in the optional node is " 1 ".
Then, the sub-piece of buffer memory in the optional node and the initial sub-piece of data to be downloaded are compared the initial sub-piece of data to be downloaded of having judged in which optional node buffer memory.
At last, Tracker according to comparative result find out buffer memory the optional node of initial sub-piece of described data to be downloaded as both candidate nodes.
It still is example with Fig. 3, in the requesting node data in buffer, first bit position is that 0 sub-piece is sub-piece t3, first sub-piece that the expression requesting node lacks is that sequence number is the sub-piece of t3, therefore, Tracker has determined optional node buffer memory among Fig. 3 t3 piece constantly, so this optional node can be used as both candidate nodes, at this moment, the candidate who selects can provide the sub-piece that needs to requesting node.
Reasonable in order to guarantee the both candidate nodes number that Tracker selects, can either make requesting node correctly determine active node according to Peerlist, be unlikely to again because the both candidate nodes number too much causes bandwidth consumption excessive, therefore, the maximum that can determine the both candidate nodes number according to the physical condition or the empirical value of current bandwidth.If the both candidate nodes number that Tracker selects according to alternative condition is greater than maximum, then the both candidate nodes of selecting is further selected, guarantee that the both candidate nodes number of further picking out is not more than maximum, for example: can make the both candidate nodes number that further filters out equal maximum.
Step 104:Tracker returns to requesting node with the nodal information of the both candidate nodes of selection by node listing.
Step 105: after requesting node receives described node listing, determine that according to the nodal information in the node listing at least one both candidate nodes is as active node.
Because in step 103, for condition candidate subchunk is selected according to " the initial sub-piece of the described data to be downloaded of buffer memory in the both candidate nodes ", therefore, requesting node can be confirmed the sub-piece that all both candidate nodes can both provide to be needed, reduce the information interaction in the active node deterministic process, reduced the wasting of resources.
In the present embodiment, requesting node can be determined a plurality of active nodes according to the nodal information among the Peerlist, the purpose of doing like this is in order to improve the reliability of system, make to go wrong to continue as requesting node service is provided the time when some active nodes that data are provided for requesting node that requesting node can be set up being connected of transfer of data with other definite active nodes apace.Because at short notice, the network state of other active nodes changes may be less, therefore, goes wrong and become possibility as the backup active node for requesting node provides data by other active nodes at an active node.But, if variation has taken place the network state of other active nodes, then no longer being suitable as the active node of requesting node, requesting node need be carried out the step of the embodiment of the invention one once more, reselects active node.
Scheme by the embodiment of the invention one, because the sub-piece that Tracker is badly in need of according to the cache request node most is that condition is selected, make the both candidate nodes of selecting to provide the sub-piece that needs to requesting node, that is to say that the both candidate nodes of selecting can be used as the active node of requesting node, after the requesting node node receives Peerlist, can determine therefrom that at least one node is as active node.Reduce the information interaction that the requesting node node corresponding with nodal information among the Peerlist carries out, simplified the troublesome operation of node side.
Embodiment two:
Be provided for data downloaded in order to make definite active node that requesting node can be continuously within a certain period of time, embodiment two is on the basis of embodiment one, alternative condition in the step 103 is set to: in the both candidate nodes buffer memory the initial sub-piece of described data to be downloaded, and the number of the continuous sub-piece of the data to be downloaded of preserving is greater than first threshold.The continuous sub-piece of preserving data to be downloaded in the both candidate nodes here is: after the initial sub-piece of data to be downloaded and the continuous sub-piece adjacent with initial sub-piece.
Concrete selection course is as follows:
At first, select both candidate nodes according to the mode of step 103;
Then, Tracker is according to the position of initial sub-piece in both candidate nodes of data to be downloaded, determines after the initial sub-piece of data to be downloaded and the number of the continuous sub-piece adjacent with initial sub-piece.
Then, the number and the first threshold of the continuous sub-piece of the data to be downloaded that Tracker will determine compare, and whether the number of continuous sub-piece of judging data to be downloaded is greater than first threshold.
The first threshold here can be as required both candidate nodes continuously on requesting node the number of carrier piece determine.For example: require both candidate nodes can upload 3 sub-pieces to requesting node continuously at least, then first threshold can be set to 3.
At last, Tracker selects the number of continuous sub-piece of data download greater than the both candidate nodes of first threshold.
It still is example with Fig. 3, Tracker determines that the initial sub-piece of data to be downloaded is a t3 piece, then inquire about and whether have the continuous sub-piece that comprises t3 piece in the optional node, in Fig. 3, optional node exists in one section continuous sub-piece and comprises t3 piece, and in same continuous sub-piece, also there are 7 continuous sub-pieces after the t3.Suppose that the first threshold of setting in the present embodiment two is 3, optional node then shown in Figure 3 can satisfy the alternative condition of embodiment two.
If it is more to determine to satisfy the both candidate nodes number of present embodiment two alternative conditions, as greater than maximum, then therefrom the selection portion partial node is as the node that writes Peerlist, and the process of concrete selection portion partial node is as follows:
At first according to the descending order of number of the continuous sub-piece of data to be downloaded, the both candidate nodes of selecting is sorted, select to come the both candidate nodes of top n then, described N is positive integer and is not more than maximum.The continuous sub-piece of the data download of the feasible both candidate nodes of selecting is more than unselected, and guaranteeing provides data as much as possible for requesting node.
In the scheme of present embodiment two, because the initial sub-piece of data to be downloaded is in one section continuous sub-piece in the both candidate nodes, and in continuous sub-piece, sub-piece number after the initial sub-piece of data to be downloaded is more, make that can also be continuously requesting node in a period of time at the definite active node of requesting node provides data downloaded, improved the stability of system, the data that the active node of having avoided requesting node to find out can provide are limited, cause requesting node to search the problem of active node continually, alleviated communication pressure effectively.
Embodiment three:
The embodiment of the invention three can propose on the basis of embodiment one or embodiment two further: require to preserve the total number of sub-piece of data to be downloaded greater than second threshold value in the final both candidate nodes of selecting.
The method of the embodiment of the invention three may further comprise the steps:
The first step: optional node reports the total number information of sub-piece of self buffer memory to Tracker.
In the present embodiment, optional node in the P2P system needs periodically or in real time to report the total number of the sub-piece of self buffer memory to Tracker, total number information here can be the sub-number of blocks of real cache, also can be initial sub-piece all sub-numbers of blocks afterwards of data to be downloaded.
Step 101 among this step and the embodiment one can be carried out simultaneously, being optional node reports the continuous sub-block message and the sub-piece sum information of self buffer memory to Tracker, also can be only report wherein partial information, or report above-mentioned information respectively in the different moment to Tracker.
Second step: requesting node inserts Tracker, and to Tracker sending node request list, comprises the initial sub-block identification of requesting node data to be downloaded in the described node listing request.
This step is identical with step 102 among the embodiment one.
The 3rd step: Tracker selects to satisfy a plurality of both candidate nodes of alternative condition from optional node.
Alternative condition comprises at least: in the both candidate nodes buffer memory the initial sub-piece of data to be downloaded; After the initial sub-piece of data to be downloaded and adjacent continuous sub-piece number greater than first threshold; Preserve the total number of sub-piece of data to be downloaded in the both candidate nodes greater than second threshold value.
The second threshold value here number of both candidate nodes carrier piece on requesting node as required determines that the second threshold value setting is big more, expression can be on requesting node the number of carrier piece many more.
Concrete selection mode is:
At first, tentatively determine both candidate nodes according to the scheme of embodiment one and/or embodiment two.
Then, Tracker determines the number of initial sub-piece all sub-pieces afterwards of data to be downloaded according to the position of initial sub-piece in the preliminary both candidate nodes of determining of data to be downloaded.
At last, the number of all sub-pieces that Tracker will determine and second threshold value compare, and select the both candidate nodes of the number of sub-piece greater than second threshold value.
Be example with Fig. 3 still, in optional node, also be cached with 11 sub-pieces after the t3 piece, if second threshold value is 10, then this optional node can satisfy the alternative condition of present embodiment four, can become both candidate nodes.The total number of sub-piece of representing buffer memory in the optional node in the present embodiment with F, if F takies 2 bytes, then optional node only need report F information promptly can inform the information of the sub-piece of self buffer memory to Tracker.
Can finish the selection both candidate nodes process of the alternative condition that utilizes embodiment three in the 3rd step by following two formula:
Offset_One≤Offset_Zero≤Offset_One+Counter_One (1)
V=Counter_One-(Offset_Zero-Offset_One) (2)
Wherein: the sub-piece that formula (1) expression requesting node is badly in need of most is arranged in one section continuous sub-piece of optional node, and the sub-number of blocks that formula (2) expression optional node can provide continuously for requesting node is V, and wherein, V is equal to or greater than the first threshold of setting.
If above formula (1) is set up, Tracker can further select the optional node of F greater than second threshold value from the both candidate nodes that above-mentioned two formula are determined; If formula (1) is false, Tracker can directly select the optional node of F greater than second threshold value.
The nodal information of the both candidate nodes that the alternative condition during the 4th step: Tracker will go on foot by the 3rd is selected sends to requesting node by Peerlist.
The 5th step: requesting node can be determined at least one active node according to the Peerlist that receives.
If it is more to determine to satisfy the both candidate nodes number of present embodiment three alternative conditions, greater than maximum, then therefrom the selection portion partial node is as the node that writes Peerlist, and the process of concrete selection portion partial node is as follows:
At first, the both candidate nodes of selecting is sorted according to the descending order of the total number of sub-piece of data to be downloaded, M both candidate nodes before selecting then to come, described M is positive integer and is not more than maximum.The total number of sub-piece of the data download of the both candidate nodes of selecting is more than unselected, and guaranteeing provides data as much as possible for requesting node.
In the scheme of present embodiment three, because the total number of sub-piece of the data to be downloaded of the both candidate nodes buffer memory of finally selecting is more, can be on the basis of embodiment three, determine that further the both candidate nodes of selecting can provide data as much as possible for requesting node, reduce the number of times of requesting node inquiry active node as far as possible.
Embodiment four:
Optional node can also comprise the relevant information that the connected node number is whether saturated in the information that Tracker reports, then Tracker can select the unsaturated both candidate nodes of connected node number on the basis of embodiment one to embodiment three arbitrary embodiment.
The scheme of embodiment four is as follows:
The first step: whether saturated optional node report self connected node number information to Tracker.
This step can be carried out with the step 101 of embodiment one and the first step of embodiment three, also can carry out respectively.
Described connected node number is meant other node numbers of obtaining data from optional node.That is to say when calculating the connected node number of optional node, but whether other node numbers that a consideration connected when waiting node as active node are saturated, other node numbers that connect when not considering optional node from other node data download.
In the scheme of the embodiment of the invention four, whether optional node can periodically notify the connected node number of self saturated behind login Tracker, and concrete advice method includes but not limited to following dual mode:
First kind of mode: optional node can periodically report the connection sign of self to Tracker, be designated as Connection_Flag, described connection sign represents whether this optional node can also provide data to other node, and just whether the connected node number is saturated.
If the connected node number of a certain optional node has been able to the maximum node number that connects, just Connection_Flag is changed to " down ", the connected node number of representing this optional node is saturated, can not provide data to download to other node again; Otherwise, Connection_Flag is changed to " up ", represent the connected node number unsaturation of this optional node, can also provide data to other node.When making Tracker determine that optional node connected node number is whether saturated by the manner, only need the Connection_Flag of a byte of transmission between node and the Tracker, therefore, the Internet resources that take are less.
The second way: optional node when inserting Tracker, the maximum node number that notice Tracker self can connect.In subsequent process, optional node periodically reports the node number that self has connected to Tracker.Tracker judges the maximum node the number whether current node number that has connected of optional node can connect less than optional node, if then represent the connected node number unsaturation of optional node; Otherwise the connected node number of expression optional node is saturated.
Second step: requesting node inserts Tracker, and to Tracker sending node list request, comprises the initial sub-block identification of requesting node data to be downloaded in the described node listing request.
This step is identical with step 102.
The 3rd step: Tracker selects to satisfy a plurality of both candidate nodes of alternative condition from the node of determining.
Alternative condition can be in embodiment one to embodiment three increases on the basis of any embodiment again: the connected node number unsaturation of both candidate nodes.
The 4th step: Tracker returns to requesting node with the nodal information of the both candidate nodes of selection by node listing.
Because in the 3rd step, whether screen according to the connected node number by saturated condition to the node that inserts for Tracker, and therefore, in this step, the both candidate nodes of the nodal information correspondence in the node listing all has the ability that is connected with requesting node.
If the both candidate nodes number that Tracker selects according to the alternative condition in the 3rd step is greater than maximum, then the both candidate nodes of selecting is further screened, guarantee that the both candidate nodes number that further filters out is not more than maximum, for example: can make the both candidate nodes number that further filters out equal maximum.
The 5th step: after requesting node receives described node listing, determine that according to the nodal information in the node listing at least one both candidate nodes is as active node.
In this step, each both candidate nodes that requesting node needn't be in node listing sends and is used to determine whether that the detection information with concatenation ability just can determine the active node that at least one can provide the data of requesting node needs.
Scheme by the embodiment of the invention four, whether saturated condition is screened according to the connected node number to the optional node in the system owing to Tracker, make the both candidate nodes of selecting have other node capacity of connection, therefore improved the utilance of Tracker, for requesting node provides accuracy higher Peerlist tabulation; Simultaneously,, therefore, reduced the information interaction quantity between requesting node and the both candidate nodes, reduced network bandwidth consumption because requesting node need not whether have other node capacity of connection to the both candidate nodes inquiry again.
By the scheme of the embodiment of the invention,, the both candidate nodes of selecting can be connected with requesting node because Tracker not only screens according to the undersaturated condition of connected node number of both candidate nodes the optional node in the system; Simultaneously because in the scheme of embodiment one to embodiment three any embodiment, the sub-piece be badly in need of most of requesting node that required the both candidate nodes buffer memory, therefore both candidate nodes can be as the active node of requesting node, omitted the step that the requesting node node corresponding with nodal information among the Peerlist carries out information interaction, determines active node by exchange bitmap, greatly reduced message transmission quantity, it is definite to make existing two steps determine that the mode of active node becomes a step, has simplified the troublesome operation of node side.
In the scheme of the embodiment of the invention one to four, each optional node can be periodically reports information after self bitmap being simplified, processes to Tracker, and these information include but not limited to one or more combinations in the following information: the bit bit-identify is the number F of " 1 " among the offset_one of Connection_Flag, Bitmap, Counter_One and the Bitmap.The information that the Tracker basis receives is determined the sub-bulk state of buffer memory in each optional node, and then selects suitable both candidate nodes according to the alternative condition that relates among the embodiment one to embodiment four.
The present invention does not limit the byte number that these information take, and for example: can set Connection_Flag and take 1 byte, the offset of Bitmap takies 4 bytes, and Counter_One takies 2 bytes, and F takies 2 bytes.
Related separately to following four kinds of alternative conditions of selecting both candidate nodes in various embodiments of the present invention:
1, the connected node number unsaturation of both candidate nodes, described connected node number are to obtain other node numbers of data from both candidate nodes.
2, in the both candidate nodes buffer memory the initial sub-piece of the data to be downloaded that comprise in the described node listing request.
3, preserve the number of continuous sub-piece of data to be downloaded in the both candidate nodes greater than first threshold.
Distinguishingly, in both candidate nodes buffer memory during the initial sub-piece of the data to be downloaded that comprise in the described node listing request, the continuous sub-piece of preserving data to be downloaded in the both candidate nodes is: after the initial sub-piece of data to be downloaded and the continuous sub-piece adjacent with initial sub-piece.
4, preserve the total number of sub-piece of data to be downloaded in the both candidate nodes greater than second threshold value.
Distinguishingly, in both candidate nodes buffer memory during the initial sub-piece of the data to be downloaded that comprise in the described node listing request, the sub-piece of preserving data to be downloaded in the both candidate nodes is: the sub-piece after the initial sub-piece of data to be downloaded.
Embodiment one selects both candidate nodes according to the 2nd alternative condition; Embodiment two is according to the 2nd and the 3rd alternative condition selection both candidate nodes; Embodiment three is according to the 2nd, the 3rd and the 4th alternative condition selection both candidate nodes; Embodiment four is according to the 1st, the 2nd the 3rd and the 4th alternative condition selection both candidate nodes.Except the scheme of the embodiment of the invention one to four record, the present invention also is not limited to only select both candidate nodes, only select both candidate nodes or only select both candidate nodes according to the 1st alternative condition according to the 4th alternative condition according to the 3rd alternative condition, and other modes with above-mentioned 4 alternative conditions combination are selected both candidate nodes.
For example: select both candidate nodes: Tracker further to select the both candidate nodes that at least one satisfies the 3rd alternative condition from the both candidate nodes that satisfies the 1st alternative condition according to the 1st and the 3rd alternative condition, wherein: the number that satisfies the 3rd alternative condition and be the continuous sub-piece of preserving data to be downloaded in the both candidate nodes is greater than first threshold.Here, the continuous sub-piece of preserving data to be downloaded in the both candidate nodes can comprise the initial sub-piece of data to be downloaded, also can not comprise the initial sub-piece of data to be downloaded.
Select both candidate nodes: Tracker further to select the both candidate nodes that at least one satisfies the 4th alternative condition from the both candidate nodes that satisfies the 1st alternative condition according to the 1st and the 4th alternative condition, wherein: satisfying the 4th alternative condition is to preserve the total number of sub-piece of data to be downloaded in the both candidate nodes greater than second threshold value.Here, the sub-piece of preserving data to be downloaded in the both candidate nodes can comprise the initial sub-piece of data to be downloaded (just embodiment two, three or four scheme), the initial sub-piece that also can not comprise data to be downloaded, if do not comprise the initial sub-piece of data to be downloaded, the sub-piece of then preserving data to be downloaded in the both candidate nodes here is meant the total sub-piece of both candidate nodes, does not refer in particular to the initial sub-piece piece afterwards of data to be downloaded.
Select both candidate nodes according to the 1st, the 2nd and the 4th alternative condition: in the both candidate nodes number that satisfies the 1st and the 2nd alternative condition when being a plurality of, Tracker therefrom further selects at least one both candidate nodes that satisfies the 4th alternative condition, and wherein: satisfying the 4th alternative condition is: preserve the total number of sub-piece of data to be downloaded in the both candidate nodes greater than second threshold value.Distinguishingly, the sub-piece of preservation data to be downloaded is in the both candidate nodes: the sub-piece after the initial sub-piece of data to be downloaded.
Select both candidate nodes according to the 1st, the 3rd and the 4th alternative condition: in the both candidate nodes number that satisfies the 1st and the 3rd alternative condition when being a plurality of, Tracker therefrom further selects at least one both candidate nodes that satisfies the 4th alternative condition, and wherein: satisfying the 4th alternative condition is: preserve the total number of sub-piece of data to be downloaded in the both candidate nodes greater than second threshold value.The sub-piece of preserving data to be downloaded in the both candidate nodes can comprise the initial sub-piece (scheme of embodiment four just) of data to be downloaded, the initial sub-piece that also can not comprise data to be downloaded, if do not comprise the initial sub-piece of data to be downloaded, the sub-piece of then preserving data to be downloaded in the both candidate nodes here is meant the total sub-piece of both candidate nodes, does not refer in particular to the initial sub-piece piece afterwards of data to be downloaded.
After requesting node is determined active node, can point out the data that download needs from active section.After the active node of determining lost efficacy, requesting node will be again to Tracker sending node list request, to obtain new active node tabulation.
In embodiments of the present invention, Tracker is after receiving the node listing request that requesting node sends, can be in advance according to IP addresses of nodes, select the approaching node of physical address and requesting node (as economizing or same country, or the geographical position difference is less than the node of fixed value) after, utilize the alternative condition of the embodiment of the invention further therefrom to select both candidate nodes again.
Belong under the same inventive concept with the inventive method embodiment, the embodiment of the invention five also provides a kind of system of searching active node in the P2P stream media system, as shown in Figure 4, described system comprises requesting node 11, optional node 12 and Tracker13, wherein:
Requesting node 11 is used for to Tracker13 sending node list request, and the nodal information in the node listing that returns according to Tracker13, determines that at least one both candidate nodes is as active node; Optional node 12 is used for reporting the number of continuous sub-piece of buffer memory and the sequence number of first sub-piece of described continuous sub-piece to Tracker13; Tracker13 is used for after receiving the node listing request, initial sub-piece sequence number according to the requesting node data to be downloaded that comprise in the node listing request, select a plurality of optional node 12 as both candidate nodes, wherein, in the both candidate nodes buffer memory the initial sub-piece of described data to be downloaded, and the nodal information of the both candidate nodes selected returned to requesting node 11 by node listing.
Tracker12 also is used for further filtering out the number of continuous sub-piece of buffer memory greater than the both candidate nodes of first threshold from both candidate nodes, and the nodal information of the both candidate nodes that will further filter out returns to requesting node 11 by node listing, and described continuous sub-piece is meant: after the initial sub-piece of described data to be downloaded and the continuous sub-piece adjacent with initial sub-piece.
Described optional node 12 also is used for reporting to Tracker13 the total number information of sub-piece of buffer memory; Then Tracker13 also is used for further filtering out the both candidate nodes of the total number of sub-piece of buffer memory greater than second threshold value from both candidate nodes, and the nodal information of the both candidate nodes that will further filter out returns to requesting node 11 by node listing, and the sub-piece of buffer memory is meant in the described both candidate nodes that further filters out: all the sub-pieces after the initial sub-piece of data to be downloaded.
Whether saturated described optional node 11 also be used for reporting connected node number information to Tracker13, or the node number that has connected and the maximum node number that can connect, described connected node number is meant: other node numbers of obtaining data from optional node; Then Tracker13 also is used for further filtering out the unsaturated both candidate nodes of connected node number from both candidate nodes, and the nodal information of the both candidate nodes that will further filter out returns to requesting node 11 by node listing.
Tracker13 also is used in the both candidate nodes number during greater than maximum, the both candidate nodes of selecting is selected once more, and the nodal information of the both candidate nodes after will selecting once more returns to requesting node 11 by node listing, and described both candidate nodes number after selecting once more is not more than maximum.
Comprise at alternative condition: the number of the continuous sub-piece of buffer memory is during greater than first threshold, Tracker13 also is used in the both candidate nodes number that further filters out during greater than maximum, the descending order of number according to the continuous sub-piece of data to be downloaded, both candidate nodes is sorted, select the top n both candidate nodes once more, and the nodal information of the N that will select an once more both candidate nodes returns to requesting node 11 by node listing, and described N is positive integer and is not more than maximum.
Also comprise at alternative condition: when the total number of sub-piece of preservation data to be downloaded is greater than second threshold value in the both candidate nodes, Tracker13 also is used in the both candidate nodes number of selecting during greater than maximum, the descending order of the total number of sub-piece according to data to be downloaded, the both candidate nodes of selecting is sorted, M both candidate nodes before selecting once more, and the nodal information of the M that will select an once more both candidate nodes returns to requesting node 11 by node listing, and described M is positive integer and is not more than maximum.
The embodiment of the invention six also provides a kind of tracing equipment, be applied in the P2P stream media system, as shown in Figure 5, described tracing equipment comprises request receiver module 21, information receiving module 22, the first selection module 23 and tabulation sending module 24, wherein: request receiver module 21 is used for the receiving node list request, the initial sub-piece sequence number of the requesting node data to be downloaded that comprise in the described node listing request; Information receiving module 22 is used for receiving the number of continuous sub-piece of the buffer memory that optional node reports and the sequence number of first sub-piece of described continuous sub-piece; First selects module 23 to be used for initial sub-piece sequence number according to data to be downloaded, selects a plurality of optional nodes as both candidate nodes, wherein, in the both candidate nodes buffer memory the initial sub-piece of described data to be downloaded; The nodal information that tabulation sending module 24 is used for the both candidate nodes that will select returns to requesting node by node listing.
Described first selects the number of continuous sub-piece that module 23 can also be used for further filtering out buffer memory from both candidate nodes greater than the both candidate nodes of first threshold, and described continuous sub-piece is meant: after the initial sub-piece of described data to be downloaded and the continuous sub-piece adjacent with initial sub-piece.
Described information receiving module 22 also is used to receive the total number information of sub-piece of the buffer memory that optional node reports; Then described first selects module 23 also to be used for further filtering out the both candidate nodes of the total number of sub-piece of buffer memory greater than second threshold value from both candidate nodes, and the sub-piece of buffer memory is meant in the described both candidate nodes that further filters out: all the sub-pieces after the initial sub-piece of data to be downloaded.
Whether saturated described information receiving module 22 also be used to receive connected node number that optional node reports information, or the node number that has connected and the maximum node number that can connect, described connected node number is meant: other node numbers of obtaining data from optional node; Then described first selects module 23 also to be used for further filtering out the unsaturated both candidate nodes of connected node number from both candidate nodes.
Described tracing equipment comprises that also second selects module 25, and at alternative condition not simultaneously, second selects the function of module 25 also different.
When alternative condition is the initial sub-piece of the connected node number unsaturation of both candidate nodes or buffer memory data to be downloaded, second selects module 25 to be used for when first selects both candidate nodes number that module 23 selects greater than maximum, the both candidate nodes of selecting is selected once more, and the nodal information of the both candidate nodes correspondence that will select once more send to the tabulation sending module 24, wherein: the both candidate nodes number of selecting once more is not more than maximum.
At least the number that comprises in the both candidate nodes the continuous sub-piece of preserving data to be downloaded at alternative condition is during greater than first threshold, second selects module 25 to be used for when first selects both candidate nodes number that module 23 selects greater than maximum, the descending order of number according to the continuous sub-piece of buffer memory, the both candidate nodes of selecting is sorted, select the top n both candidate nodes once more, and the nodal information of the N that will select once more both candidate nodes correspondence send to the tabulation sending module 24, described N is positive integer and is not more than maximum.The continuous sub-piece of the data to be downloaded here is meant: after the initial sub-piece of data to be downloaded and the continuous sub-piece adjacent with initial sub-piece.
At least comprise in the both candidate nodes that at alternative condition the total number of sub-piece of preserving data to be downloaded is during greater than second threshold value, second selects module 25 to be used for when first selects both candidate nodes number that module 23 selects greater than maximum, the descending order of the total number of sub-piece according to data to be downloaded, the both candidate nodes of selecting is sorted, M both candidate nodes before selecting once more, and the nodal information of the M that will select once more both candidate nodes correspondence send to the tabulation sending module 24, described M is positive integer and is not more than maximum.The sub-piece of preserving data to be downloaded in the both candidate nodes is: the sub-piece after the initial sub-piece of data to be downloaded.
The embodiment of the invention seven also provides a kind of node device, and this node device is can be when other node devices upload data, and can be used as is the optional node that relates in the various embodiments described above; Simultaneously, this node device also can be the requesting node that relates in the various embodiments described above.
As shown in Figure 6, node device in the present embodiment seven comprises information reporting module 31 and data outputting module 32, and wherein: information reporting module 31 is used for reporting the number of continuous sub-piece of buffer memory and the sequence number of first sub-piece of described continuous sub-piece to Tracker; Data outputting module 32 is used for uploading data to other node devices according to the request of other node devices.
Further, described information reporting module 31 also is used for reporting to Tracker one or more combination of following information:
Whether node device connected node number is saturated;
The total number information of the sub-piece of node device buffer memory.
When the node device in the present embodiment during as requesting node, can also comprise a request module, be used for reporting the node listing request to Tracker, and when receiving the node listing that Tracker returns, other node device request data download in tabulation.
The method that provides by the embodiment of the invention, system and equipment, each optional node is simplified to Tracker, report the sub-block message of self efficiently, number as the continuous sub-piece of buffer memory, total number information of sub-piece of the sequence number of first sub-piece and buffer memory etc. in the described continuous sub-piece, make the Tracker can sub-piece of each optional node current cache of real-time confirmation and the state that is connected other node numbers, when the requesting node request obtains node listing, Tracker can be according to actual needs, according to sub-piece of buffer memory and connected node number is condition, the node of selecting to satisfy condition from optional node is as both candidate nodes, guarantee that the both candidate nodes of selecting can correctly upload data for requesting node, then requesting node is when determining active node, the process that original two steps are searched active node becomes a step and searches, eliminated the message that produces when requesting node is searched active node by Peerlist, alleviate the pressure of network, reduce bandwidth consumption; Suppose that each node is on average inquired about 10 nodes in the prior art scheme and just can find active node that so, in a P2P system that has 1,000,000 nodes, the message bar number of Zeng Jiaing is 1,000 ten thousand thus.And the present invention program has cancelled the transmission of this part message, obviously alleviates the bandwidth pressure of network.In addition, the nodal information that each node reports is handled by Tracker is unified, has improved the utilance of Tracker.After utilizing the present invention program, requesting node only needs to send a node listing request to tracker just can find active node, has shortened broadcast start-up time.
Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, if of the present invention these are revised and modification belongs within the scope of claim of the present invention and equivalent technologies thereof, then the present invention also is intended to comprise these changes and modification interior.

Claims (20)

1. a method of searching active node in the P2P stream media system is characterized in that, optional node reports the sequence number of first sub-piece in the number of continuous sub-piece of buffer memory and the described continuous sub-piece to tracing equipment Tracker;
Described method of searching active node comprises:
After Tracker receives the node listing request of requesting node transmission, initial sub-piece sequence number according to the requesting node data to be downloaded that comprise in the node listing request, select a plurality of optional nodes as both candidate nodes, wherein, in the both candidate nodes buffer memory the initial sub-piece of described data to be downloaded;
Tracker returns to requesting node with the nodal information of both candidate nodes by node listing, and indication described request node determines that according to the nodal information in the node listing at least one both candidate nodes is as active node.
2. the method for claim 1 is characterized in that, Tracker selects after the both candidate nodes, and node listing is returned to before the requesting node, and described method also comprises:
Tracker further filters out the number of continuous sub-piece of buffer memory greater than the both candidate nodes of first threshold from described both candidate nodes, described continuous sub-piece is meant: after the initial sub-piece of described data to be downloaded and the continuous sub-piece adjacent with initial sub-piece;
Tracker returns to requesting node with node listing and comprises:
The nodal information of the both candidate nodes that Tracker will further filter out returns to requesting node by node listing.
3. method as claimed in claim 1 or 2 is characterized in that, described method also comprises:
Optional node reports the total number information of sub-piece of buffer memory to Tracker;
Tracker selects after the both candidate nodes, and node listing is returned to before the requesting node, and described method also comprises:
Tracker further filters out the both candidate nodes of the total number of sub-piece of buffer memory greater than second threshold value from described both candidate nodes;
Tracker returns to requesting node with node listing and comprises:
The nodal information of the both candidate nodes that Tracker will further filter out returns to requesting node by node listing.
4. method as claimed in claim 3 is characterized in that,
The sub-piece of buffer memory is meant in the described both candidate nodes that further filters out: all the sub-pieces after the initial sub-piece of data to be downloaded.
5. as claim 1,2 or 3 described methods, it is characterized in that described method also comprises:
Whether saturated optional node report connected node number information to Tracker, or the node number that has connected and the maximum node number that can connect, and described connected node number is meant: other node numbers of obtaining data from optional node;
Tracker selects after the both candidate nodes, and node listing is returned to before the requesting node, and described method also comprises:
Tracker further filters out the unsaturated both candidate nodes of connected node number from described both candidate nodes;
Tracker returns to requesting node with node listing and comprises:
The nodal information of the both candidate nodes that Tracker will further filter out returns to requesting node by node listing.
6. as claim 1 or 5 described methods, it is characterized in that, select after the both candidate nodes that node listing is returned to before the requesting node, and described method also comprises:
When both candidate nodes number during greater than maximum, Tracker selects once more to both candidate nodes, and the both candidate nodes number after selecting once more is not more than described maximum;
Tracker returns to requesting node with node listing and comprises:
The nodal information of the both candidate nodes after Tracker will select once more returns to requesting node by node listing.
7. method as claimed in claim 2 is characterized in that, selects after the both candidate nodes, and node listing is returned to before the requesting node, and described method also comprises:
When both candidate nodes number during greater than maximum, Tracker sorts to both candidate nodes according to the descending order of the number of the continuous sub-piece of buffer memory, selects the top n both candidate nodes once more, and described N is positive integer and is not more than maximum;
Tracker returns to requesting node with node listing and comprises:
The nodal information of the N that Tracker will select an once more both candidate nodes returns to requesting node by node listing.
8. method as claimed in claim 4 is characterized in that, further filters out after the both candidate nodes, and node listing is returned to before the requesting node, and described method also comprises:
During greater than maximum, Tracker sorts to both candidate nodes according to the descending order of the total number of sub-piece of data to be downloaded in the both candidate nodes number that further filters out, M both candidate nodes before selecting once more, and described M is positive integer and is not more than maximum;
Tracker returns to requesting node with node listing and comprises:
The nodal information of the M that Tracker will select an once more both candidate nodes returns to requesting node by node listing.
9. a system of searching active node in the P2P stream media system is characterized in that, described system comprises requesting node, optional node and Tracker, wherein:
Optional node is used for reporting the number of continuous sub-piece of buffer memory and the sequence number of first sub-piece of described continuous sub-piece to Tracker;
Requesting node is used for to Tracker sending node list request, and the nodal information in the node listing that returns according to Tracker, determines that at least one both candidate nodes is as active node;
Tracker, be used for after receiving the node listing request, initial sub-piece sequence number according to the requesting node data to be downloaded that comprise in the node listing request, select a plurality of optional nodes as both candidate nodes, wherein, in the both candidate nodes buffer memory the initial sub-piece of described data to be downloaded, and the nodal information of the both candidate nodes selected returned to requesting node by node listing.
10. system as claimed in claim 9 is characterized in that,
Described optional node also is used for reporting to Tracker one or more combination of following information:
Whether optional node connected node number is saturated;
The total number information of the sub-piece of optional node buffer memory.
11. system as claimed in claim 9 is characterized in that,
Tracker also is used for one or more selection both candidate nodes according to following condition:
Both candidate nodes connected node number is not full, and described connected node number is to obtain other node numbers of data from both candidate nodes;
The number of the continuous sub-piece of buffer memory is greater than first threshold in the both candidate nodes;
The total number of sub-piece of buffer memory is greater than second threshold value in the both candidate nodes.
12. a tracing equipment is applied to it is characterized in that in the P2P stream media system that described tracing equipment comprises:
The request receiver module is used for the receiving node list request, the initial sub-piece sequence number of the requesting node data to be downloaded that comprise in the described node listing request;
Information receiving module is used for receiving the number of continuous sub-piece of the buffer memory that optional node reports and the sequence number of first sub-piece of described continuous sub-piece;
First selects module, is used for the initial sub-piece sequence number according to data to be downloaded, selects a plurality of optional nodes as both candidate nodes, wherein, in the both candidate nodes buffer memory the initial sub-piece of described data to be downloaded;
The tabulation sending module, the nodal information that is used for the both candidate nodes that will select returns to requesting node by node listing.
13. tracing equipment as claimed in claim 12 is characterized in that,
Described first selects module, the number of continuous sub-piece that also is used for further filtering out buffer memory from both candidate nodes is greater than the both candidate nodes of first threshold, and described continuous sub-piece is meant: after the initial sub-piece of described data to be downloaded and the continuous sub-piece adjacent with initial sub-piece.
14. as claim 12 or 13 described tracing equipments, it is characterized in that,
Described information receiving module also is used to receive the total number information of sub-piece of the buffer memory that optional node reports;
Described first selects module, also be used for further filtering out the both candidate nodes of the total number of sub-piece of buffer memory greater than second threshold value from both candidate nodes, the sub-piece of buffer memory is meant in the described both candidate nodes that further filters out: all the sub-pieces after the initial sub-piece of data to be downloaded.
15. as claim 12,13 or 14 described tracing equipments, it is characterized in that,
Described information receiving module, also be used to receive the whether saturated information of connected node number that optional node reports, or the node number that has connected and the maximum node number that can connect, described connected node number is meant: other node numbers of obtaining data from optional node;
Described first selects module, also is used for further filtering out the unsaturated both candidate nodes of connected node number from both candidate nodes.
16., it is characterized in that described tracing equipment also comprises as claim 12 or 15 described tracing equipments:
Second selects module, be used for when first selects both candidate nodes number that module selects greater than maximum, the both candidate nodes of selecting is selected once more, and the nodal information of the both candidate nodes that will select once more sends to the tabulation sending module, and wherein: the both candidate nodes number of selecting once more is not more than maximum.
17. tracing equipment as claimed in claim 13 is characterized in that, described tracing equipment also comprises:
Second selects module, be used for when first selects both candidate nodes number that module selects greater than maximum, the descending order of number according to the continuous sub-piece of buffer memory, the both candidate nodes of selecting is sorted, select the top n both candidate nodes once more, and the nodal information of the N that will select an once more both candidate nodes sends to the tabulation sending module, and described N is positive integer and is not more than maximum.
18. tracing equipment as claimed in claim 14 is characterized in that, described tracing equipment also comprises:
Second selects module, be used for when first selects both candidate nodes number that module selects greater than maximum, the descending order of the total number of sub-piece according to data to be downloaded, the both candidate nodes of selecting is sorted, M both candidate nodes before selecting once more, and the nodal information of the M that will select an once more both candidate nodes sends to the tabulation sending module, and described M is positive integer and is not more than maximum.
19. a node device is characterized in that, described node device comprises:
The information reporting module is used for reporting the number of continuous sub-piece of buffer memory and the sequence number of first sub-piece of described continuous sub-piece to Tracker;
Data outputting module is used for uploading data to other node devices according to the request of other node devices.
20. node device as claimed in claim 19 is characterized in that,
Described information reporting module also is used for reporting to Tracker one or more combination of following information:
Whether node device connected node number is saturated;
The total number information of the sub-piece of node device buffer memory.
CN 200910086676 2009-06-17 2009-06-17 Method, system and equipment for searching active nodes in P2P streaming media system Active CN101924777B (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
CN 200910086676 CN101924777B (en) 2009-06-17 2009-06-17 Method, system and equipment for searching active nodes in P2P streaming media system
PCT/CN2010/000863 WO2010145199A1 (en) 2009-06-17 2010-06-13 Method, system and device for searching active nodes in p2p streaming media system
US13/378,982 US8762461B2 (en) 2009-06-17 2010-06-13 Method, system and device for searching active peer in P2P streaming media system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 200910086676 CN101924777B (en) 2009-06-17 2009-06-17 Method, system and equipment for searching active nodes in P2P streaming media system

Publications (2)

Publication Number Publication Date
CN101924777A true CN101924777A (en) 2010-12-22
CN101924777B CN101924777B (en) 2013-03-06

Family

ID=43339421

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 200910086676 Active CN101924777B (en) 2009-06-17 2009-06-17 Method, system and equipment for searching active nodes in P2P streaming media system

Country Status (1)

Country Link
CN (1) CN101924777B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012152224A1 (en) * 2011-05-11 2012-11-15 Huawei Technologies Co., Ltd. System and method for peer to peer communications in cellular communications systems
CN103312795A (en) * 2013-05-31 2013-09-18 合一网络技术(北京)有限公司 Torrent dispatching method and device for P2P (peer-to-peer) system
CN104580476A (en) * 2015-01-13 2015-04-29 北京京东尚科信息技术有限公司 Method and device for selecting node in distributed system
CN104936042A (en) * 2015-06-30 2015-09-23 北京奇艺世纪科技有限公司 Video clip downloading method and device
CN110581892A (en) * 2019-09-17 2019-12-17 上海保险交易所股份有限公司 Block chain based network connection and recovery mechanism
CN111435946A (en) * 2019-01-15 2020-07-21 阿里巴巴集团控股有限公司 Method, device, terminal equipment and system for downloading resources

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012152224A1 (en) * 2011-05-11 2012-11-15 Huawei Technologies Co., Ltd. System and method for peer to peer communications in cellular communications systems
CN103312795A (en) * 2013-05-31 2013-09-18 合一网络技术(北京)有限公司 Torrent dispatching method and device for P2P (peer-to-peer) system
CN103312795B (en) * 2013-05-31 2016-12-28 合一网络技术(北京)有限公司 Seed distribution method and device in a kind of p2p system
CN104580476A (en) * 2015-01-13 2015-04-29 北京京东尚科信息技术有限公司 Method and device for selecting node in distributed system
CN104580476B (en) * 2015-01-13 2018-09-14 北京京东尚科信息技术有限公司 The method and apparatus for choosing node in a distributed system
CN104936042A (en) * 2015-06-30 2015-09-23 北京奇艺世纪科技有限公司 Video clip downloading method and device
CN104936042B (en) * 2015-06-30 2018-08-07 北京奇艺世纪科技有限公司 A kind of video clip method for down loading and device
CN111435946A (en) * 2019-01-15 2020-07-21 阿里巴巴集团控股有限公司 Method, device, terminal equipment and system for downloading resources
CN110581892A (en) * 2019-09-17 2019-12-17 上海保险交易所股份有限公司 Block chain based network connection and recovery mechanism
CN110581892B (en) * 2019-09-17 2022-04-01 上海保险交易所股份有限公司 Block chain based network connection and recovery mechanism

Also Published As

Publication number Publication date
CN101924777B (en) 2013-03-06

Similar Documents

Publication Publication Date Title
CN101924777B (en) Method, system and equipment for searching active nodes in P2P streaming media system
CN100450053C (en) Apparatus and method for detecting duplicate IP addresses in mobile ad hoc network environment
US20120151051A1 (en) Method, system and device for searching active peer in p2p streaming media system
CN110995513B (en) Data sending and receiving method in Internet of things system, internet of things equipment and platform
CN101771604B (en) Routing detection method, system and intermediate routing device
CN112468372B (en) Method and device for detecting equipment state in power line communication network
US7760665B2 (en) Selective node tracking
CN106686102B (en) Service node switching method and device
CN101345628B (en) Source node selection method
CN102065112A (en) Peer-to-peer (P2P) network system and method and related device for establishing the same
CN101436998A (en) Method for obtaining message forwarding route and apparatus for forwarding message
CN101588287B (en) Method, device and system for scheduling and downloading peer-to-peer network data
CN102624884B (en) A kind of method, device and equipment for receiving P2P resource
CN101741616A (en) Data acquisition system and device thereof
CN113542058B (en) Data source returning method, server and storage medium
CN101150528B (en) A system, device and method for pushing one-domain users to instant communication users
CN1781282A (en) An ad-hoc network, a network device and a method of configuration management therefor
CN105376226A (en) Streaming media server forwarding method and system
CN109474696B (en) Network service method, device, electronic equipment and readable storage medium
CN101448136B (en) Method for realizing video on-demand function and system thereof
KR20140125223A (en) Method for collecting information with management interface in contents network based on information centric networking, content network management system, and node apparatus
CN107493308B (en) Method and device for sending message and distributed equipment cluster system
CN101610289A (en) The methods, devices and systems of data download and node
CN103795810A (en) Data distribution system and method and central server of data distribution system
CN113791733A (en) Information storage method, device, equipment and storage medium

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant