CN101499914A - Parent node selection method, system and node for multicast system - Google Patents
Parent node selection method, system and node for multicast system Download PDFInfo
- Publication number
- CN101499914A CN101499914A CNA2008100066126A CN200810006612A CN101499914A CN 101499914 A CN101499914 A CN 101499914A CN A2008100066126 A CNA2008100066126 A CN A2008100066126A CN 200810006612 A CN200810006612 A CN 200810006612A CN 101499914 A CN101499914 A CN 101499914A
- Authority
- CN
- China
- Prior art keywords
- node
- requested
- weighted value
- father
- request
- 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
Links
Images
Abstract
The invention discloses a father node selecting method, a father node selecting system and nodes of a multicast system, and belongs to the technical field of stream media transmission. The father node selecting method comprises the following steps: a requester node sends an access request which contains a weight value of the requester node to a requested node; and the weight value is used for judging whether the requested node can become a father node of the requester node. The father node selecting system comprises an access request initiating module and a judging module. The requester node comprises the access request initiating module. The requested node comprises the judging module. The technical proposal of the father node selecting method, the father node selecting system and the nodes of the multicast system solves the problems of lower integral system efficiency and lower inter-node communication quality and the like.
Description
Technical field
The present invention relates to the streaming media transmission technique field, particularly a kind of father node system of selection, system and node of multi-cast system.
Background technology
Along with the development of Internet, Streaming Media is used more and more widely in the network.Traditional network architecture all is to use C/S (Client/Server, client/server) pattern realizes the order program service of Streaming Media, and this pattern seriously consumes the bandwidth and the computational resource of server, makes server become the bottleneck of whole system easily, and network extensibility is not strong yet.
For the network bandwidth and the computational resource of saving transmitting apparatus, the notion of multicast has been proposed.Multicast (Multicast) is also referred to as multicast, is meant grouping is sent to its interested a group recipient, and its concrete pattern comprises one-to-many, multi-to-multi pattern, can be used for video request program, video conferencing etc.The multicast scheme of Chu Xianing is the IP multicast at first.The IP multicast is meant that realizing duplicating and transmitting grouping by equipment such as routers in network layer gives the recipient.The IP multicast can effectively be saved the network bandwidth, improve utilization rate of network resource, but the IP multicast has following intrinsic shortcoming: extensibility is strong, be difficult to support high layer function, lack effective network management and billing model and carry out the large scale deployment difficulty and problem such as slow.
In order to realize and the irrelevant multicast of network layer device, improve network extensibility simultaneously, application layer multicast (Application Layer Multicast, scheme ALM) have appearred.In application layer multicast system, the mode of terminal equipment by the P2P network makes up overlay network and communicates, and carried out packet replication and transmitted and promptly realize multicast functionality by terminal equipment, and bottom-layer network only need provide unicast feature.
In application layer multicast system, node needs to play while downloading, and is very responsive to factors such as available bandwidth, transmission delays, so child node (Data Receiving person) has proposed requirements at the higher level with cooperating of father node (data source supplier).The father node that chooses is related to the quality of the child node quality of reception, also helps reducing simultaneously the degree of depth of multicast tree and the transmission delay of multi-cast system.
In application layer multicast system, the father node system of selection is considered to be divided into two classes from the execution mode of choice mechanism at present:
One class is the father node choice mechanism that requesting node drives.In this scheme, requesting node and nodal information server connect, and the nodal information server is being born the evaluation of each requesting node and the task of selecting father node for requesting node.The nodal information server is that standard is that requesting node is selected father node with the available bandwidth of requesting node, and requesting node is not taken into account to link circuit condition, the communication quality of this father node.Can cause the network system topology not to be optimized like this, the multicast tree degree of depth can be a lot, thereby strengthen the transmission delay of source of media to node.
Another kind of is to be requested the father node choice mechanism that node drives.In this scheme, requesting node is initiated request to being requested node randomly.After being requested node and receiving request,, determine to accept this service request according to certain strategy, or the denial of service request, perhaps the service request with requesting node navigates to other node in the network.For example: the strategy that node is selected is formulated in the geographical position according to requesting node, be requested node after receiving service request, elder generation's computation requests node on the geographical position with oneself far and near degree, know that some node is more approaching with requesting node on the geographical position if be requested node, just service request is redirected to this node, otherwise provides service to make the decision-making of reception or this request of refusal according to oneself whether can be more nodes.
The father node choice mechanism that is requested the node driving is to determine whether that by being requested the strategies such as service ability of node according to requesting node thereby the connection request of recipient node reaches the purpose of optimizing overall network performance.These class methods are owing to only consider from being requested this side of node how topology is organized, the topology of organizing like this, and each internodal communication quality is not an optimum.
In sum, the application layer multicast system of prior art, if the father node choice mechanism that adopts requesting node to drive separately then can't be optimized the network system topology, the multicast tree degree of depth can be a lot, thereby strengthen the transmission delay of source of media to node; If adopt separately and be requested the father node choice mechanism that node drives, can't guarantee that then each internodal current quality reaches optimum.How can optimize network system simultaneously and improve internodal communication quality and become the problem of needing solution at present badly.
Summary of the invention
In order to improve the overall efficiency of system, guarantee the inter-node communication quality, the embodiment of the invention provides father node system of selection, system and the node in a kind of multi-cast system.Described technical scheme is as follows:
A kind of father node system of selection of multi-cast system, described method comprises:
Requesting node initiates to insert request to being requested node, comprises the weighted value of described request node in the described access request;
Judge the described father node whether node can become the described request node that is requested according to described weighted value.
The system that a kind of father node of multi-cast system is selected, described system comprises:
Insert the request initiation module, be used for initiating to insert request, comprise the weighted value of requesting node in the described access request;
Judge module is used to receive described access request, and is requested the father node whether node can become the described request node according to the weighted value judgement that comprises in the described access request.
A kind of requesting node, the described request node comprises:
Insert the request initiation module, be used for initiating to insert request, comprise the weighted value of requesting node in the described access request to being requested node.
A kind of node that is requested is characterized in that, the described node that is requested comprises:
Judge module is used to receive the access request that requesting node sends, and judges according to the weighted value that comprises in the described access request whether self can become the father node of described request node.
The embodiment of the invention is by being used in combination the node choice mechanism of two kinds of drive patterns, and the entire system benefit of having avoided the use single-mode to cause is low, and the inter-node communication quality is hanged down inferior problem.
Description of drawings
Fig. 1 is the flow chart of the father node system of selection of a kind of multi-cast system of providing of the embodiment of the invention 1;
Fig. 2 is that the centralization LIST SERVER that passes through that the embodiment of the invention 1 provides obtains alternative father node group schematic diagram;
Fig. 3 is that the stacked network of DHT that passes through that the embodiment of the invention 1 provides obtains alternative father node group schematic diagram;
Fig. 4 is the alternative father node tabulation schematic diagram that passes through the ordering of RTT value that the embodiment of the invention 1 provides;
To be the requesting node Weight value that provides of the embodiment of the invention 1 select schematic diagram than the father node that is requested node Weight value hour to Fig. 5;
Fig. 6 be the embodiment of the invention 1 provide be requested the node available bandwidth greater than streaming media playing speed the time father node select schematic diagram;
To be the requesting node Weight value that provides of the embodiment of the invention 1 select schematic diagram than being requested the father node of node Weight value when big to Fig. 7;
The father node that Fig. 8 provides when being requested the node available bandwidth less than streaming media playing speed is selected schematic diagram;
Fig. 9 is that the father node of all child node Weight values that are requested node of providing of the embodiment of the invention 1 when all big than the Weight value of requesting node selected schematic diagram;
Figure 10 is the simulation result datagram that the embodiment of the invention 1 provides;
Figure 11 is the schematic diagram of the father node selective system of a kind of multi-cast system of providing of the embodiment of the invention 2.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, embodiment of the present invention is described further in detail below in conjunction with accompanying drawing.
Embodiment 1
The embodiment of the invention provides the system of selection of a kind of multicast father node, the node choice mechanism that this method uses requesting node to drive, and be used in combination the access control mechanism that is requested the node driving, and can improve the whole efficiency of network system, guarantee the quality of reception of requesting node.Referring to Fig. 1, the concrete steps of the embodiment of the invention are as follows:
Step 101: requesting node obtains an alternative father node group when adding network.
At least exist following two kinds of methods to be used to obtain alternative father node group at present:
The one, obtain alternative father node group by the centralization LIST SERVER, schematic diagram is as shown in Figure 2.Requesting node A wishes to add network, it must initiate to add the request of network earlier to the centralization LIST SERVER, LIST SERVER is noted requesting node A, tabulation from existing node in the network to requesting node A that return simultaneously for it as alternative father node group.
The 2nd, obtain alternative father node group by the stacked network of DHT (Distributed Hash Table, distributed hashtable), schematic diagram as shown in Figure 3, requesting node A can obtain alternative father node group by searching multiple modes such as pointer gauge.
Step 102: requesting node obtains RTT (Round-Trip Time, the round-trip delay) value of all alternative father nodes, the RTT value of obtaining is carried out the match computing obtain R (i) value.
Requesting node each node in alternative father node group sends packet, and record sends the transmitting time of packet to each node; Packet not treated promptly the return to requesting node of alternative father node to receiving; Requesting node receives packet, and the time of reception of recorder data, by the difference of time of reception and transmitting time, obtains the RTT value.
Because the RTT value fluctuation ratio that each detection is obtained is bigger, in order to obtain a metastable RTT value, utilizes following formula that the RTT value is carried out the match computing, tries to achieve R (i) value:
R (i)=(1-λ) * RTT+ λ * R (i-1) (R (0)=0, i 〉=1, and i is an integer) (1)
R (i) is transmitted value two-way time that data need as requesting node to being requested node, and the RTT value is the result that the i time detection obtained in the formula, and R (i-1) is last fitting result, and R (i) is this fitting result.λ is a balance factor, and value is adjustable between (0,0.5), if check RTT value than hour delay jitter, λ can be got smaller value; If check the bigger delay jitter of RTT, λ can be got higher value.
Step 103: requesting node sorts to the node in the alternative father node group according to R (i) value standard from small to large and forms alternative father node tabulation, and alternative father node list pointer is pointed to the node of first row, i.e. the minimum node of R (i) value, as shown in Figure 4.
Step 104: requesting node calculates from Weight (candidate) value that adds in request in the network.
Present embodiment has proposed a kind of method of computing node Weight value, and concrete computing formula is as follows:
Contr＝Count
out (3)
BW in the formula (2)
ValidIt is the available bandwidth of node, PlaybackRate is a streaming media playing speed, be known fixed (this is the intrinsic parameter of network), available bandwidth divided by the streaming media playing rate representation under the situation of single father node, existing bandwidth can promptly characterize the ability that node can hold new node with ServCap again for several nodes provide service.
Count in the formula (3)
OutIt is the linking number of uploading of node, just set up direct-connected child node number with node, Contr is used for characterizing the contribution of node, the value of Contr is big more, explanation directly provides the child node of service many more by node, under the general case, the direct child node of node is many, and it provides the child node of service downwards along multicast tree also meeting is many so.If the service quality of node self is protected, it provides the service quality of the child node of service also can improve downwards so.
In the formula (4)
∈ (0,1) is a balance factor, if system pays attention to the service ability of node then incites somebody to action
Get value near 1 this end; Will if system pays attention to the multicast tree degree of depth
Get value near 0 this end; θ ∈ (0,1) is an adjustment factor, and it is fixed that concrete value is come according to different needs, for example gets 1, is exactly ∑ Weight
ChildIf feel ∑ Weight
ChildThis should be not too much the calculating that influences the Weight value, the θ value should be partial to 0 this on one side; ∑ Weight
ChildBe the Weight value sum of all child nodes of node, this mainly is when upgrading for the Weight value that guarantees child node, and the Weight value of upper strata father node is upgraded synchronously.
For formula (2), prior art adopts the computational methods of effective bandwidth/total bandwidth, the value of calculating like this is the ratio between 0 to 1, for example: two ServCap (node can hold the ability of new node) are 0.8 nodes, possible their absolute value difference is far, but because normalization, so just can't know the difference of their service ability; For another example (effective bandwidth, total bandwidth) be respectively (2M, 10M), (0.5M, two nodes 1M), 2M are eager to excel than the service ability of 0.5M certainly, but (2M/10M) is also littler than (0.5M/1M) according to existing scheme, so just can't be used to obtain the real service ability of node.And the scheme in the embodiment of the invention, because PlaybackRate is the value of fixing for a network, so can pass judgment on the size of the real service ability of each node by the ServCap that obtains, thereby can provide real data for optimizing network topology.
Therefore for formula (3), present embodiment does not adopt ratio computing of the prior art, can be used in the comparing cell relative size of service ability between each node.
For formula (4), ∑ Weight
ChildBe the Weight value sum of all child nodes, child node is many more, and this is big more, so might last formula (4) in fully in action by this, so add coefficient θ in the embodiment of the invention this to reduce his effect.
Therefore, the weighted value that calculates in this step is mainly used to characterize the ability that node holds new node.
Step 105: the minimum node (i.e. the first row node) of requesting node R (i) value in alternative father node tabulation initiates to insert request, comprises the Weight value of self in this request, and alternative father node list pointer then moves down delegation.
Step 106: the Weight value and the Weight value that is requested node of requesting node are compared, if the Weight value of requesting node is littler than the Weight value that is requested node, then execution in step 107; If the Weight value of requesting node is bigger than the Weight value that is requested node, then return maximum one of Weight value in a plurality of father nodes that are requested node and give requesting node, and change step 105 over to, carry out the father node of a new round by requesting node and select.
Being requested node and requesting node is comparatively speaking, being requested node might become requesting node, and requesting node also might become and is requested node, and each node is when the request access network, own Weight value in the network of ask access is calculated in the capital, constantly upgrades and preserves.As shown in Figure 5, requesting node A initiates to insert request to being requested node C, but the Weight value that is requested node C is littler than requesting node Weight value, be requested node C inquiry in the father node tabulation of oneself, the node D of selection Weight value maximum result in response returns to requesting node A.Requesting node A receives response results, node D is added to the alternative father node tabulation of oneself after, change step 105 over to and carry out the father node of a new round and select.
Step 107: calculate the available bandwidth (BW that is requested node
Valid), and compare with the streaming media playing speed of being asked, if BW
ValidGreater than the streaming media playing speed of being asked, then change step 108 over to; If BW
ValidLess than the streaming media playing speed of being asked, then change step 109 over to.
Step 108: be requested node the Weight value of own all child nodes and the Weight value of requesting node are compared, if be requested to exist in the child node of node the node bigger than requesting node Weight value, return to requesting node as alternative father node with being requested the node that all Weight values are bigger than requesting node Weight value in the node, and change step 105 over to, carry out the father node of a new round by requesting node and select; If be requested not big node in the child node of node than requesting node Weight value, then requesting node be requested node and connect, being requested node joins requesting node in the child node tabulation of oneself, beginning sends stream medium data to requesting node, and changes step 110 and step 111 over to.
As shown in Figure 6, be requested node E available bandwidth greater than the streaming media playing speed of being asked, this moment, requesting node A initiated to insert request to it.Because the Weight value of child node B and the child node D all Weight value than requesting node is big, is requested node and can thinks that the service ability of requesting node is not strong, will not admits, and this two child node is returned to requesting node as the recommendation father node.In Fig. 7, because requesting node is all bigger than the Weight value that is requested all child nodes of node, therefore it is received as new child node, requesting node be requested node and connect, being requested node joins requesting node in the child node tabulation of oneself, beginning sends stream medium data to requesting node, and changes step 110 and step 111 over to.
Step 109: be requested node the Weight value of own all child nodes and the Weight value of requesting node are compared, if be requested to exist in the child node of node the node littler than the Weight value of requesting node, be requested the child node that the node node that R (i) value is minimum switches to requesting node, and with the child node of requesting node as oneself, be requested between node and the requesting node, requesting node and the minimum node of R (i) value between beginning transport stream media data, and change step 110 and step 111 over to.
Carrying out the node switching specifically passes through: be requested node and adjust message to all Weight values child node broadcasting father node littler than requesting node Weight value, the child node of receiving message sends probe message to requesting node, use formula (1) is calculated R (i) value, then requesting node be requested node and set up being connected of free of data transmission, the node that R (i) value is minimum be requested the node disconnection and be connected, minimum node and the requesting node of R (i) value connects, be requested between node and the requesting node, requesting node and the minimum node of R (i) value between beginning transport stream media data, and change step 110 and step 111 over to.
Be requested node E available bandwidth among Fig. 8 less than streaming media playing speed, this moment, requesting node A initiated to insert request to it because child node B and C all the Weight value than requesting node is little, therefore be requested node and send father node adjustment message to child node.The fitting result of R (i) value by formula (1), node C is littler than Node B to R (i) value of requesting node, therefore node C is adjusted into the child node of requesting node, requesting node be requested node and connect, being requested node joins requesting node in the child node tabulation of oneself, beginning transport stream media data, and change step 110 and step 111 over to.Among Fig. 9 because all child nodes that are requested node all the Weight value than requesting node is big because the node C of Weight value minimum in response the result return to requesting node.
Step 110: requesting node compares self downloading rate and streaming media playing speed, if downloading rate greater than streaming media playing speed, receiving stream media data then; If downloading rate less than streaming media playing speed, then changes step 105 over to, carry out the father node of a new round and select.
Step 111: be requested node and requesting node and use formula (2) (3) (4) to upgrade the Weight value of oneself.The renewal process of Weight value is upwards propagated along multicast tree.
Computational methods by Weight value in the embodiment of the invention provide accurate data, thereby provide precondition for topology optimization;
If be requested can not the accept request service request of node of node, will return the node listing of a recommendation and give requesting node, but, node in the recommended node listing might not be optimum, be worth as decision criteria by use R (i) in the embodiment of the invention, which node of weighing in existing alternative father node is initiated request, thereby determines that optimum node is as father node; If node switches,, select a node of R (i) value minimum (R (i) value minimum just link circuit condition is optimum relatively) to switch by surveying their R (i) values to requesting node.Therefore, the technical scheme in the embodiment of the invention has realized the optimization to network topology.
Requesting node need be surveyed oneself R (i) value to recommended node, compares with existing alternative father node, determines whether to initiate request to recommended node.Because might exist in the existing alternative father node than recommended node node more suitably, so directly accept to be requested the suggestion of node, initiate request to recommended node, such selection may not be optimum.Same situation is present in the step of node switching.Existing scheme determines directly that according to the Weight value which node needs switches, and the Weight value of presumable node is smaller really, but they are very poor to the link circuit condition of requesting node, and so such node switches and will strengthen transmission delay.In the embodiment of the invention, before node switched, those child nodes that meet switching condition were all surveyed oneself R (i) value to requesting node, and the minimum child node (the optimum relatively node of link circuit condition just) of R (i) value is switched in the past.Be requested any decision-making that node is made, relevant node all can be considered again, rather than directly execution is requested the decision that node is made.Therefore, the technical scheme in the embodiment of the invention has guaranteed internodal communication quality under the situation of improving topology.
When this programme uses the node choice mechanism of requesting node driving, be used in combination and be requested the access control mechanism that node drives, under the situation that guarantees the requesting node quality of reception, optimized network topology, improve the available bandwidth ratio of system, reduced the multicast tree degree of depth.Simultaneously for being requested the alternative father node that node is recommended, requesting node is not directly it to be served as the father node request, again select but it is added in the tabulation of alternative father node, avoided the second-rate but still situation that serve to its request of the alternative father node direct link of requesting node and recommendation.
Be the simulation result of this programme as shown in figure 10: as can be seen, at the beginning of multicast tree was set up, promptly the node number from 1000 to 4000 from the figure, and IPS is identical with the GPS rate of rise, but the IPS multicast tree degree of depth is about GPS half.Rise at the node number at 10000 o'clock from 4000, the multicast tree degree of depth of IPS increases mild, and GPS increases rapidly, and the multicast tree degree of depth of IPS is littler than GPS all the time.
The multicast tree degree of depth is the mean value of test of many times, and abscissa is an interstitial content.1000 is unit, and ordinate is the degree of depth of multicast tree, and it has reacted along with the increasing of interstitial content in the network, because the multicast tree degree of depth is big, can cause the Streaming Media source big to the propagation delay of node, so, can optimize topology by reducing the multicast tree degree of depth.
As shown in table 1 is the variance that multicast is counted the degree of depth: GPS (General Peer Selection, ordinary node is selected) according to selecting father node at random after the ordering of RTT value, IPS (Improved Peer Selection improves node and selects) is the father node selection algorithm that carries out access control according to the Weight value.The multicast tree degree of depth is that the test of many times data are asked averaged result, and the variance of sample is big more, illustrates that the fluctuation of sample data is big more, that is to say that sample is unstable more.Two sample datas for example, one 40, one 50, so they to ask on average be 45, asking variance is 50.If two data all are 45, variance is exactly 0 so.Variance is little, and the data that test of many times obtains are described, and is more approaching with mean value.
Table 1
| The node number | 1000 | 2000 | 3000 | 4000 | 5000 | 6000 | 7000 | 8000 | 9000 | 10000 |
| GPS | 0 | 21.57 | 22.49 | 23.73 | 21.57 | 27.43 | 30.89 | 31.12 | 32.62 | 31.16 |
| IPS | 3.69 | 2.11 | 2.75 | 3.19 | 2.86 | 2.78 | 2.25 | 2.36 | 2.28 | 2.36 |
As shown in table 2 is the ratio and the variance of the average available bandwidth of stream media system: adjust in the IPS algorithm
Value makes it to stress and the service ability and the multicast tree degree of depth, finds
When becoming big, be accompanied by the increase by a small margin of the multicast tree degree of depth, the ratio of average available bandwidth increases average out to 58%.Equally
When diminishing, the ratio and the multicast tree degree of depth of average available bandwidth all have small size decline, and what the ratio of average available bandwidth was reacted is the resource utilization of system.Such as two stream media systems, existing interstitial content is all the same with total bandwidth in the network, the resource utilization height, and so left available resources ratio should be big, and this expression system can provide service again for more node.As can be seen, the ratio of the average available bandwidth of GPS is 55% in the table, and our scheme is 57%.This is a mean value equally, the variance size of weighing sample fluctuation here.
Table 2
| Scheme | The ratio of average available bandwidth | Variance |
| GPS | 55％ | 2.67E-05 |
| IPS | 57％ | 6.35E-06 |
Embodiment 2
The system that the embodiment of the invention provides a kind of father node of multi-cast system to select, as shown in figure 11, this system comprises:
Insert the request initiation module, be used for initiating to insert request, comprise the weighted value of requesting node in the described access request;
Judge module is used to receive described access request, and is requested the father node whether node can become the described request node according to the weighted value judgement that comprises in the described access request.
Further, this system also comprises:
Order module is used for according to value two-way time order from small to large standby father node being sorted, and generates standby father node tabulation, the minimum node of pointed value two-way time of standby father node tabulation;
The weighted value acquisition module is used for obtaining the weighted value of all nodes of network.
Present embodiment has proposed a kind of method of computing node Weight value, and concrete computing formula is as follows:
Contr＝Count
out (3)
BW in the formula (2)
ValidIt is the available bandwidth of node, PlaybackRate is a streaming media playing speed, be known fixed (this is the intrinsic parameter of network), available bandwidth divided by the streaming media playing rate representation under the situation of single father node, existing bandwidth can promptly characterize the ability that node can hold new node with ServCap again for several nodes provide service.
Count in the formula (3)
OutIt is the linking number of uploading of node, just set up direct-connected child node number with node, Contr is used for characterizing the contribution of node, the value of Contr is big more, explanation directly provides the child node of service many more by node, under the general case, the direct child node of node is many, and it provides the child node of service downwards along multicast tree also meeting is many so.If the service quality of node self is protected, it provides the service quality of the child node of service also can improve downwards so.
In the formula (4)
∈ (0,1) is a balance factor, if system pays attention to the service ability of node then incites somebody to action
Get value near 1 this end; Will if system pays attention to the multicast tree degree of depth
Get value near 0 this end; θ ∈ (0,1) is an adjustment factor, and it is fixed that concrete value is come according to different needs, for example gets 1, is exactly ∑ Weight
ChildIf feel ∑ Weight
ChildThis should be not too much the calculating that influences the Weight value, the θ value should be partial to 0 this on one side; ∑ Weight
ChildBe the Weight value sum of all child nodes of node, this mainly is when upgrading for the Weight value that guarantees child node, and the Weight value of upper strata father node is upgraded synchronously.
For formula (2), prior art adopts the computational methods of effective bandwidth/total bandwidth, the value of calculating like this is the ratio between 0 to 1, for example: two ServCap (node can hold the ability of new node) are 0.8 nodes, possible their absolute value difference is far, but because normalization, so just can't know the difference of their service ability; For another example (effective bandwidth, total bandwidth) be respectively (2M, 10M), (0.5M, two nodes 1M), 2M are eager to excel than the service ability of 0.5M certainly, but (2M/10M) is also littler than (0.5M/1M) according to existing scheme, so just can't be used to obtain the real service ability of node.And the scheme in the embodiment of the invention, because PlaybackRate is the value of fixing for a network, so can pass judgment on the size of the real service ability of each node by the ServCap that obtains, thereby can provide real data for optimizing network topology.
Therefore for formula (3), present embodiment does not adopt ratio computing of the prior art, can be used in the comparing cell relative size of service ability between each node.
For formula (4), ∑ Weight
ChildBe the Weight value sum of all child nodes, child node is many more, and this is big more, so might last formula (4) fully in action by this, so add coefficient θ in the embodiment of the invention this to reduce his effect.
Therefore, the weighted value that calculates in this step is mainly used to characterize the ability that node holds new node.
As another kind of scheme, this system also comprises:
The weighted value comparison module is used for the weighted value of requesting node is compared with the weighted value that is requested node;
Available bandwidth is module relatively, is used at the weighted value of requesting node than the weighted value that is requested node hour available bandwidth that is requested node and the streaming media playing speed of being asked being compared.
The father node determination module, be used for when available bandwidth comparison module compares the available bandwidth that is requested node greater than the streaming media playing speed of being asked, then will be requested the weighted value of all child nodes of node and the weighted value of requesting node compares, if it is littler than the weighted value of requesting node to be requested the weighted value of all child nodes of node, then be requested the father node that node becomes requesting node.
The node handover module, be used at the available bandwidth that is requested node less than the streaming media playing speed of being asked, then will be requested the weighted value of all child nodes of node and the weighted value of requesting node compares, there be the weighted value node littler if be requested in all child nodes of node than the weighted value of requesting node, then will be requested the child node that the minimum node of value two-way time in the child node of node switches to requesting node, and with requesting node as the child node that is requested node.
Further, this system also comprises:
Update module is used for upgrading the weighted value of all nodes in the network when requesting node is selected the father node success.
Embodiment 3
The embodiment of the invention provides a kind of requesting node, and this requesting node comprises:
Insert the request initiation module, be used for initiating to insert request, insert the weighted value that comprises requesting node in the request to being requested node.
Further, this requesting node also comprises:
Order module is used for according to value two-way time order from small to large standby father node being sorted, and generates standby father node tabulation, the minimum node of pointed value two-way time of standby father node tabulation;
As a kind of preferred scheme, this requesting node also comprises:
Update module is used for upgrading the weighted value of self when being requested node and being called requesting node and selecting father node.
Embodiment 4
The embodiment of the invention provides a kind of node that is requested, and this is requested node and comprises:
Judge module is used to receive the access request that requesting node sends, and is requested the father node whether node can become requesting node according to inserting the weighted value judgement that comprises in the request.
Further, being requested node also comprises:
The weighted value comparison module is used for the weighted value of self and the weighted value of requesting node are compared;
Available bandwidth is module relatively, is used at the weighted value of requesting node than the described weighted value that is requested node hour available bandwidth of self and the streaming media playing speed of being asked being compared.
The father node determination module, the available bandwidth that is used for comparing self in available bandwidth comparison module is during greater than the streaming media playing speed of being asked, then the weighted value of all child nodes of self and the weighted value of requesting node are compared, if the weighted value of all child nodes of self is littler than the weighted value of requesting node, then self become the father node of requesting node.
The node handover module, be used at self available bandwidth less than the streaming media playing speed of being asked, then the weighted value of all child nodes of self and the weighted value of requesting node are compared, if there be the weighted value node littler in all child nodes of self than the weighted value of requesting node, then the minimum node of value two-way time in the child node of self is switched to the child node of requesting node, and with the child node of requesting node as self.
As another kind of scheme, this is requested node and also comprises:
Update module is used for upgrading the weighted value of self when being requested node and becoming requesting node and select father node.
When this programme uses the node choice mechanism of requesting node driving, be used in combination and be requested the access control mechanism that node drives, improved the overall efficiency of network, guaranteed speech quality between node, improve the available bandwidth ratio of system, reduced the multicast tree degree of depth.Simultaneously for being requested the alternative father node that node is recommended, requesting node is not directly it to be served as the father node request, again select but it is added in the tabulation of alternative father node, avoided the second-rate but still situation that serve to its request of the alternative father node direct link of requesting node and recommendation.
The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being done, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (20)
1. the father node system of selection of a multi-cast system is characterized in that, described method comprises:
Requesting node initiates to insert request to being requested node, comprises the weighted value of described request node in the described access request;
Judge the described father node whether node can become the described request node that is requested according to described weighted value.
2, the father node system of selection of multi-cast system as claimed in claim 1 is characterized in that, the described request node is specially to being requested node initiation access request:
The described request node selects in the tabulation of standby father node to be worth minimum two-way time pairing node as being requested node, and initiates to insert request to the described node that is requested;
The pointed of described standby father node tabulation is worth pairing node as the described node that is requested time little two-way time.
3, the father node system of selection of multi-cast system as claimed in claim 1, it is characterized in that, described weighted value is held the weighted value sum decision of all child nodes of the contribution of ability, node of new node and node by node, described node holds available bandwidth that the ability of new node equals node divided by streaming media playing speed, and the contribution of described node equals the linking number of uploading of node.
4, the father node system of selection of multi-cast system as claimed in claim 1 is characterized in that, describedly judges that according to described weighted value the described step that is requested node and whether can becomes the father node of described request node specifically comprises:
Be requested the described weighted value of node and the described weighted value of described request node compares with described, if the described weighted value of described request node is littler than the described described weighted value that is requested node, then the described available bandwidth that is requested node is compared with the streaming media playing speed of being asked, and carry out father node according to comparative result and select.
5, the father node system of selection of multi-cast system as claimed in claim 4 is characterized in that, the step that the described weighted value of described described weighted value that is requested node and described request node is compared also comprises:
If the described weighted value of described request node is bigger than the described described weighted value that is requested node, then with weighted value maximum described in the described father node that is requested node returns to the described request node as alternative father node, and carries out father node again by the described request node and select.
6, the father node system of selection of multi-cast system as claimed in claim 4 is characterized in that, describedly carries out the step that father node selects according to comparative result and specifically comprises:
If the described available bandwidth of node that is requested is greater than described streaming media playing speed of asking, then the weighted value of described all child nodes that are requested node and the weighted value of described request node are compared, if it is littler than the weighted value of described request node to be requested the weighted value of all child nodes of node, then describedly be requested the father node that node becomes the described request node;
If the described available bandwidth of node that is requested is less than described streaming media playing speed of asking, then the weighted value of described all child nodes that are requested node and the weighted value of described request node are compared, there be the weighted value node littler if be requested in all child nodes of node than the weighted value of described request node, then the minimum node of value two-way time in the described child node that is requested node is switched to the child node of described request node, and with the described request node as the described child node that is requested node.
7, the father node system of selection of multi-cast system as claimed in claim 6, it is characterized in that, if the described available bandwidth that is requested node is greater than described streaming media playing speed of asking, then the step that the weighted value of the weighted value of described all child nodes that are requested node and described request node is compared also comprises:
There is the weighted value node bigger if be requested in all child nodes of node than the weighted value of described request node, then be requested the child node that all weighted values are bigger than the weighted value of described request node in the node child node and return to the described request node as alternative father node described, the described request node carries out father node again and selects.
8, the father node system of selection of multi-cast system as claimed in claim 6, it is characterized in that, describedly be requested the child node that the minimum node of value two-way time in the node switches to the described request node, and the described request node specifically comprised as the described step that is requested the child node of node described:
The described node that is requested is adjusted message to the child node broadcasting father node littler than described request node weights value;
All child nodes that receive described father node adjustment message are connected with described request node foundation transmission;
Calculate the described request node and set up the value of transmitting between the child node that be connected described be requested node two-way time, and will be worth the child node that minimum node switches to the described request node two-way time, and with the described request node as the described child node that is requested node.
9, the father node system of selection of multi-cast system as claimed in claim 4 is characterized in that, describedly carries out also comprising after the step that father node selects according to comparative result:
The downloading rate and the streaming media playing speed of described request node are compared, if described downloading rate is greater than described streaming media playing speed, described request node receiving stream media data then, if described downloading rate less than described streaming media playing speed, is then carried out father node again by the described request node and is selected.
10, the father node system of selection of multi-cast system as claimed in claim 4 is characterized in that, describedly carries out also comprising after the step that father node selects according to comparative result:
Described request node and describedly be requested the renewal that node carries out weighted value.
11, the system of a kind of father node of multi-cast system selection is characterized in that described system comprises:
Insert the request initiation module, be used for initiating to insert request, comprise the weighted value of requesting node in the described access request;
Judge module is used to receive described access request, and is requested the father node whether node can become the described request node according to the weighted value judgement that comprises in the described access request.
12, the system of the father node of multi-cast system as claimed in claim 11 selection is characterized in that described system also comprises:
Order module is used for according to value two-way time order from small to large standby father node being sorted, and generates standby father node tabulation, the minimum node of pointed value two-way time of described standby father node tabulation;
The weighted value acquisition module is used for obtaining the weighted value of all nodes of network.
13, the system of selecting as the father node of claim 11 or 12 described multi-cast systems is characterized in that described system also comprises:
The weighted value comparison module is used for the weighted value and the described weighted value that is requested node of described request node are compared;
Available bandwidth is module relatively, is used at the described weighted value of described request node than the described described weighted value that is requested node hour the described streaming media playing speed that is requested the available bandwidth of node and is asked being compared;
The father node determination module, be used for when described available bandwidth comparison module compares the described available bandwidth that is requested node greater than described streaming media playing speed of asking, then the weighted value of described all child nodes that are requested node and the weighted value of described request node are compared, if it is littler than the weighted value of described request node to be requested the weighted value of all child nodes of node, then describedly be requested the father node that node becomes the described request node;
The node handover module, be used at the described available bandwidth of node that is requested less than described streaming media playing speed of asking, then the weighted value of described all child nodes that are requested node and the weighted value of described request node are compared, there be the weighted value node littler if be requested in all child nodes of node than the weighted value of described request node, then the minimum node of value two-way time in the described child node that is requested node is switched to the child node of described request node, and with the described request node as the described child node that is requested node.
14, the system of selecting as the father node of any described multi-cast system of claim of claim 11-13 is characterized in that described system also comprises:
Update module is used for upgrading the weighted value of all nodes in the network when the described request node is selected the father node success.
15, a kind of requesting node is characterized in that, the described request node comprises:
The weighted value acquisition module is used for being obtained from the weighted value in network when access network;
Insert the request initiation module, be used for initiating to insert request, comprise the weighted value of requesting node in the described access request to being requested node.
16, requesting node as claimed in claim 15 is characterized in that, the described request node also comprises:
Order module is used for according to value two-way time order from small to large standby father node being sorted, and generates standby father node tabulation, the minimum node of pointed value two-way time of described standby father node tabulation.
17, as claim 15 or 16 described requesting nodes, it is characterized in that the described request node also comprises:
Update module is used for upgrading the weighted value of self when self selecting the father node success.
18, a kind of node that is requested is characterized in that, the described node that is requested comprises:
The weighted value acquisition module is used for being obtained from the weighted value in network when access network;
Judge module is used to receive the access request that requesting node sends, and judges according to the weighted value that comprises in the described access request whether self can become the father node of described request node.
19, requesting node as claimed in claim 18 is characterized in that, the described node that is requested also comprises:
The weighted value comparison module is used for the weighted value of self and the weighted value of requesting node are compared;
Available bandwidth is module relatively, is used at the described weighted value of described request node than the described described weighted value that is requested node hour available bandwidth of self and the streaming media playing speed of being asked being compared;
The father node determination module, the available bandwidth that is used for comparing self in described available bandwidth comparison module is during greater than described streaming media playing speed of asking, then the weighted value of all child nodes of self and the weighted value of described request node are compared, if the weighted value of all child nodes of self is littler than the weighted value of described request node, the then described father node that self becomes the described request node;
The node handover module, be used at self available bandwidth less than described streaming media playing speed of asking, then the weighted value of all child nodes of self and the weighted value of described request node are compared, if there be the weighted value node littler in all child nodes of self than the weighted value of described request node, then the minimum node of value two-way time in described self the child node is switched to the child node of described request node, and with the child node of described request node as self.
As claim 18 or 19 described requesting nodes, it is characterized in that 20, the described node that is requested also comprises:
Update module is used for when described upgrading the weighted value of self when being requested node and becoming the father node of requesting node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100066126A CN101499914B (en) | 2008-01-28 | 2008-01-28 | Parent node selection method, system and node for multicast system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100066126A CN101499914B (en) | 2008-01-28 | 2008-01-28 | Parent node selection method, system and node for multicast system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101499914A true CN101499914A (en) | 2009-08-05 |
| CN101499914B CN101499914B (en) | 2012-07-04 |
Family
ID=40946805
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008100066126A Expired - Fee Related CN101499914B (en) | 2008-01-28 | 2008-01-28 | Parent node selection method, system and node for multicast system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101499914B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102006610A (en) * | 2010-12-24 | 2011-04-06 | 南京大学 | Dynamic adjustment method of nodes in Internet of Things system |
| CN102237978A (en) * | 2010-04-27 | 2011-11-09 | 华为技术有限公司 | Collaborative link establishment and maintenance method and related device |
| CN102523314A (en) * | 2010-12-16 | 2012-06-27 | 微软公司 | Identifying an efficient destination server |
| CN102571737A (en) * | 2010-12-30 | 2012-07-11 | 财团法人工业技术研究院 | Point-to-point network transmission method and system for real-time media code stream |
| WO2015096432A1 (en) * | 2013-12-27 | 2015-07-02 | 中兴通讯股份有限公司 | Method and system for controlling network topology structure |
| CN104780468A (en) * | 2014-01-09 | 2015-07-15 | 富士通株式会社 | Streaming system and node device used in streaming system |
| WO2017035789A1 (en) * | 2015-09-01 | 2017-03-09 | 深圳好视网络科技有限公司 | Data transmission method and system |
| CN107276993A (en) * | 2017-05-27 | 2017-10-20 | 南京邮电大学 | A kind of VoD based on P2P of collaboration node selecting method |
| CN107566321A (en) * | 2016-06-30 | 2018-01-09 | 南京中兴新软件有限责任公司 | The sending method of file, apparatus and system |
| CN112804068A (en) * | 2021-03-19 | 2021-05-14 | 恒生电子股份有限公司 | Method and device for setting sending sequence, readable medium and electronic equipment |
| CN113625920A (en) * | 2021-08-19 | 2021-11-09 | 重庆允成互联网科技有限公司 | Use control system and method based on tree diagram organization structure selector |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE60320104T2 (en) * | 2002-12-11 | 2009-05-14 | Nippon Telegraph & Telephone Co. | Method and device for calculating multicast routes |
| KR100744786B1 (en) * | 2005-11-03 | 2007-08-02 | 엘지전자 주식회사 | System and method for transmitting media stream |
-
2008
- 2008-01-28 CN CN2008100066126A patent/CN101499914B/en not_active Expired - Fee Related
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102237978A (en) * | 2010-04-27 | 2011-11-09 | 华为技术有限公司 | Collaborative link establishment and maintenance method and related device |
| CN102237978B (en) * | 2010-04-27 | 2013-12-04 | 华为技术有限公司 | Collaborative link establishment and maintenance method and related device |
| US9686229B2 (en) | 2010-12-16 | 2017-06-20 | Microsoft Technology Licensing, Llc | Identifying an efficient destination server |
| CN102523314A (en) * | 2010-12-16 | 2012-06-27 | 微软公司 | Identifying an efficient destination server |
| CN102006610B (en) * | 2010-12-24 | 2012-11-07 | 南京大学 | Dynamic adjustment method of nodes in Internet of Things system |
| CN102006610A (en) * | 2010-12-24 | 2011-04-06 | 南京大学 | Dynamic adjustment method of nodes in Internet of Things system |
| CN102571737A (en) * | 2010-12-30 | 2012-07-11 | 财团法人工业技术研究院 | Point-to-point network transmission method and system for real-time media code stream |
| WO2015096432A1 (en) * | 2013-12-27 | 2015-07-02 | 中兴通讯股份有限公司 | Method and system for controlling network topology structure |
| CN104780468B (en) * | 2014-01-09 | 2018-06-12 | 富士通株式会社 | Stream medium data method of reseptance, stream media system and the node apparatus in stream media system |
| CN104780468A (en) * | 2014-01-09 | 2015-07-15 | 富士通株式会社 | Streaming system and node device used in streaming system |
| WO2017035789A1 (en) * | 2015-09-01 | 2017-03-09 | 深圳好视网络科技有限公司 | Data transmission method and system |
| CN107566321A (en) * | 2016-06-30 | 2018-01-09 | 南京中兴新软件有限责任公司 | The sending method of file, apparatus and system |
| CN107566321B (en) * | 2016-06-30 | 2021-06-15 | 中兴通讯股份有限公司 | File sending method, device and system |
| CN107276993A (en) * | 2017-05-27 | 2017-10-20 | 南京邮电大学 | A kind of VoD based on P2P of collaboration node selecting method |
| CN112804068A (en) * | 2021-03-19 | 2021-05-14 | 恒生电子股份有限公司 | Method and device for setting sending sequence, readable medium and electronic equipment |
| CN112804068B (en) * | 2021-03-19 | 2021-06-18 | 恒生电子股份有限公司 | Method and device for setting sending sequence, readable medium and electronic equipment |
| CN113625920A (en) * | 2021-08-19 | 2021-11-09 | 重庆允成互联网科技有限公司 | Use control system and method based on tree diagram organization structure selector |
| CN113625920B (en) * | 2021-08-19 | 2023-12-26 | 重庆允丰科技有限公司 | Use control system and method based on tree diagram organization architecture selector |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101499914B (en) | 2012-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101499914B (en) | Parent node selection method, system and node for multicast system | |
| US8477658B2 (en) | Intelligent peer-to-peer media streaming | |
| CN100414539C (en) | Method for transmitting and downloading streaming data | |
| CN101543021A (en) | Contribution aware peer-to-peer live streaming service | |
| AU2020103384A4 (en) | Method for Constructing Energy-efficient Network Content Distribution Mechanism Based on Edge Intelligent Caches | |
| CN101272404B (en) | Link selection method of P2P video living broadcast system data scheduling | |
| US8150966B2 (en) | Multi-party cooperative peer-to-peer video streaming | |
| CN111046065B (en) | Extensible high-performance distributed query processing method and device | |
| WO2021169294A1 (en) | Application recognition model updating method and apparatus, and storage medium | |
| CN114760482B (en) | Live broadcast source returning method and device | |
| EP2375648B1 (en) | Method, system and node device for realizing audio mixing of multi-path voice | |
| CN110535770A (en) | A kind of video flowing method for intelligently routing based on QoS perception under SDN environment | |
| CN113472843A (en) | Greedy algorithm based MQTT protocol QoS mechanism selection method | |
| CN101645924A (en) | Selection method of cooperative nodes in P2P system | |
| Cao et al. | Family-aware pricing strategy for accelerating video dissemination over information-centric vehicular networks | |
| Li et al. | Multimedia cloud content distribution based on interest discovery and integrated utility of user | |
| He et al. | P2P Traffic Optimization based on Congestion Distance and DHT. | |
| CN116132403A (en) | Route distribution method and device of computing power network, electronic equipment and storage medium | |
| Li et al. | Deep reinforcement learning-based incentive mechanism design for short video sharing through D2D communication | |
| CN114584561A (en) | Information processing method and device and electronic equipment | |
| CN110138444B (en) | Multi-domain optical network dynamic multicast sharing protection method based on fuzzy game | |
| CN113658015A (en) | Analysis method for influencing information propagation by position and intervention time of intervention information | |
| Cheng et al. | A Forwarding Strategy Based on Recommendation Algorithm in Named Data Networking | |
| Mikhailenko et al. | Analysis of the adaptive neural network router | |
| Li et al. | Video Stream Session Migration Method Using Deep Reinforcement Learning in Cloud Computing Environment |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120704 Termination date: 20160128 |
|
| EXPY | Termination of patent right or utility model |