CN105656976A - Information pushing method and device for cluster system - Google Patents
Information pushing method and device for cluster system Download PDFInfo
- Publication number
- CN105656976A CN105656976A CN201410718674.5A CN201410718674A CN105656976A CN 105656976 A CN105656976 A CN 105656976A CN 201410718674 A CN201410718674 A CN 201410718674A CN 105656976 A CN105656976 A CN 105656976A
- Authority
- CN
- China
- Prior art keywords
- transmission
- node
- value
- total value
- line
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses an information pushing method and device for a cluster system. The method comprises the following steps of generating a transmission value matrix among all nodes according to transmission values between every two nodes in the cluster system; summing all the transmission values in each line in the transmission value matrix to obtain the total transmission value of each line, and determining nodes corresponding to a line, where the total transmission value is 0, and nodes corresponding to a line, where the total transmission value is maximum; iteratively calculating the transmission values of the line, where the total transmission value is maximum, and the transmission values of each line in the transmission value matrix so as to determine nodes having the maximum total transmission value till the total transmission value of each line in the transmission value matrix is 0; taking the determined nodes as target nodes; and pushing information to be pushed to the determined target nodes, such that the information to be pushed is pushed to other nodes through the determined target nodes. By means of the invention, information can be pushed to all the nodes in the cluster system; and the information pushing efficiency of the cluster system is increased.
Description
Technical field
The present invention relates to field of computer technology, be related specifically to information-pushing method and the device of group system.
Background technology
Along with the development of network technology, network incorporates in the middle of daily life, work gradually, for instance, the cluster etc. that the local area planar network architecture of company's structure or an operating service business build. In cluster, including multiple nodes, what these nodes had can intercom mutually, what have cannot intercom mutually, if cluster server to push information to all nodes in this group system, then need to select some nodes from the node of group system, and by these nodes by all nodes in the information pushing of server needs propelling movement to cluster.
At present, select node to complete the mode of information pushing to be: from the node of group system, select a part of node at random, and completed the process of information pushing by this part of nodes of selection. But, under this mode, there is the node that can not intercom mutually with other nodes in the node of selection, causes guarantee information to push to all nodes of group system so that the efficiency of group system information pushing is on the low side.
Summary of the invention
The embodiment of the present invention provides the information-pushing method of a kind of group system and device, it is intended to solve guarantee information to push to all nodes of group system so that the problem that the efficiency of group system information pushing is on the low side.
The embodiment of the present invention proposes the information-pushing method of a kind of group system, including step:
Obtain in information to be pushed and group system the transmission value between two between node, and generate the transmission value matrix between all nodes according to described transmission value;
All transmission values of a line every in described transmission value matrix are sued for peace and obtains the transmission total value of every a line, it is determined that transmission total value 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value;
The transmission value of the transmission value a line every with described transmission value matrix according to transmission total value maximum row is iterated calculating to determine maximum the be expert at corresponding node of new transmission total value, until the transmission total value of every a line is 0;
Using the node determined as destination node, described destination node includes transmission total value and 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value;
Described information to be pushed is pushed to the destination node determined, with the destination node being determined by, described information to be pushed is pushed to other nodes.
The embodiment of the present invention also proposes the information push-delivery apparatus of a kind of group system, including:
Acquisition module, for obtaining in information to be pushed and group system transmission value between node between two;
Generation module, for generating the transmission value matrix between all nodes according to described transmission value;
Determine module, obtain the transmission total value of every a line for all transmission values of a line every in described transmission value matrix are sued for peace, it is determined that transmission total value 0 is expert at the node of correspondence and transmit the maximum corresponding node of being expert at of total value; The transmission value of the transmission value a line every with described transmission value matrix according to transmission total value maximum row is iterated calculating to determine maximum the be expert at corresponding node of new transmission total value, until the transmission total value of every a line of described transmission value matrix is 0;
Processing module, for will the node that determine as destination node, described destination node includes transmission total value and 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value;
Pushing module, for described information to be pushed is pushed to the destination node determined, pushes to other nodes with the destination node being determined by by described information to be pushed.
The embodiment of the present invention is by building the transmission value matrix of all nodes in group system, and the transmission total value according to a line every in transmission value matrix selects transmission total value to be 0 and transmit the maximum node corresponding respectively of being expert at of total value as destination node, and completed the propelling movement of group system information by destination node. Realize guarantee information and push to all nodes of group system, improve the efficiency of group system information pushing.
Accompanying drawing explanation
Fig. 1 is the hardware architecture diagram of the information push-delivery apparatus place terminal of group system of the present invention;
Fig. 2 is the schematic flow sheet of the first embodiment of the information-pushing method of group system of the present invention;
Fig. 3 is the refinement schematic flow sheet of step S10 in Fig. 1;
Fig. 4 is the refinement schematic flow sheet of step S30 mono-embodiment in Fig. 1;
Fig. 5 is the schematic flow sheet of the second embodiment of the information-pushing method of group system of the present invention;
Fig. 6 is the high-level schematic functional block diagram of the preferred embodiment of the information push-delivery apparatus of group system of the present invention;
Fig. 7 is the refinement high-level schematic functional block diagram determining module in Fig. 6;
Fig. 8 is the refinement high-level schematic functional block diagram of acquisition module in Fig. 6.
The realization of the object of the invention, functional characteristics and advantage will in conjunction with the embodiments, are described further with reference to accompanying drawing.
Detailed description of the invention
Should be appreciated that specific embodiment described herein is only in order to explain the present invention, is not intended to limit the present invention.
The primary solutions of the embodiment of the present invention is: obtains in information to be pushed and group system the transmission value between two between node, and generates the transmission value matrix between all nodes according to described transmission value; All transmission values of a line every in described transmission value matrix are sued for peace and obtains the transmission total value of every a line, it is determined that transmission total value 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value; The transmission value of the transmission value a line every with described transmission value matrix according to transmission total value maximum row is iterated calculating to determine maximum the be expert at corresponding node of new transmission total value, until the transmission total value of every a line is 0;Using the node determined as destination node, described destination node includes transmission total value and 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value; Described information to be pushed is pushed to the destination node determined, with the destination node being determined by, described information to be pushed is pushed to other nodes. By building the transmission value matrix of all nodes in group system, and the transmission total value according to a line every in transmission value matrix selects transmission total value to be 0 and transmit the maximum node corresponding respectively of being expert at of total value as destination node, and completed the propelling movement of group system information by destination node. Realize guarantee information and push to all nodes of group system, improve the efficiency of group system information pushing.
Owing to the selection of existing group system interior joint is all select part of nodes by random manner, and complete, by the part of nodes randomly choosed, the process that letter pushes. But, there is the node that can not intercom mutually with other nodes in the node that randomly chooses, causes guarantee information to push to all nodes of group system so that the efficiency of group system information pushing is on the low side.
Based on the problems referred to above, the information push-delivery apparatus of embodiment of the present invention framework one group system, the information push-delivery apparatus of this group system builds the transmission value matrix of all nodes in group system, and the transmission total value according to a line every in transmission value matrix selects transmission total value to be 0 and transmit the maximum node corresponding respectively of being expert at of total value as destination node, and completed the propelling movement of group system information by destination node. Realize guarantee information and push to all nodes of group system, improve the efficiency of group system information pushing.
Wherein, the information push-delivery apparatus of the present embodiment group system can be carried on PC end, it is also possible to is carried on mobile phone, panel computer etc. and can use the mobile terminal of the network applications such as game. The hardware structure of the information push-delivery apparatus of this group system can be as shown in Figure 1.
Fig. 1 is total line chart of the information push-delivery apparatus place terminal of group system in the embodiment of the present invention. This terminal may include that at least one processor 301, for instance CPU, at least one network interface 304, user interface 303, memorizer 305, at least one communication bus 302. Wherein, communication bus 302 is for realizing the connection communication between these assemblies. Wherein, user interface 303 can include display screen (Display), keyboard (Keyboard), it is also possible to includes the wireline interface of standard, wave point. Network interface 304 can include the wireline interface of standard, wave point (such as radio network interface). Memorizer 305 can be high-speed RAM memorizer, it is also possible to be non-labile memorizer (non-volatilememory), for instance at least one disk memory. Memorizer 305 can also is that at least one is located remotely from the storage device of aforementioned processor 301. As the information pushing program that can include operating system, network communication module, Subscriber Interface Module SIM and group system in the memorizer 305 of a kind of computer-readable storage medium.
The group system shown in Fig. 1 information push-delivery apparatus institute in the terminal, network interface 304 is mainly used in Connection Service device, carries out data communication with server; And user interface 303 is mainly used in receiving user instruction, and interact with user; And processor 301 may be used for calling the information pushing program of the group system of storage in memorizer 305, and perform following operation:
Obtain in information to be pushed and group system the transmission value between two between node, and generate the transmission value matrix between all nodes according to described transmission value;
All transmission values of a line every in described transmission value matrix are sued for peace and obtains the transmission total value of every a line, it is determined that transmission total value 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value;
The transmission value of the transmission value a line every with described transmission value matrix according to transmission total value maximum row is iterated calculating to determine maximum the be expert at corresponding node of new transmission total value, until the transmission total value of every a line is 0;
Using the node determined as destination node, described destination node includes transmission total value and 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value;
Described information to be pushed is pushed to the destination node determined, with the destination node being determined by, described information to be pushed is pushed to other nodes.
In one embodiment, processor 301 calls the information pushing program of the group system of storage in memorizer 305 and can also carry out following operation:
When the transmission total value of every a line of described transmission matrix is not 0, transmission value corresponding with every a line of described transmission value matrix respectively for the transmission value of transmission total value maximum row is calculated according to preset formula, obtains current transmission value matrix according to the result of calculation of every a line;
All transmission values of a line every in described current transmission value matrix are sued for peace and obtains the transmission total value of every a line, it is determined that the node of the maximum correspondence of being expert at of new transmission value;
The transmission value that the transmission value of transmission value maximum row is corresponding with every a line of described current transmission matrix respectively is calculated according to preset formula, obtains new current transmission value matrix, until the transmission total value of every a line of described current transmission matrix is 0.
In one embodiment, processor 301 calls the information pushing program of the group system of storage in memorizer 305 and can also carry out following operation:
Obtain in group system the transmission time between two between node;
When acquired transmission time value is more than preset time threshold, it is determined that transmission time value is 0 more than the transmission value between node between two of preset time threshold;
When acquired transmission time value is not more than preset time threshold, it is determined that it is 1 that transmission time value is not more than the transmission value between node between two of preset time threshold.
In one embodiment, processor 301 calls the information pushing program of the group system of storage in memorizer 305 and can also carry out following operation:
Described preset formula be Fcal (a, b)=y, wherein, a is the transmission value of transmission value maximum row, and b is the transmission value of every a line in transmission matrix, when a=0, b=1, y=1.
In one embodiment, processor 301 calls the information pushing program of the group system of storage in memorizer 305 and can also carry out following operation:
The quantity of the node of the maximum correspondence of being expert at of transmission total value is determined from the transmission total value of the every a line obtained;
When transmitting the maximum node being expert at correspondence of total value and being multiple, from the node of the maximum correspondence of being expert at of described transmission total value, randomly choose the node node as the maximum correspondence of being expert at of final transmission total value.
In one embodiment, processor 301 calls the information pushing program of the group system of storage in memorizer 305 and can also carry out following operation:
Maximum for the transmission total value finally the determined node being expert at correspondence is abandoned;
From determined node using except described in abandon node except other nodes as destination node, described destination node includes transmission total value and 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value.
The present embodiment passes through such scheme, build the transmission value matrix of all nodes in group system, and the transmission total value according to a line every in transmission value matrix selects transmission total value to be 0 and transmit the maximum node corresponding respectively of being expert at of total value as destination node, and completed the propelling movement of group system information by destination node. Realize guarantee information and push to all nodes of group system, improve the efficiency of group system information pushing.
Based on the hardware structure involved by the information push-delivery apparatus of above-mentioned group system, it is proposed to the information-pushing method embodiment of group system of the present invention.
As in figure 2 it is shown, the flow chart of the first embodiment of the information-pushing method that Fig. 2 is group system of the present invention. The information-pushing method of the group system that the present embodiment is mentioned comprises the following steps:
Step S10, obtains in group system the transmission value between two between node, and generates the transmission value matrix between all nodes according to described transmission value;
Described transmission value between node between two is determined according to described transmission time value between node between two. With reference to Fig. 3, described acquisition transmission between node between two process extremely may include that
Step S11, obtains in group system the transmission time between two between node, in described acquisition group system between two between node transmission the time process include: select a node, and set up this node and the connection of all nodes in cluster, then one test file of transmitted in both directions, the transmission time of record test file, such as, create between a node and b node and connect, from a node-node transmission test file to b node, and by test file from b node-node transmission to a node, the transmission time of record test file, Tab, for test file from a node-node transmission to the transmission time of b node, it is that test file is from b node-node transmission to the transmission time of a node with Tba, using Tab as the transmission time between node a and node b or using node Tba as the transmission time between node a and node b. in order to ensure to transmit between the node obtained the accuracy of time, it is possible to be calculate (Tab+Tba)/2=T, using the time T that obtains as the transmission time between node a and node b.
Step S12, when acquired transmission time value is more than preset time threshold, it is determined that transmission time value is 0 more than the transmission value between node between two of preset time threshold;
Step S13, when acquired transmission time value is not more than preset time threshold, it is determined that it is 1 that transmission time value is not more than the transmission value between node between two of preset time threshold.
Arranging a connection transmission time threshold in advance, described preset time threshold can be set the transmission time that 20ms, 30ms or 40ms etc. successfully transmit according to communication information between node and node. After getting transmission time between node between two, by the transmission time got and described preset time threshold comparison, when transmission time between node between two is not more than described preset time threshold, judge that the transmission time is not more than the described of described preset time threshold and connects between node between two, transmission time between node between two more than described preset time threshold time, it is determined that the transmission time does not connect between node between two described in described preset time threshold. When acquired transmission time value is more than preset time threshold, it is determined that transmission time value is 0 more than the transmission value between node between two of preset time threshold, when namely transmission value is 0, represents this and can connect between node between two, it is possible to transmit data;When acquired transmission time value is not more than preset time threshold, it is determined that it is 1 that transmission time value is not more than the transmission value between node between two of preset time threshold, when namely transmission value is 1, represents this and can not connect between node between two, it is impossible to transmit data.
In getting group system after transmission value between all nodes, generate the transmission value matrix between all nodes according to acquired transmission value. Such as, node 0, node 1, node 2, node 3, node 4 and node 5 are included in group system. Reference table 1, builds in this group system the transmission value matrix between all nodes according to the transmission value between node and node. Described transmission value matrix is symmetrical matrix.
| Node 0 | Node 1 | Node 2 | Node 3 | Node 4 | |
| Node 0 | 0 | 1 | 1 | 1 | 0 |
| Node 1 | 1 | 0 | 1 | 1 | 0 |
| Node 2 | 1 | 1 | 0 | 0 | 0 |
| Node 3 | 1 | 1 | 0 | 0 | 0 |
| Node 4 | 0 | 0 | 0 | 0 | 0 |
Table 1
All transmission values of a line every in described transmission value matrix are sued for peace and are obtained the transmission total value of every a line by step S20, it is determined that transmission total value 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value;
Reference table 1, all transmission summations to a line every in described transmission value matrix, obtain the transmission total value of every a line, such as, the transmission total value of the row at node 0 place is: 0+1+1+1+1+0=3, and the transmission total value of the row at node 1 place is: 1+0+1+1+0=3, and the transmission total value of the row at node 2 place is: 1+1+0+0+0=2, the transmission total value of the row at node 3 place is: 1+1+0+0+0=2, and the transmission total value of the row at node 4 place is: 0+0+0+0+0=0. Determine node 4 be transmission total value be the node of 0, namely node 4 is not interconnected with other nodes in group system, being the maximum corresponding node of being expert at of transmission total value for isolated node, node 0 and node 1, namely node 0 is identical with the number of the node that node 1 is interconnected with group system. The transmission total value that there are two nodes is maximum, from node 0 and node 1, then randomly choose the node node as the maximum correspondence of being expert at of final transmission total value, such as, select node 0 as the node of the maximum correspondence of being expert at of transmission total value, or select node 1 as the node of the maximum correspondence of being expert at of transmission total value. The node selecting node 0 as the maximum correspondence of being expert at of transmission total value it is preferably at the present embodiment.
Step S30, is iterated calculating to determine maximum the be expert at corresponding node of new transmission total value according to the transmission value of transmission value a line every with described transmission value matrix of transmission total value maximum row, until the transmission total value of every a line of described transmission value matrix is 0;
Arranging a formula in advance, described preset formula can be that (a, b)=y, wherein, a is the transmission value of transmission value maximum row to Fcal, and b is the transmission value of every a line in transmission matrix, and when a=0, b=1, y=1, when a, b are other values, y is 0.
Further, with reference to Fig. 4, the transmission value of every a line is iterated calculating the node maximum to determine transmission total value the described transmission value according to transmission total value maximum row with described transmission value matrix, until the process that transmission total value is 0 of every a line of described transmission value matrix may is that
Step S31, when the transmission total value of every a line of described transmission matrix is not 0, transmission value corresponding with every a line of described transmission value matrix respectively for the transmission value of transmission total value maximum row is calculated according to preset formula, obtains current transmission value matrix according to the result of calculation of every a line;
Reference table 1, the row at transmission value maximum behavior node 0 place determined, when the transmission total value of every a line of described transmission matrix is not 0, the transmission value that the transmission value of the row at node 0 place is corresponding with every a line of described transmission value matrix is calculated according to preset formula, transmission value (0 by the row at node 0 place, 1, 1, 1, 0) with the row at transmission matrix interior joint 0 place, the row at node 1 place, the row at node 2 place, the row at node 3 place, the transmission value of the row correspondence at node 4 place is according to Fcal (a, b)=y is calculated, such as, the value that the capable corresponding transmission value at the transmission value of the row at node 0 place and node 1 place obtains after calculating according to described preset formula respectively (1, 0, 0, 0, 0), the value that the capable corresponding transmission value at the transmission value of the row at node 0 place and node 2 place obtains after calculating according to described preset formula respectively (1, 0, 0, 0, 0), result of calculation according to every a line obtains current transmission value matrix reference table 2.
| Node 0 | Node 1 | Node 2 | Node 3 | Node 4 | |
| Node 0 | 0 | 0 | 0 | 0 | 0 |
| Node 1 | 1 | 0 | 0 | 0 | 0 |
| Node 2 | 1 | 0 | 0 | 0 | 0 |
| Node 3 | 1 | 0 | 0 | 0 | 0 |
| Node 4 | 0 | 0 | 0 | 0 | 0 |
Table 2
All transmission values of a line every in described current transmission value matrix are sued for peace and are obtained the transmission total value of every a line by step S32, it is determined that the node of the maximum correspondence of being expert at of transmission value; Transmission value matrix in reference table 2, obtains the transmission total value of every a line respectively 0,1,1,1,0. Wherein, node 1, the transmission total value of the row at the place of node 2 and node 3 is maximum is 1, then randomly choose the node 1 node for the maximum correspondence of being expert at of transmission total value.
Step S33, the transmission value that the transmission value of transmission value maximum row is corresponding with every a line of described current transmission matrix respectively is calculated according to preset formula, obtains new current transmission value matrix, until the transmission total value of every a line of described current transmission matrix is 0.
According to the process in step S31, obtain new current transmission value matrix, as shown in table 3.
| Node 0 | Node 1 | Node 2 | Node 3 | Node 4 | |
| Node 0 | 0 | 0 | 0 | 0 | 0 |
| Node 1 | 0 | 0 | 0 | 0 | 0 |
| Node 2 | 0 | 0 | 0 | 0 | 0 |
| Node 3 | 0 | 0 | 0 | 0 | 0 |
| Node 4 | 0 | 0 | 0 | 0 | 0 |
Table 3
Reference table 3, the transmission total value of every a line of described current transmission value matrix is 0, it is determined that node include node 0, node 4 and node 1. Wherein, the point that node 4 is isolated does not connect with other nodes in group system, and node 0 is maximum with the number of the node connected in group system with node 4.
Step S40, it is to be determined to node as destination node, described destination node includes transmission total value and 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value;
Step S50, obtains information to be pushed, and by described information pushing to the destination node determined, the destination node being determined by is by described information pushing to other nodes.
Using node 0, node 1 and node 4 as destination node, information is first pushed to node 1, node 4 and node 0 by cluster service, then by node 1 and node 0 by described information pushing to node 2 and node 3, to complete the information pushing purpose to whole group system. In other embodiments of the present invention, also can also is that and remove to determine destination node according to the mode of row, process is identical according to the mode of row with above-mentioned, and this is no longer going to repeat them.
The embodiment of the present invention is by building the transmission value matrix of all nodes in group system, and the transmission total value according to a line every in transmission value matrix selects transmission total value to be 0 and transmit the maximum node of total value as destination node, and completed the propelling movement of group system information by destination node. Realize guarantee information and push to all nodes of group system, improve the efficiency of group system information pushing.
Further, based on the first embodiment of the information-pushing method of above-mentioned group system, it is proposed to the second embodiment of the present invention. As it is shown in figure 5, described step S40 may include that
Step S41, abandons maximum for the transmission total value finally the determined node being expert at correspondence;
Such as, reference table 1, table 2 and table 3, the maximum node being expert at correspondence of transmission total value finally determined is node 1, is abandoned by node 1, does not namely select node 1 to transmit the node of carrier as information.
Step S42, from determined node using except described in abandon node except other nodes as destination node, described destination node includes transmission total value and 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value.
From determined node 0, in node 1 and node 4, remove outside node 1, select to determine by node 0 and node 4, as destination node, certainly the node selected includes the node 0 of node 4 correspondence of being expert at maximum with transmission total value that transmission total value is 0, the server of group system pushes information to node 0 and node 4, because of node 0 respectively with node 1, node 2 connects with node 3, by node 0 by described information pushing to node 1 after node 0 receives the information that cluster server pushes, node 2 and node 3, realize the purpose of nodes all in described information pushing to cluster.
Maximum for the transmission total value finally the determined node being expert at correspondence, when the transmission total value of every a line of transmission value matrix is 0, is abandoned by the embodiment of the present invention. While ensureing the information pushing of server push to nodes all in group system, select minimum node, and then reduce system resource, improve systematic function, it is ensured that the Effec-tive Function of group system.
The preferred embodiment of the information push-delivery apparatus of corresponding proposition group system of the present invention. As shown in Figure 6, described device includes: acquisition module 10, generation module 20, determines module 30, processing module 40 and pushing module 50.
Described acquisition module 10, for obtaining in information to be pushed and group system transmission value between node between two;
Described generation module 20, for generating the transmission value matrix between all nodes according to described transmission value;
Obtain information to be pushed, and obtain in group system transmission value between node between two.
Described transmission value between node between two is determined according to described transmission time value between node between two. With reference to Fig. 7, described acquisition module 10 includes acquiring unit 11 and identifying unit 12,
Described acquiring unit 11, for obtaining in group system transmission time between node between two, in described acquisition group system between two between node transmission the time process include: select a node, and set up this node and the connection of all nodes in cluster, then one test file of transmitted in both directions, the transmission time of record test file, such as, create between a node and b node and connect, from a node-node transmission test file to b node, and by test file from b node-node transmission to a node, the transmission time of record test file, Tab, for test file from a node-node transmission to the transmission time of b node, it is that test file is from b node-node transmission to the transmission time of a node with Tba, using Tab as the transmission time between node a and node b or using node Tba as the transmission time between node a and node b. in order to ensure to transmit between the node obtained the accuracy of time, it is possible to be calculate (Tab+Tba)/2=T, using the time T that obtains as the transmission time between node a and node b.
Described identifying unit 12, for when acquired transmission time value is more than preset time threshold, it is determined that transmission time value is 0 more than the transmission value between node between two of preset time threshold; When acquired transmission time value is not more than preset time threshold, it is determined that it is 1 that transmission time value is not more than the transmission value between node between two of preset time threshold.
Arranging a connection transmission time threshold in advance, described preset time threshold can be set the transmission time that 20ms, 30ms or 40ms etc. successfully transmit according to communication information between node and node. After getting transmission time between node between two, by the transmission time got and described preset time threshold comparison, when transmission time between node between two is not more than described preset time threshold, judge that the transmission time is not more than the described of described preset time threshold and connects between node between two, transmission time between node between two more than described preset time threshold time, it is determined that the transmission time does not connect between node between two described in described preset time threshold. When acquired transmission time value is more than preset time threshold, it is determined that transmission time value is 0 more than the transmission value between node between two of preset time threshold, when namely transmission value is 0, represents this and can connect between node between two, it is possible to transmit data;When acquired transmission time value is not more than preset time threshold, it is determined that it is 1 that transmission time value is not more than the transmission value between node between two of preset time threshold, when namely transmission value is 1, represents this and can not connect between node between two, it is impossible to transmit data.
In getting group system after transmission value between all nodes, generate the transmission value matrix between all nodes according to acquired transmission value. Such as, node 0, node 1, node 2, node 3, node 4 and node 5 are included in group system. Reference table 1, builds in this group system the transmission value matrix between all nodes according to the transmission value between node and node. Described transmission value matrix is symmetrical matrix.
Described determine module 30, obtain the transmission total value of every a line for all transmission values of a line every in described transmission value matrix are sued for peace, it is determined that transmission total value 0 is expert at the node of correspondence and transmit the maximum corresponding node of being expert at of total value;
Reference table 1, all transmission summations to a line every in described transmission value matrix, obtain the transmission total value of every a line, such as, the transmission total value of the row at node 0 place is: 0+1+1+1+1+0=3, and the transmission total value of the row at node 1 place is: 1+0+1+1+0=3, and the transmission total value of the row at node 2 place is: 1+1+0+0+0=2, the transmission total value of the row at node 3 place is: 1+1+0+0+0=2, and the transmission total value of the row at node 4 place is: 0+0+0+0+0=0. Determine node 4 be transmission total value be the node of 0, namely node 4 is not interconnected with other nodes in group system, being the maximum corresponding node of being expert at of transmission total value for isolated node, node 0 and node 1, namely node 0 is identical with the number of the node that node 1 is interconnected with group system. The transmission total value that there are two nodes is maximum, from node 0 and node 1, then randomly choose the node node as the maximum correspondence of being expert at of final transmission total value, such as, select node 0 as the node of the maximum correspondence of being expert at of transmission total value, or select node 1 as the node of the maximum correspondence of being expert at of transmission total value. The node selecting node 0 as the maximum correspondence of being expert at of transmission total value it is preferably at the present embodiment.
Described determine module 30, the transmission value being additionally operable to the transmission value a line every with described transmission value matrix according to transmission total value maximum row is iterated calculating to determine maximum the be expert at corresponding node of new transmission total value, until the transmission total value of every a line of described transmission value matrix is 0;
Arranging a formula in advance, described preset formula can be that (a, b)=y, wherein, a is the transmission value of transmission value maximum row to Fcal, and b is the transmission value of every a line in transmission matrix, and when a=0, b=1, y=1, when a, b are other values, y is 0.
Further, with reference to Fig. 8, described determine that module 30 includes computing unit 31 and determines unit 32,
Described computing unit 31, for when the transmission total value of every a line of described transmission matrix is not 0, transmission value corresponding with every a line of described transmission value matrix respectively for the transmission value of transmission total value maximum row is calculated according to preset formula, obtains current transmission value matrix according to the result of calculation of every a line;
Reference table 1, the row at transmission value maximum behavior node 0 place determined, when the transmission total value of every a line of described transmission matrix is not 0, the transmission value that the transmission value of the row at node 0 place is corresponding with every a line of described transmission value matrix is calculated according to preset formula, transmission value (0 by the row at node 0 place, 1, 1, 1, 0) with the row at transmission matrix interior joint 0 place, the row at node 1 place, the row at node 2 place, the row at node 3 place, the transmission value of the row correspondence at node 4 place is according to Fcal (a, b)=y is calculated, such as, the value that the capable corresponding transmission value at the transmission value of the row at node 0 place and node 1 place obtains after calculating according to described preset formula respectively (1, 0, 0, 0, 0), the value that the capable corresponding transmission value at the transmission value of the row at node 0 place and node 2 place obtains after calculating according to described preset formula respectively (1, 0, 0, 0, 0), result of calculation according to every a line obtains current transmission value matrix reference table 2.
Described determine module 32, obtains the transmission total value of every a line for all transmission values of a line every in described current transmission value matrix are sued for peace, it is determined that the maximum corresponding node of being expert at of transmission value; Transmission value matrix in reference table 2, obtains the transmission total value of every a line respectively 0,1,1,1,0. Wherein, node 1, the transmission total value of the row at the place of node 2 and node 3 is maximum is 1, then randomly choose the node 1 node for the maximum correspondence of being expert at of transmission total value.
Described computing unit 31, it is additionally operable to the transmission value that the transmission value of transmission value maximum row is corresponding with every a line of described current transmission matrix respectively be calculated according to preset formula, obtain new current transmission value matrix, until the transmission total value of every a line of described current transmission matrix is 0.
Described computing module 31 is calculated according to preset formula by the transmission value that the transmission value of transmission value maximum row is corresponding with every a line of described current transmission matrix respectively, obtains new current transmission value matrix, as shown in table 3.
Reference table 3, the transmission total value of every a line of described current transmission value matrix is 0, it is determined that node include node 0, node 4 and node 1. Wherein, the point that node 4 is isolated does not connect with other nodes in group system, and node 0 is maximum with the number of the node connected in group system with node 4.
Described processing module 40, for will the node that determine as destination node, described destination node includes transmission total value and 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value;
Described pushing module 50, for obtaining information to be pushed, and by described information pushing to the destination node determined, the destination node being determined by is by described information pushing to other nodes.
Using node 0, node 1 and node 4 as destination node, information is first pushed to node 1, node 4 and node 0 by cluster service, then by node 1 and node 0 by described information pushing to node 2 and node 3, to complete the information pushing purpose to whole group system. In other embodiments of the present invention, also can also is that and remove to determine destination node according to the mode of row, process is identical according to the mode of row with above-mentioned, and this is no longer going to repeat them.
The embodiment of the present invention is by building the transmission value matrix of all nodes in group system, and the transmission total value according to a line every in transmission value matrix selects transmission total value to be 0 and transmit the maximum node of total value as destination node, and completed the propelling movement of group system information by destination node. Realize guarantee information and push to all nodes of group system, improve the efficiency of group system information pushing.
Further, described processing module 40, it is additionally operable to abandon maximum for the transmission total value finally the determined node being expert at correspondence;
Such as, reference table 1, table 2 and table 3, the maximum node being expert at correspondence of transmission total value finally determined is node 1, is abandoned by node 1, does not namely select node 1 to transmit the node of carrier as information.
Described processing module 40, be additionally operable to from determined node using except described in abandon node except other nodes as destination node, described destination node includes transmission total value and 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value.
From determined node 0, in node 1 and node 4, remove outside node 1, select to determine by node 0 and node 4, as destination node, certainly the node selected includes node 4 that transmission total value is 0 and the maximum node 0 of transmission total value, the server of group system pushes information to node 0 and node 4, because of node 0 respectively with node 1, node 2 connects with node 3, by node 0 by described information pushing to node 1 after node 0 receives the information that cluster server pushes, node 2 and node 3, realize the purpose of nodes all in described information pushing to cluster.
Maximum for the transmission total value finally the determined node being expert at correspondence, when the transmission total value of every a line of transmission value matrix is 0, is abandoned by the embodiment of the present invention. While ensureing the information pushing of server push to nodes all in group system, select minimum node, and then reduce system resource, improve systematic function, it is ensured that the Effec-tive Function of group system.
It should be noted that, in this article, term " includes ", " comprising " or its any other variant are intended to comprising of nonexcludability, so that include the process of a series of key element, method, article or device not only include those key elements, but also include other key elements being not expressly set out, or also include the key element intrinsic for this process, method, article or device. When there is no more restriction, statement " including ... " key element limited, it is not excluded that there is also other identical element in including the process of this key element, method, article or device.
The invention described above embodiment sequence number, just to describing, does not represent the quality of embodiment.
Through the above description of the embodiments, those skilled in the art is it can be understood that can add the mode of required general hardware platform by software to above-described embodiment method and realize, hardware can certainly be passed through, but in a lot of situation, the former is embodiment more preferably. Based on such understanding, the part that prior art is contributed by technical scheme substantially in other words can embody with the form of software product, this computer software product is stored in a storage medium (such as ROM/RAM, magnetic disc, CD), including some instructions with so that a station terminal equipment (can be mobile phone, computer, server, or the network equipment etc.) perform the method described in each embodiment of the present invention.
The foregoing is only the preferred embodiments of the present invention; not thereby the scope of the claims of the present invention is limited; every equivalent structure utilizing description of the present invention and accompanying drawing content to make or equivalence flow process conversion; or directly or indirectly it is used in other relevant technical fields, all in like manner include in the scope of patent protection of the present invention.
Claims (12)
1. the information-pushing method of a group system, it is characterised in that include step:
Obtain in information to be pushed and group system the transmission value between two between node, and generate the transmission value matrix between all nodes according to described transmission value;
All transmission values of a line every in described transmission value matrix are sued for peace and obtains the transmission total value of every a line, it is determined that transmission total value 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value;
The transmission value of the transmission value a line every with described transmission value matrix according to transmission total value maximum row is iterated calculating to determine maximum the be expert at corresponding node of new transmission total value, until the transmission total value of every a line is 0;
Using the node determined as destination node, described destination node includes transmission total value and 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value;
Described information to be pushed is pushed to the destination node determined, with the destination node being determined by, described information to be pushed is pushed to other nodes.
2. the information-pushing method of group system as claimed in claim 1, it is characterized in that, the transmission value of every a line is iterated calculating the node maximum to determine new transmission total value the described transmission value according to transmission total value maximum row with described transmission value matrix, until the step that transmission total value is 0 of every a line includes:
When the transmission total value of every a line of described transmission matrix is not 0, transmission value corresponding with every a line of described transmission value matrix respectively for the transmission value of transmission total value maximum row is calculated according to preset formula, obtains current transmission value matrix according to the result of calculation of every a line;
All transmission values of a line every in described current transmission value matrix are sued for peace and obtains the transmission total value of every a line, it is determined that the node of the maximum correspondence of being expert at of new transmission value;
The transmission value that the transmission value of transmission value maximum row is corresponding with every a line of described current transmission matrix respectively is calculated according to preset formula, obtains new current transmission value matrix, until the transmission total value of every a line of described current transmission matrix is 0.
3. the information-pushing method of group system as claimed in claim 2, it is characterised in that in described acquisition group system, the step of transmission value between node includes between two:
Obtain in group system the transmission time between two between node;
When acquired transmission time value is more than preset time threshold, it is determined that transmission time value is 0 more than the transmission value between node between two of preset time threshold;
When acquired transmission time value is not more than preset time threshold, it is determined that it is 1 that transmission time value is not more than the transmission value between node between two of preset time threshold.
4. the information-pushing method of group system as claimed in claim 3, it is characterised in that described preset formula is Fcal (a, b)=y, wherein, a is the transmission value of transmission value maximum row, and b is the transmission value of every a line in transmission matrix, when a=0, b=1, y=1.
5. the information-pushing method of the group system as described in any one of Claims 1-4, it is characterised in that the step of the described node determining the maximum correspondence of being expert at of transmission total value includes:
The quantity of the node of the maximum correspondence of being expert at of transmission total value is determined from the transmission total value of the every a line obtained;
When transmitting the maximum node being expert at correspondence of total value and being multiple, from the node of the maximum correspondence of being expert at of described transmission total value, randomly choose the node node as the maximum correspondence of being expert at of final transmission total value.
6. the information-pushing method of the group system as described in any one of Claims 1-4, it is characterized in that, described using the node determined as destination node, described destination node includes transmission total value and 0 is expert at the node of correspondence and the maximum step being expert at corresponding node of transmission total value includes:
Maximum for the transmission total value finally the determined node being expert at correspondence is abandoned;
From determined node using except described in abandon node except other nodes as destination node, described destination node includes transmission total value and 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value.
7. the information push-delivery apparatus of a group system, it is characterised in that including:
Acquisition module, for obtaining in information to be pushed and group system transmission value between node between two;
Generation module, for generating the transmission value matrix between all nodes according to described transmission value;
Determine module, obtain the transmission total value of every a line for all transmission values of a line every in described transmission value matrix are sued for peace, it is determined that transmission total value 0 is expert at the node of correspondence and transmit the maximum corresponding node of being expert at of total value; The transmission value of the transmission value a line every with described transmission value matrix according to transmission total value maximum row is iterated calculating to determine maximum the be expert at corresponding node of new transmission total value, until the transmission total value of every a line of described transmission value matrix is 0;
Processing module, for will the node that determine as destination node, described destination node includes transmission total value and 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value;
Pushing module, for described information to be pushed is pushed to the destination node determined, pushes to other nodes with the destination node being determined by by described information to be pushed.
8. the information push-delivery apparatus of group system as claimed in claim 7, it is characterised in that described determine that module includes computing unit and determines unit,
Described computing unit, for when the transmission total value of every a line of described transmission matrix is not 0, transmission value corresponding with every a line of described transmission value matrix respectively for the transmission value of transmission total value maximum row is calculated according to preset formula, obtains current transmission value matrix according to the result of calculation of every a line;
Described determine unit, obtains the transmission total value of every a line for all transmission values of a line every in described current transmission value matrix are sued for peace, it is determined that the maximum corresponding node of being expert at of new transmission value;
Described computing unit, it is additionally operable to the transmission value that the transmission value of transmission value maximum row is corresponding with every a line of described current transmission matrix respectively be calculated according to preset formula, obtain new current transmission value matrix, until the transmission total value of every a line of described current transmission matrix is 0.
9. the information push-delivery apparatus of group system as claimed in claim 8, it is characterised in that described acquisition module includes acquiring unit and identifying unit,
Described acquiring unit, for obtaining in group system transmission time between node between two;
Described identifying unit, for when acquired transmission time value is more than preset time threshold, it is determined that transmission time value is 0 more than the transmission value between node between two of preset time threshold; When acquired transmission time value is not more than preset time threshold, it is determined that it is 1 that transmission time value is not more than the transmission value between node between two of preset time threshold.
10. the information push-delivery apparatus of group system as claimed in claim 9, it is characterised in that described preset formula is Fcal (a, b)=y, wherein, a is the transmission value of transmission value maximum row, and b is the transmission value of every a line in transmission matrix, when a=0, b=1, y=1.
11. the information push-delivery apparatus of group system as claimed in claim 8, it is characterised in that described determine unit, it is additionally operable to determine the quantity of the maximum corresponding node of being expert at of transmission total value from the transmission total value of the every a line obtained; When transmitting the maximum node being expert at correspondence of total value and being multiple, from the node that described transmission total value is maximum, randomly choose the node node as the maximum correspondence of being expert at of final transmission total value.
12. the information push-delivery apparatus of the group system as described in any one of claim 7 to 11, it is characterised in that described processing module, it is additionally operable to abandon maximum for the transmission total value finally the determined node being expert at correspondence;
From determined node using except described in abandon node except other nodes as destination node, described destination node includes transmission total value and 0 is expert at the node of correspondence and the maximum corresponding node of being expert at of transmission total value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410718674.5A CN105656976B (en) | 2014-12-01 | 2014-12-01 | The information-pushing method and device of group system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410718674.5A CN105656976B (en) | 2014-12-01 | 2014-12-01 | The information-pushing method and device of group system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105656976A true CN105656976A (en) | 2016-06-08 |
| CN105656976B CN105656976B (en) | 2019-01-04 |
Family
ID=56481162
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410718674.5A Active CN105656976B (en) | 2014-12-01 | 2014-12-01 | The information-pushing method and device of group system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105656976B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102047640A (en) * | 2008-05-28 | 2011-05-04 | 汤姆逊许可证公司 | Multi-head hierarchically clustered peer-to-peer live streaming system |
| US20120258747A1 (en) * | 2011-04-06 | 2012-10-11 | Samsung Electronics Co., Ltd. | Server cluster and method for push notification service |
| CN103533058A (en) * | 2013-10-17 | 2014-01-22 | 南京大学镇江高新技术研究院 | HDFS (Hadoop distributed file system)/Hadoop storage cluster-oriented resource monitoring system and HDFS/Hadoop storage cluster-oriented resource monitoring method |
| CN104092719A (en) * | 2013-12-17 | 2014-10-08 | 深圳市腾讯计算机***有限公司 | File transmission method, device and distributed cluster file system |
-
2014
- 2014-12-01 CN CN201410718674.5A patent/CN105656976B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102047640A (en) * | 2008-05-28 | 2011-05-04 | 汤姆逊许可证公司 | Multi-head hierarchically clustered peer-to-peer live streaming system |
| US20120258747A1 (en) * | 2011-04-06 | 2012-10-11 | Samsung Electronics Co., Ltd. | Server cluster and method for push notification service |
| CN103533058A (en) * | 2013-10-17 | 2014-01-22 | 南京大学镇江高新技术研究院 | HDFS (Hadoop distributed file system)/Hadoop storage cluster-oriented resource monitoring system and HDFS/Hadoop storage cluster-oriented resource monitoring method |
| CN104092719A (en) * | 2013-12-17 | 2014-10-08 | 深圳市腾讯计算机***有限公司 | File transmission method, device and distributed cluster file system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105656976B (en) | 2019-01-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110380917B (en) | Control method and device of federal learning system, terminal equipment and storage medium | |
| CN103002415B (en) | A kind of method and apparatus by short message sending identifying code | |
| US9813852B2 (en) | System and method for positioning terminal | |
| CN104394191B (en) | The method of remote control mobile terminal, control terminal and system | |
| US20180302346A1 (en) | Techniques to configure bot flow | |
| CN104994060A (en) | Method and device for providing verification for user login | |
| US11638193B2 (en) | Load balancing method and device, storage medium, and electronic device | |
| US20190018657A1 (en) | Techniques to configure a web-based application for bot configuration | |
| CN103874019A (en) | Voice interaction method and device | |
| CN113795039B (en) | Operator network switching method, device, equipment and computer readable storage medium | |
| CN109561167A (en) | A kind of domain name analytic method and device | |
| CN117149665B (en) | Continuous integration method, control device, continuous integration system, and storage medium | |
| CN104468764A (en) | Method, device and system for strategy scheduling | |
| CN103581273A (en) | Service executing method, device and system for distributed system | |
| CN103902429A (en) | Early warning method, sever and system in automated test | |
| CN105827508A (en) | Processing method and processing system of joining vehicle terminal in group, vehicle terminal and server | |
| CN104035871B (en) | Based on fault handling method and the device of the application program in geographic position | |
| US10334424B2 (en) | Discovery resource time-frequency hopping method and terminal | |
| CN104599092A (en) | Order business monitoring method and equipment | |
| CN104239212A (en) | Query method and device of test case and establishment method and device of test case | |
| CN105656976A (en) | Information pushing method and device for cluster system | |
| CN107766212A (en) | Determine the method and device of the installment state of application program | |
| KR20220139407A (en) | Task assignment method and apparatus, electronic device and computer readable medium | |
| CN110909288B (en) | Service data processing method, device, platform, service end, system and medium | |
| CN109348488B (en) | Mobile network user perception guarantee method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20190731 Address after: Shenzhen Futian District City, Guangdong province 518044 Zhenxing Road, SEG Science Park 2 East Room 403 Co-patentee after: Tencent cloud computing (Beijing) limited liability company Patentee after: Tencent Technology (Shenzhen) Co., Ltd. Address before: Shenzhen Futian District City, Guangdong province 518000 Zhenxing Road, SEG Science Park 2 East Room 403 Patentee before: Tencent Technology (Shenzhen) Co., Ltd. |