CN106506188B - A kind of method and apparatus of determining key node - Google Patents
A kind of method and apparatus of determining key node Download PDFInfo
- Publication number
- CN106506188B CN106506188B CN201510568429.5A CN201510568429A CN106506188B CN 106506188 B CN106506188 B CN 106506188B CN 201510568429 A CN201510568429 A CN 201510568429A CN 106506188 B CN106506188 B CN 106506188B
- Authority
- CN
- China
- Prior art keywords
- node
- message
- link
- runing time
- value
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/091—Measuring contribution of individual network components to actual service level
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
This application discloses a kind of methods and apparatus of determining key node, this method comprises: obtaining the corresponding runing time of each node in the system；Determine the longest link of runing time between start node to destination node；Count that each node for including in the link is corresponding to optimize duration；Duration can be optimized by selecting in the link meets the node of preset condition for key node, by finding " key node " that causes destination node to postpone in the application, instructs Optimization Work, improves the efficiency of optimization, alleviate the phenomenon that task postpones.
Description
Technical field
The invention relates to field of communication technology, in particular to a kind of determining key node method and apparatus.
Background technique
A working nodes up to ten thousand are usually contained in large-scale task scheduling system, interdepend between node to be formed one it is huge
Task Tree, need to judge that father's task of which task is fully completed layer by layer from root node when system is run, and meeting condition
Task start operation.In data warehouse in task scheduling system, task is often scheduled execution by the period of day, but works as
Also when increasing, certain Downstream Jobs have been delayed to non-the increasingly complicated absolute quantity simultaneously of the dependence of node
Normal serious state, or even will become third talent and carry out task operation, while the second day task blocked.
Key node refers to some node in task scheduling system, and scheduling system can be obviously improved by optimizing the node then
The performance of system usually directly optimizes operation duration in all nodes to the Optimization Work of task scheduling system in the prior art
Longest node, but due in large-scale task scheduling system dependence it is intricate, operation duration longest in all nodes
Node might not be related with the task of significant delays, and the longest node of operation duration be not necessarily exactly can degree of optimization most
High node, therefore only optimize the longest node of operation duration in all nodes, lack specific aim and cannot be guaranteed Optimization Work
Efficiency, cannot also guarantee the raising of entire task scheduling system efficiency, and the inefficiency for dispatching system will lead to task
Constantly delay, finally will appear serious data lag issues.
The application can be in one large-scale task scheduling system, and to specified destination node, finding leads to its delay
" key node ", and then Optimization Work is instructed, the efficiency of Optimization Work is improved, the phenomenon that task postpones is alleviated.
Summary of the invention
For the problems of the prior art, present applicant proposes the methods and apparatus for determining key node, existing to solve
The phenomenon that having the problems in technology, improve the efficiency of Optimization Work, alleviating task delay.
Present applicant proposes the methods for determining key node, comprising:
Obtain the corresponding runing time of each node in the system；
Determine the longest link of runing time between start node to destination node；
Count that each node for including in the link is corresponding to optimize duration；
Duration can be optimized by selecting in the link meets the node of preset condition for key node.
Preferably, the longest link of determination runing time between start node to destination node, it is specific to wrap
It includes:
Determine the end value of each node in addition to start node according to preset order, the end value of the node include from
Information and the link corresponding runing time of the start node to the longest link of the node runing time；
Search the information of the longest link of runing time in the end value of destination node, the corresponding chain of the information
Lu Weicong start node is to the longest link of runing time between destination node.
Preferably, the end value that each node in addition to start node is determined according to preset order, specifically includes:
From start node, each node is controlled according to preset rules and sends message to downstream node adjacent thereto；
Whether the node that confirmation receives message is to receive message for the first time；If the node for receiving message is to receive to disappear for the first time
Breath, the content of the message are to receive the value of the node of message；If the node for receiving message is not to receive message for the first time, sentence
The disconnected the content whether content of the current value of the node is replaced with to the message being most recently received；
When the message of other nodes transmission can be received again by determining any node not according to preset standard, any node
Value be any node end value；
Wherein, the content that start node sends message includes letter of the start node to the inter-node link for receiving the message
Breath and the corresponding runing time information of the link；The content for modifying the end value of other nodes in addition to start node is made
For other nodes message to be sent in addition to start node, the modification includes the link in the end value of the node
Information in addition to receive the message node information, and in the runing time of the link in the value of the node
Increase the runing time for sending the node itself of message；
Wherein, described to determine whether to replace with the content of the current value of the node in the message being most recently received
Hold, comprising: runing time in the current value of the node and the runing time in the message received；If the value of itself
In runing time be less than the runing time in the message received, then by the letter of runing time and link in the value of itself
Breath replaces with the information of runing time and link in the message received；If the runing time in the value of itself is not less than
The runing time in message received, then the value of itself is constant.
Preferably, described any node determined not according to preset standard to receive the message of other nodes transmission, tool again
Body includes:
Disabled state is set by the node for having sent message to all downstream nodes adjacent thereto；
When determining that all upstream nodes adjacent with any node are all disabled state, any node is had received
The message that all upstream nodes adjacent thereto are sent, can not receive the message of other nodes transmission again.
Preferably, each node for including in the statistics link is corresponding to optimize duration, specifically includes:
Obtain the node for including in the longest link of the runing time can Optimal Ratio；
According to the node can Optimal Ratio and operation duration calculate when optimizing of the node for including in the link
It is long, the node a length of when optimizing can Optimal Ratio and operation duration product.
The embodiment of the present application also discloses a kind of equipment of determining key node, comprising:
Module is obtained, for obtaining the corresponding runing time of each node in the system；
Determining module, for determining the longest link of runing time between start node to destination node；
Statistical module, for counting, each node for including in the link is corresponding to optimize duration；
Selecting module meets the node of preset condition for selecting that duration can be optimized in the link for key node.
Preferably, the determining module, specifically includes:
Determination module, for determining the end value of each node in addition to start node, the node according to preset order
End value include being answered from start node to the information of the longest link of the node runing time and the link pair
Runing time；
Searching module, the information of the longest link of the runing time in end value for searching destination node, institute
Stating the corresponding link of information is the longest link of runing time between start node to destination node.
Preferably, the determination module, is specifically used for:
From start node, each node is controlled according to preset rules and sends message to downstream node adjacent thereto；
If the node for receiving message is to receive message for the first time, the content of the message is the node for receiving message
Value；If the node for receiving message is not to receive message for the first time, determine whether to replace the content of the current value of the node
It is changed to the content for the message being most recently received；
When the message of other nodes transmission can be received again by determining any node not according to preset standard, any node
Value be any node end value；
Wherein, the content that start node sends message includes letter of the start node to the inter-node link for receiving the message
Breath and the corresponding runing time information of the link；The content for modifying the end value of other nodes in addition to start node is made
For other nodes message to be sent in addition to start node, the modification includes the link in the end value of the node
Information in addition to receive the message node information, and in the runing time of the link in the value of the node
Increase the runing time for sending the node itself of message；
Wherein, described to determine whether to replace with the content of the current value of the node in the message being most recently received
Hold, comprising: runing time in the current value of the node and the runing time in the message received；If the value of itself
In runing time be less than the runing time in the message received, then by the letter of runing time and link in the value of itself
Breath replaces with the information of runing time and link in the message received；If the runing time in the value of itself is not less than
The runing time in message received, then the value of itself is constant.
Preferably, the determination module determines any node not according to preset standard can receive the transmission of other nodes again
Message specifically includes:
Disabled state is set by the node for having sent message to all downstream nodes adjacent thereto；
When determining that all upstream nodes adjacent with any node are all disabled state, any node is had received
The message that all upstream nodes adjacent thereto are sent, can not receive the message of other nodes transmission again.
Preferably, the statistical module, is specifically used for:
Obtain the node for including in the longest link of the runing time can Optimal Ratio；
According to the node can Optimal Ratio and operation duration calculate when optimizing of the node for including in the link
It is long, the node a length of when optimizing can Optimal Ratio and operation duration product.
Compared with prior art, the application improves the effect of Optimization Work by finding the key node to be optimized
Rate alleviates the phenomenon that task postpones.
Detailed description of the invention
Fig. 1 is a kind of flow diagram of the method for determining key node that the application proposes；
Fig. 2 is the schematic diagram of the system under a kind of concrete scene that the application proposes；
Fig. 3 is a kind of structural schematic diagram for determining key node equipment that the application proposes.
Specific embodiment
In order to solve in the prior art, large-scale task scheduling system inefficiency, the serious defect of task delay phenomenon, this
Application proposes a kind of method of determining key node, to instruct the Optimization Work of task scheduling system, as shown in Figure 1, including
Following steps:
Step 101 obtains the corresponding runing time of each node in the system；
Step 102 determines the longest link of runing time between start node to destination node；
In specific application scenarios, the longest link of runing time is determined between start node to destination node
Method have very much, such as:
1, link all between start node to destination node in system is found, all links found are counted
Runing time, it is final to determine that runing time is longest between start node to destination node by the sequence to runing time
One link.
2, according to certain sequence or algorithm, the longest chain of runing time between start node to destination node is found
Road e.g. determines the end value of each node in addition to start node according to preset order, the end value of the node includes from
Information and the link corresponding runing time of the beginning node to the longest link of the node runing time；Wherein
The preset order can be the sequence of upstream node to downstream node, can also be determined according to algorithms of different, pass through transformation
Existing signal source shortest path algorithm, such as Di Jiesitela Dijkstra signal source shortest path algorithm, Bellman Ford
Bellman-Ford algorithm, SPFA algorithm, ASP algorithm and Floyd-Warshall algorithm etc., also available other are found most
The algorithm in long path, in this way, need to only search the end value of the destination node for specified destination node, can be obtained from
Information of the start node to the longest link of runing time between destination node.
Wherein, Dijkstra signal source shortest path algorithm goes to solve non-negative right digraph using breadth first search
Signal source shortest path problem, algorithm will eventually get a shortest path tree, and the input of the algorithm contains a Weight
Digraph G and start node S, the set on all vertex in G is indicated with V.Side in each figure is all two vertex institutes
The Sequential Elements pair of formation.(u, v) expression has path to be connected from vertex u to v.We indicate the set on all sides in G with E, and
The weight on side is then defined by weighting function w:E → [0, ∞].Therefore, w (u, v) is exactly the nonnegative curvature from vertex u to vertex v
(weight).The weight on side can imagine into the distance between two vertex.The weight for appointing inter-two-point path, is exactly on the path
The weight summation on all sides.It has been known that there is having vertex s and t in V, dijkstra's algorithm can find the lowest weightings path of s to t
(for example, shortest path).This algorithm can also be found from a vertex s to the most short of any other vertex in one drawing
Path.
A kind of preferred method is, from start node, controls each node according to preset rules under adjacent thereto
It swims node and sends message；Whether the node that confirmation receives message is to receive message for the first time；If the node for receiving message is for the first time
Message is received, the content of the message is to receive the value of the node of message；If the node for receiving message is not to receive for the first time
To message, the content that the content of the current value of the node is replaced with to the message being most recently received is determined whether to；According to pre-
When bidding accurately determines any node not and can receive again the message of other nodes transmission, the value of any node is described any
The end value of node；
Wherein, the content that start node sends message includes letter of the start node to the inter-node link for receiving the message
Breath and the corresponding runing time information of the link；The content for modifying the end value of other nodes in addition to start node is made
For other nodes message to be sent in addition to start node, the modification includes the link in the end value of the node
Information in addition to receive the message node information, and in the runing time of the link in the value of the node
Increase the runing time for sending the node itself of message；
Wherein, described to determine whether to replace with the content of the current value of the node in the message being most recently received
Hold, comprising: runing time in the current value of the node and the runing time in the message received；If the value of itself
In runing time be less than the runing time in the message received, then by the letter of runing time and link in the value of itself
Breath replaces with the information of runing time and link in the message received；If the runing time in the value of itself is not less than
The runing time in message received, then the value of itself is constant.
Wherein, the method for the message that any node determined not according to preset standard can receive again the transmission of other nodes
Have very much, such as can be determined by the setting of disabled state, specifically, can will be to all downstream joints adjacent thereto
The node that point has sent message is set as disabled state；Determine that all upstream nodes adjacent with any node are all inactive
When state, any node has received the message that all upstream nodes adjacent thereto are sent, and can not receive other again
The message that node is sent.
Another method is to can specify that one section of preset time, does not receive other nodes in preset time node and sends
Message, it is determined that the node can not receive again other nodes transmission message.
Wherein, distributed BSP Computational frame can be used in specific determination process, hardware aspect, supports magnanimity numbers up to a million
According to the processing of figure, it is better than conventional individual solution.
Wherein, Integral synchronous parallel computational model Bulk Synchronous Parallel, feature is by processor and road
It is separated by device, highlights separating for calculating task and communication task, and router is only only completed the message transmission of point-to-point, does not mention
For functions such as combination, duplication and broadcast, does so and both cover specific interference networks topology, communication protocol is in turn simplified, in BSP
In, a calculating process is made of a series of global superledges, each superledge is by concurrent, communication three steps synchronous with fence
Rapid composition.It synchronously completes, indicates the completion of this superledge and the beginning of next superledge.
The each node for including in step 103, the statistics link is corresponding to optimize duration；
It can directly evaluate in the link that each node for including is corresponding to optimize duration, can also first obtain institute
That states the node for including in the longest link of runing time can Optimal Ratio；Further according to the node can Optimal Ratio with
Operation duration calculates the duration that optimizes for the node for including in the link, and a length of node when optimizing optimizes
The product of ratio and operation duration.
Step 104, duration can be optimized by selecting in the link meet the node of preset condition for key node.
The duration that optimizes of the link interior joint can be ranked up, optimal optimization sequence can be obtained, choose
The part of nodes of optimization front optimizes, or successively optimizes to these nodes according to optimal optimization sequence,
In this way depending on the quantity of the obtained key node of concrete condition determination, the efficiency of optimization ensure that, while avoiding the negative of system
It carries on a shoulder pole overweight.
In order to further describe the present application, the embodiment of the present application two discloses a kind of in specific determining crucial section
The method of point, comprising:
Relatively simple task scheduling system as shown in Figure 2, be applied to data warehouse in, data warehouse be one towards
Theme, integrated, metastable, reflecting history variation data acquisition system, for supporting administrative decision.The task schedule system
It include working node #1, #2, #4, #3, #5 in system, the operation duration of working node #1, #2, #4, #3, #5 are respectively 8 minutes, 5
Minute, 2 minutes, 3 minutes, 1 minute.
Step 1 obtains the corresponding runing time of each node in the system.
Step 2, in original state, control node #1 sends message to its downstream node #2, #4, and the content of message includes
" start node -> intermediate node -> terminal node: operation duration ", as control node #1 sends message " #1- > # to node #2
2:8 ", Xiang Jiedian #4 send message " #1- > #4:8 "；Disappear at this point, node #1 is over to all downstream node transmissions adjacent with it
Breath, sets disabled state for node #1.
Node #2, #4 is to receive message for the first time at this time, and " #1- > #2:8 " is saved as the value of itself by node #2, section
" #1- > #4:8 " is saved as the value of itself by point #4, and the upstream node of node #2 only has node #1, and node #1 has been inactive
State, so " #1- > #2:8 " is end value of node #2, after determining end value, control node #2 is to the downstream joint adjacent with it
Point #3, #4 send message, downstream node will be added in the link in node #2 end value, while plus certainly in " operation duration "
This message is sent to downstream node, such as sends message " #1- > #2- > #3:13 " to node #3 by the operation duration of body, node #
2 send message " #1- > #2- > #4:13 " to node #4；At this point, node #2 is over to all downstream node transmissions adjacent with it
Node #2 is set disabled state by message.
Node #3 is to receive message for the first time at this time, and " #1- > #2- > #3:13 " is saved as the value of itself by node #3, section
Point #4 is not to receive message for the first time, so runing time in the value of comparison node #4 itself and newly receiving the fortune in message
The row time, since 13 are greater than 8, so the value of node #4 is replaced with " #1- > #2- > #4:13 ", the upstream node of node #3 only has
Node #2, and node #2 has been disabled state, so " #1- > #2- > #3:13 " is the end value of node #3, node #4's is upper
Trip node has node #1 and node #2, and node #1 and node #2 are disabled state, so " #1- > #2- > #4:13 " is section
The end value of point #4, after determining end value, control node #3, #4 sends message to the downstream node #5 adjacent with them respectively,
Disabled state is set by node #3, #4 after being sent completely, wherein node #3 sends message " #1- > #2- > #3- to node #5
> #5:15 ", node #4 send message #1- > #2- > #4- > #5:16 " to node #5, and node #5 final value is " #1- > #2- > #4-
> #5:16 ", i.e., from node #1 to node #5, the longest link of runing time is #1- > #2- > #4- > #5.
Next the node in a link longest to runing time is investigated, i.e., examines #1, #2, #4, #5
It examines, chooses part of nodes therein and optimize operation；Specifically, the operation duration of available node #1, #2, #4, #5 are simultaneously
Assess they can Optimal Ratio, (operation duration * can be excellent for the duration that optimizes for determining the node related in the link with this
Change ratio), optimal optimization sequence can be obtained after sequence, the part of nodes for choosing optimization front optimizes, or
Successively these nodes are optimized according to optimal optimization sequence.
In practical application scene, the node of system can be more than system shown in Fig. 2, and the node on longest path also can be more
More, principle is identical as above-mentioned example, can search out the key node preferentially to be optimized according to the method described above.
The embodiment of the present application three also discloses a kind of data processing equipment, as shown in Figure 3, comprising:
Module 301 is obtained, for obtaining the corresponding runing time of each node in the system；
Determining module 302, for determining the longest link of runing time between start node to destination node；
Statistical module 303, for counting, each node for including in the link is corresponding to optimize duration；
Selecting module 304 meets the node of preset condition for selecting that duration can be optimized in the link for key node.
Preferably, the determining module 302, specifically includes:
Determination module, for determining the end value of each node in addition to start node, the node according to preset order
End value include being answered from start node to the information of the longest link of the node runing time and the link pair
Runing time；
Searching module, the information of the longest link of the runing time in end value for searching destination node, institute
Stating the corresponding link of information is the longest link of runing time between start node to destination node.
Preferably, the determination module, is specifically used for:
From start node, each node is controlled according to preset rules and sends message to downstream node adjacent thereto；
If the node for receiving message is to receive message for the first time, the content of the message is the node for receiving message
Value；If the node for receiving message is not to receive message for the first time, determine whether to replace the content of the current value of the node
It is changed to the content for the message being most recently received；
When determining that node no longer receives the message of other nodes transmission, the value of the node is the final of the node
Value；
Wherein, the content that start node sends message includes letter of the start node to the inter-node link for receiving the message
Breath and the corresponding runing time information of the link；The content for modifying the end value of other nodes in addition to start node is made
For other nodes message to be sent in addition to start node, the modification includes the link in the end value of the node
Information in addition to receive the message node information, and in the runing time of the link in the value of the node
Increase the runing time for sending the node itself of message；
Wherein, described to determine whether to replace with the content of the current value of the node in the message being most recently received
Hold, comprising: runing time in the current value of the node and the runing time in the message received；If the value of itself
In runing time be less than the runing time in the message received, then by the letter of runing time and link in the value of itself
Breath replaces with the information of runing time and link in the message received；If the runing time in the value of itself is not less than
The runing time in message received, then the value of itself is constant.
Preferably, the determination module determines any node not according to preset standard can receive the transmission of other nodes again
Message specifically includes:
Disabled state is set by the node for having sent message to all downstream nodes adjacent thereto；
When determining that all upstream nodes adjacent with any node are all disabled state, any node is had received
The message that all upstream nodes adjacent thereto are sent, can not receive the message of other nodes transmission again.
Preferably, the statistical module 303, is specifically used for:
Obtain the node for including in the longest link of the runing time can Optimal Ratio；
According to the node can Optimal Ratio and operation duration calculate when optimizing of the node for including in the link
It is long, the node a length of when optimizing can Optimal Ratio and operation duration product.
Compared with prior art, the application improves the effect of Optimization Work by finding the key node to be optimized
Rate alleviates the phenomenon that task postpones.
Through the above description of the embodiments, those skilled in the art can be understood that the application can lead to
Hardware realization is crossed, the mode of necessary general hardware platform can also be added to realize by software.Based on this understanding, this Shen
Technical solution please can be embodied in the form of software products, which can store in a non-volatile memories
In medium (can be CD-ROM, USB flash disk, mobile hard disk etc.), including some instructions are used so that a computer equipment (can be
Personal computer, server or network equipment etc.) execute method described in each implement scene of the application.
It will be appreciated by those skilled in the art that the accompanying drawings are only schematic diagrams of a preferred implementation scenario, module in attached drawing or
Process is not necessarily implemented necessary to the application.
It will be appreciated by those skilled in the art that the module in device in implement scene can be described according to implement scene into
Row is distributed in the device of implement scene, can also be carried out corresponding change and is located at the one or more dresses for being different from this implement scene
In setting.The module of above-mentioned implement scene can be merged into a module, can also be further split into multiple submodule.
Above-mentioned the application serial number is for illustration only, does not represent the superiority and inferiority of implement scene.
Disclosed above is only several specific implementation scenes of the application, and still, the application is not limited to this, Ren Heben
What the technical staff in field can think variation should all fall into the protection scope of the application.
Claims (8)
1. a kind of method of determining key node, applied in the system comprising multiple nodes, which is characterized in that the method packet
Include following steps:
Obtain the corresponding runing time of each node in the system；
Determine the longest link of runing time between start node to destination node；
Count that each node for including in the link is corresponding to optimize duration；
Duration can be optimized by selecting in the link meets the node of preset condition for key node；
The longest link of determination runing time between start node to destination node, specifically includes:
The end value of each node in addition to start node is determined according to preset order, the end value of the node includes from starting
Information and the link corresponding runing time of the node to the longest link of the node runing time；
The information of the longest link of runing time in the end value of destination node is searched, the corresponding link of the information is
The longest link of runing time between start node to destination node.
2. the method as described in claim 1, which is characterized in that described to determine each of in addition to start node according to preset order
The end value of node, specifically includes:
From start node, each node is controlled according to preset rules and sends message to downstream node adjacent thereto；
Whether the node that confirmation receives message is to receive message for the first time；If the node for receiving message is to receive message for the first time,
The content of the message is to receive the value of the node of message；If the node for receiving message is not to receive message for the first time, judgement
Whether the content of the current value of the node is replaced with to the content for the message being most recently received；
When the message of other nodes transmission can be received again by determining any node not according to preset standard, the value of any node
For the end value of any node；
Wherein, the content that start node sends message includes information of the start node to the inter-node link for receiving the message,
And the corresponding runing time information of the link；The content of the end value of other nodes in addition to start node is modified as institute
Other nodes message to be sent in addition to start node is stated, the modification includes the letter in the link of the end value of the node
Addition will receive the information of the node of the message in breath, and increase in the runing time of the link in the value of the node
Send the runing time of the node itself of message；
Wherein, the content for determining whether to replacing with the content of the current value of the node into the message being most recently received,
It include: runing time in the current value of node described in comparison and the runing time in the message that receives；If in the value of itself
Runing time be less than the runing time in the message received, then by the information of runing time and link in the value of itself
Replace with the information of the runing time and link in the message received；If the runing time in the value of itself is not less than receipts
To message in runing time, then the value of itself is constant.
3. method according to claim 2, which is characterized in that described to determine any node not according to preset standard and receive again
The message sent to other nodes, specifically includes:
Disabled state is set by the node for having sent message to all downstream nodes adjacent thereto；
When determining that all upstream nodes adjacent with any node are all disabled state, any node has received all
The message that upstream node adjacent thereto is sent can not receive the message of other nodes transmission again.
4. the method as described in claim 1, which is characterized in that each node for including in the statistics link is corresponding
Duration can be optimized, specifically included:
Obtain the node for including in the longest link of the runing time can Optimal Ratio；
According to the node can Optimal Ratio and operation duration calculate the duration that optimizes of the node for including in the link, institute
State a length of node when can optimize can Optimal Ratio and operation duration product.
5. a kind of equipment of determining key node, applied in the system comprising multiple nodes characterized by comprising
Module is obtained, for obtaining the corresponding runing time of each node in the system；
Determining module, for determining the longest link of runing time between start node to destination node；
Statistical module, for counting, each node for including in the link is corresponding to optimize duration；
Selecting module meets the node of preset condition for selecting that duration can be optimized in the link for key node；
The determining module, specifically includes:
Determination module, for determining the end value of each node in addition to start node according to preset order, the node is most
Final value includes the information and the corresponding fortune of the link from start node to the longest link of the node runing time
The row time；
Searching module, the information of the longest link of the runing time in end value for searching destination node, the letter
Ceasing corresponding link is the longest link of runing time between start node to destination node.
6. equipment as claimed in claim 5, which is characterized in that the determination module is specifically used for:
From start node, each node is controlled according to preset rules and sends message to downstream node adjacent thereto；
If the node for receiving message is to receive message for the first time, the content of the message is to receive the value of the node of message；If
The node for receiving message is not to receive message for the first time, then determines whether to replace with the content of the current value of the node most
The content for the message that proximity receives；
When the message of other nodes transmission can be received again by determining any node not according to preset standard, the value of any node
For the end value of any node；
Wherein, the content that start node sends message includes information of the start node to the inter-node link for receiving the message,
And the corresponding runing time information of the link；The content of the end value of other nodes in addition to start node is modified as institute
Other nodes message to be sent in addition to start node is stated, the modification includes the letter in the link of the end value of the node
Addition will receive the information of the node of the message in breath, and increase in the runing time of the link in the value of the node
Send the runing time of the node itself of message；
Wherein, the content for determining whether to replacing with the content of the current value of the node into the message being most recently received,
It include: runing time in the current value of node described in comparison and the runing time in the message that receives；If in the value of itself
Runing time be less than the runing time in the message received, then by the information of runing time and link in the value of itself
Replace with the information of the runing time and link in the message received；If the runing time in the value of itself is not less than receipts
To message in runing time, then the value of itself is constant.
7. equipment as claimed in claim 6, which is characterized in that the determination module determines any node not according to preset standard
The message that the transmission of other nodes can be received again, specifically includes:
Disabled state is set by the node for having sent message to all downstream nodes adjacent thereto；
When determining that all upstream nodes adjacent with any node are all disabled state, any node has received all
The message that upstream node adjacent thereto is sent can not receive the message of other nodes transmission again.
8. equipment as claimed in claim 5, which is characterized in that the statistical module is specifically used for:
Obtain the node for including in the longest link of the runing time can Optimal Ratio；
According to the node can Optimal Ratio and operation duration calculate the duration that optimizes of the node for including in the link, institute
State a length of node when can optimize can Optimal Ratio and operation duration product.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510568429.5A CN106506188B (en) | 2015-09-08 | 2015-09-08 | A kind of method and apparatus of determining key node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510568429.5A CN106506188B (en) | 2015-09-08 | 2015-09-08 | A kind of method and apparatus of determining key node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106506188A CN106506188A (en) | 2017-03-15 |
| CN106506188B true CN106506188B (en) | 2019-11-08 |
Family
ID=58286664
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510568429.5A Active CN106506188B (en) | 2015-09-08 | 2015-09-08 | A kind of method and apparatus of determining key node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106506188B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109783206B (en) * | 2019-01-04 | 2022-12-13 | 智恒科技股份有限公司 | Method for describing overall structure of big data task flow |
| CN111309712A (en) * | 2020-03-16 | 2020-06-19 | 北京三快在线科技有限公司 | Optimized task scheduling method, device, equipment and medium based on data warehouse |
| CN111966497B (en) * | 2020-08-25 | 2023-02-24 | 北京大学 | Computing task allocation method for distributed system in wide area network environment |
| CN114510329B (en) * | 2022-01-21 | 2023-08-08 | 北京火山引擎科技有限公司 | Method, device and equipment for determining estimated output time of task node |
| CN115277540B (en) * | 2022-07-29 | 2024-03-26 | 蚂蚁区块链科技(上海)有限公司 | Method, device, electronic equipment and computer readable storage medium for optimizing structured P2P network |
| CN116502865A (en) * | 2023-06-19 | 2023-07-28 | 江西财经大学 | Intelligent management method and system for industrial enterprise production |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103295100A (en) * | 2013-05-28 | 2013-09-11 | 机械工业第六设计研究院有限公司 | Project management progress arranging method and project management progress arranging system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20120100601A (en) * | 2011-03-04 | 2012-09-12 | 주식회사 한국무역정보통신 | Optimization system of smart logistics network |
-
2015
- 2015-09-08 CN CN201510568429.5A patent/CN106506188B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103295100A (en) * | 2013-05-28 | 2013-09-11 | 机械工业第六设计研究院有限公司 | Project management progress arranging method and project management progress arranging system |
Non-Patent Citations (2)
| Title |
|---|
| 动态规划解——有向图中的最长路径;Geek_Ling;《博客园》;20111112;1-2页 * |
| 双代号网络计划中基于案例分析的工期优化研究;李会静;《价值工程》;20140118;71-72页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106506188A (en) | 2017-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106506188B (en) | A kind of method and apparatus of determining key node | |
| CN110891093B (en) | Method and system for selecting edge computing node in delay sensitive network | |
| CN109379220B (en) | Complex network key node cluster mining method based on combination optimization | |
| CN105376157B (en) | A kind of method and apparatus of routed path selection | |
| CN102916879A (en) | Rapid route convergence method | |
| US10433233B2 (en) | Method and apparatus for determining position of routing node and terminal equipment | |
| CN102506886B (en) | Method for realizing path planning in navigation equipment | |
| CN110990140B (en) | Method for scheduling distributed machine learning flow in photoelectric switching network | |
| CN111181792B (en) | SDN controller deployment method and device based on network topology and electronic equipment | |
| CN112636991B (en) | Multi-class VNF deployment method based on intermediary centrality | |
| CN102420797B (en) | Topology mapping method and system | |
| CN107682211A (en) | A kind of network topology structure determination method, device and computer-readable recording medium | |
| CN109873772A (en) | Stream scheduling method, device, computer equipment and storage medium based on stable matching | |
| CN107483355B (en) | Data center-oriented online scene low-bandwidth overhead traffic scheduling scheme | |
| CN105247823B (en) | The method and apparatus for adjusting link overhead | |
| CN117499297B (en) | Method and device for screening data packet transmission paths | |
| CN104346380B (en) | Data reordering method and system based on MapReduce model | |
| CN106470165A (en) | A kind of load sharing method, system and relevant device | |
| JP6384125B2 (en) | Information processing apparatus and program | |
| CN104125146B (en) | A kind of method for processing business and device | |
| CN106105282A (en) | Link buffer zone state is utilized to carry out the system and method for traffic engineering | |
| CN105959141B (en) | A kind of virtual network topology construction method and device | |
| CN116132353A (en) | TSN route selection method based on DDQN | |
| JP5595342B2 (en) | Multiple path search method and apparatus | |
| CN102694725B (en) | Method for bi-directionally searching paths based on bandwidth |
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 |
Effective date of registration: 20201012 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Patentee after: Innovative advanced technology Co.,Ltd. Address before: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Patentee before: Advanced innovation technology Co.,Ltd. Effective date of registration: 20201012 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Patentee after: Advanced innovation technology Co.,Ltd. Address before: A four-storey 847 mailbox in Grand Cayman Capital Building, British Cayman Islands Patentee before: Alibaba Group Holding Ltd. |
|
| TR01 | Transfer of patent right |