CN109039907B - Method, device, equipment and storage medium for determining optimal path of network data traffic - Google Patents
Method, device, equipment and storage medium for determining optimal path of network data traffic Download PDFInfo
- Publication number
- CN109039907B CN109039907B CN201811039075.5A CN201811039075A CN109039907B CN 109039907 B CN109039907 B CN 109039907B CN 201811039075 A CN201811039075 A CN 201811039075A CN 109039907 B CN109039907 B CN 109039907B
- Authority
- CN
- China
- Prior art keywords
- path
- fastest
- node
- determining
- optimal
- 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
- 238000000034 method Methods 0.000 title claims abstract description 34
- 230000006641 stabilisation Effects 0.000 claims description 7
- 238000011105 stabilization Methods 0.000 claims description 7
- 238000004590 computer program Methods 0.000 claims description 3
- 238000004891 communication Methods 0.000 abstract description 16
- 230000005540 biological transmission Effects 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 6
- 238000004422 calculation algorithm Methods 0.000 description 5
- 241000255581 Drosophila <fruit fly, genus> Species 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000006467 substitution reaction Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000017525 heat dissipation Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a method, a device, equipment and a storage medium for determining an optimal path of network data traffic, wherein the method comprises the following steps: determining a first node, a second node, a path number N, a population number and a maximum iteration number of a network data traffic path; acquiring a fastest data transmission path and consumed time of a randomly selected population quantity path from a first node to a second node in N paths; iteratively updating the fastest path and the consumed time, and acquiring an optimal path according to all the iterative fastest paths when the fastest path is stabilized as a certain path or the iterative times reach the maximum iterative times; according to the invention, the optimal path is continuously output in an iterative manner between two nodes of the path, so that the current optimal communication path can be rapidly and accurately calculated in some use scenes which have higher requirements on the optimal path and do not consider the cost generated by data communication.
Description
Technical Field
The invention belongs to the technical field of network data path optimization, and particularly relates to a method, a device, equipment and a storage medium for determining an optimal path of network data traffic.
Background
Currently, the internet is very developed, the number of communication paths from one node to another node is often tens of thousands, and as the distance of each communication node becomes longer and longer, the number of relay stations and lines between nodes increases, which has the consequence that the number of paths increases exponentially. When the number of paths increases dramatically, how to select the optimal path becomes a very difficult problem.
The currently used path optimization algorithm needs to comprehensively consider factors such as path length, reliability, routing delay, bandwidth, load, communication cost and the like, and calculate a proper path through a complex routing algorithm. The amount of calculation is extremely large, and the calculated path is not the optimal path but an appropriate path in consideration of the data transmission cost. Currently, the internet is very developed, paths from a data transmission source to a receiving device are often tens of thousands or even more, and optimal path selection cannot be performed through a traversal method.
Therefore, a method, an apparatus, a device, and a storage medium for determining an optimal path of network data traffic are needed to solve the above problems.
Disclosure of Invention
The invention aims to provide a method, a device, equipment and a storage medium for determining an optimal path of network data traffic based on a drosophila algorithm, aiming at the defects in the prior art, and the optimal path can be rapidly and accurately calculated to meet the scene requirements.
In a first aspect, an embodiment of the present application provides a method for determining an optimal path of network data traffic, where the method includes:
determining a first node, a second node, a path number N, a population number and a maximum iteration number of a network data traffic path;
acquiring a fastest data transmission path and consumed time of a randomly selected population quantity path from a first node to a second node in N paths;
and iteratively updating the fastest path and the consumed time, and acquiring the optimal path according to all the iterated fastest paths when the fastest path is stabilized as a certain path or the iteration times reach the maximum iteration times.
With reference to the first aspect, in a first implementation manner of the first aspect, the determining a first node, a second node, a path number N, a population number, and a maximum number of iterations of a network data traffic path includes:
the population number PopSize is determined according to the formula PopSize ═ 1 × N/1000.
With reference to the first aspect, in a second implementation manner of the first aspect, the iteratively updating the optimal path and the consumed time, and when the fastest path is stabilized as a certain path or the number of iterations reaches the maximum number of iterations, acquiring the optimal path according to all the fastest paths of the iterations includes:
judging whether the fastest path is stable or not, and determining the fastest path as an optimal path when the fastest path is stable as a certain path;
and when the fastest path is not stabilized to be a certain path, judging whether the iteration frequency reaches the maximum iteration frequency, if so, acquiring the optimal path according to all the iterative fastest paths, and otherwise, continuously iteratively updating the fastest path and consuming time.
With reference to the first aspect, in a third implementation manner of the first aspect, the determining whether the fastest path is stable, and when the fastest path is stable as a certain path, determining that the fastest path is the optimal path includes:
setting the number n of times of stabilization of the fastest path;
and when the fastest path is judged to be a certain path repeatedly for n times, determining the fastest path as the optimal path.
In a second aspect, an embodiment of the present application provides an apparatus for determining an optimal path of network data traffic, including:
the device comprises a determining unit, a judging unit and a judging unit, wherein the determining unit is configured to determine a first node, a second node, a path number N, a population number and a maximum iteration number of a network data flow path;
the acquisition unit is configured to acquire a fastest data transmission path and consumed time for transmitting data from a first node to a second node by a randomly selected population number path from the N paths; the acquisition unit is also configured to iteratively update the fastest path and the consumed time, and when the fastest path is stabilized as a certain path or the iteration times reach the maximum iteration times, the optimal path is acquired according to all the iterated fastest paths.
With reference to the second aspect, in a first implementation manner of the second aspect, the determining unit is specifically configured to:
the population number PopSize is determined according to the formula PopSize ═ 1 × N/1000.
With reference to the second aspect, in a second implementation manner of the second aspect, the obtaining unit specifically includes:
the first judging unit is configured to judge whether the fastest path is stable or not, and when the fastest path is stable as a certain path, the fastest path is determined to be the optimal path;
and the second judgment unit is configured to judge whether the iteration frequency reaches the maximum iteration frequency when the fastest path is not stabilized to be a certain path, acquire an optimal path according to all the iterative fastest paths if the iteration frequency reaches the maximum iteration frequency, and continuously iteratively update the fastest path and consume time if the iteration frequency does not reach the maximum iteration frequency.
With reference to the second aspect, in a third implementation manner of the second aspect, the first determining unit specifically includes:
setting the number n of times of stabilization of the fastest path;
and when the fastest path is judged to be a certain path repeatedly for n times, determining the fastest path as the optimal path.
In a third aspect, an embodiment of the present application provides an apparatus, including: one or more processors; memory for storing one or more programs that, when executed by the one or more processors, cause the one or more processors to perform the method according to any of the embodiments of the first aspect and the first aspect.
In a fourth aspect, the present application provides a computer-readable storage medium storing a computer program, where the computer program is executed by a processor to implement the method according to any one of the embodiments of the first aspect and the first aspect.
The invention has the beneficial effects that:
the method for determining the optimal path of the network data flow provided by the invention can be used for rapidly and accurately calculating the current optimal communication path under the use scenes that the requirement on the optimal path is higher and the cost generated by data communication is not considered by continuously iterating and outputting the optimal path between two nodes of the path.
In addition, the invention has reliable design principle, simple structure and very wide application prospect.
Therefore, compared with the prior art, the invention has prominent substantive features and remarkable progress, and the beneficial effects of the implementation are also obvious.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 is a schematic flow chart diagram of a method of one embodiment of the present application;
FIG. 2 is a schematic flow chart diagram of a method of another embodiment of the present application;
FIG. 3 is a schematic block diagram of an apparatus of one embodiment of the present application;
fig. 4 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
In order to make those skilled in the art better understand the technical solution of the present invention, the technical solution in the embodiment of the present invention will be clearly and completely described below with reference to the drawings in the embodiment of the present invention, and it is obvious that the described embodiment is only a part of the embodiment of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention. In order to make those skilled in the art better understand the technical solution of the present invention, the technical solution in the embodiment of the present invention will be clearly and completely described below with reference to the drawings in the embodiment of the present invention, and it is obvious that the described embodiment is only a part of the embodiment of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In order to make those skilled in the art better understand the technical solution of the present invention, the technical solution in the embodiment of the present invention will be clearly and completely described below with reference to the drawings in the embodiment of the present invention, and it is obvious that the described embodiment is only a part of the embodiment of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention. In order to make those skilled in the art better understand the technical solution of the present invention, the technical solution in the embodiment of the present invention will be clearly and completely described below with reference to the drawings in the embodiment of the present invention, and it is obvious that the described embodiment is only a part of the embodiment of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be understood that the description of first and second is merely for the purpose of referring to and distinguishing different networks, virtual machines, signals, instructions, etc., and the first and second are not defined sequentially.
FIG. 1 is a schematic flow chart diagram of a method of one embodiment of the present application. The implementation subject of fig. 1 may be a device for determining an optimal path of network data traffic.
As shown in fig. 1, the method 100 includes:
and step 130, iteratively updating the fastest path and the consumed time, and acquiring an optimal path according to all the iterated fastest paths when the fastest path is stabilized as a certain path or the iteration times reach the maximum iteration times.
In order to facilitate understanding of the present invention, the following describes a process for determining an optimal path of network data traffic provided by the present invention in combination with a process for determining an optimal path of network data traffic according to the principle of determining an optimal path of network data traffic according to the present invention.
Optionally, as an embodiment of the present application, the determining a first node, a second node, a path number N, a population number, and a maximum number of iterations of a network data traffic path includes:
the population number PopSize is determined according to the formula PopSize ═ 1 × N/1000.
With reference to the first aspect, in a second implementation manner of the first aspect, the iteratively updating the optimal path and the consumed time, and when the fastest path is stabilized as a certain path or the number of iterations reaches the maximum number of iterations, acquiring the optimal path according to all the fastest paths of the iterations includes:
judging whether the fastest path is stable or not, and determining the fastest path as an optimal path when the fastest path is stable as a certain path;
and when the fastest path is not stabilized to be a certain path, judging whether the iteration frequency reaches the maximum iteration frequency, if so, acquiring the optimal path according to all the iterative fastest paths, and otherwise, continuously iteratively updating the fastest path and consuming time.
With reference to the first aspect, in a third implementation manner of the first aspect, the determining whether the fastest path is stable, and when the fastest path is stable as a certain path, determining that the fastest path is the optimal path includes:
setting the number n of times of stabilization of the fastest path;
and when the fastest path is judged to be a certain path repeatedly for n times, determining the fastest path as the optimal path.
Specifically, the method for determining the optimal path of the network data traffic is shown in fig. 2, and includes:
s1, determining a first node a and a second node B of a network data traffic path, where the number of paths N is 10000, the population number PopSize is 1 × N/1000 is 10, and the maximum number of iterations MaxNum is 50;
s2, randomly selecting 10 paths from 10000 paths, sending data to a node B by a node A, and calculating and recording the fastest path of the data to the node B by the node A and the consumed time;
s3, judging whether the fastest path is stable, setting the stabilization times n to be 5, and determining the fastest path to be the optimal path when the fastest path is stable for 5 times;
and S4, otherwise, when the fastest path is not stabilized as a certain path, judging whether the iteration frequency reaches the maximum iteration frequency MaxMum which is 50, if so, obtaining the optimal path according to the fastest path iterated for 50 times, otherwise, repeating S2 to continuously iterate and update the fastest path and consume time.
Therefore, the method and the device are suitable for the scene that the demand for the optimal path in communication is higher than the economic demand, namely the scene that the network communication cost is not used as a reference factor, and the relatively optimal path can be obtained relatively quickly through a drosophila algorithm.
As shown in fig. 3, the apparatus 300 includes:
a determining unit 310, configured to determine a first node, a second node, a path number N, a population number, and a maximum number of iterations of a network data traffic path;
an obtaining unit 320 configured to obtain a fastest path and consumed time for sending data from a first node to a second node of a randomly selected population number path from the N paths;
the obtaining unit 320 is further configured to iteratively update the fastest path and the consumed time, and obtain the optimal path according to all the iterated fastest paths when the fastest path is stabilized as a certain path or the iteration number reaches the maximum iteration number.
Optionally, as an embodiment of the present application, the determining unit 310 is specifically configured to:
the population number PopSize is determined according to the formula PopSize ═ 1 × N/1000.
Optionally, as an embodiment of the present application, the obtaining unit 320 specifically includes:
a first determining unit 321 configured to determine whether the fastest path is stable, and when the fastest path is stable as a certain path, determine that the fastest path is the optimal path;
the second determining unit 322 is configured to determine whether the iteration frequency reaches the maximum iteration frequency when the fastest path is not stabilized as a certain path, obtain an optimal path according to all the iterated fastest paths if the iteration frequency reaches the maximum iteration frequency, and continue to iteratively update the fastest path and consume time if the iteration frequency does not reach the maximum iteration frequency.
Optionally, as an embodiment of the present application, the first determining unit 321 is specifically configured to:
setting the number n of times of stabilization of the fastest path;
and when the fastest path is judged to be a certain path repeatedly for n times, determining the fastest path as the optimal path.
Fig. 4 is a schematic structural diagram of an apparatus 400 according to an embodiment of the present invention, where the apparatus 400 may be used to execute a method for updating a heat dissipation policy parameter according to an embodiment of the present application.
Wherein the device apparatus 400 may comprise: a processor 410, a memory 420, and a communication unit 440. The components communicate via one or more buses, and those skilled in the art will appreciate that the architecture of the servers shown in the figures is not limiting of the application, and may be a bus architecture, a star architecture, a combination of more or fewer components than those shown, or a different arrangement of components.
The memory 420 may be used for storing instructions executed by the processor 410, and the memory 420 may be implemented by any type of volatile or non-volatile memory device or combination thereof, such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic disk or optical disk. The executable instructions in memory 420, when executed by processor 410, enable terminal 400 to perform some or all of the steps in the method embodiments described below.
The processor 410 is a control center of the storage device, connects various parts of the entire electronic device using various interfaces and lines, and performs various functions of the electronic device and/or processes data by operating or executing software programs and/or modules stored in the memory 420 and calling data stored in the memory. The processor may be composed of an Integrated Circuit (IC), for example, a single packaged IC, or a plurality of packaged ICs connected with the same or different functions. For example, the processor 410 may include only a Central Processing Unit (CPU). In the embodiments of the present application, the CPU may be a single arithmetic core or may include multiple arithmetic cores.
A communication unit 440 for establishing a communication channel so that the storage device can communicate with other devices. And receiving user data sent by other equipment or sending the user data to other equipment.
The present application also provides a computer storage medium, wherein the computer storage medium may store a program, and the program may include some or all of the steps in the embodiments provided in the present application when executed. The storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM) or a Random Access Memory (RAM).
Therefore, the present application is applicable to a scenario in which the demand for the optimal path in communication is higher than the economic demand, that is, a scenario in which network communication charges are not used as a reference factor, and a relatively optimal path can be obtained relatively quickly through a drosophila algorithm.
Those skilled in the art will clearly understand that the techniques in the embodiments of the present application may be implemented by way of software plus a required general hardware platform. Based on such understanding, the technical solutions in the embodiments of the present application may be embodied in the form of a software product, where the computer software product is stored in a storage medium, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and the like, and includes several instructions to make a computer device (which may be a personal computer, a server, or a second device, a network device, and the like) perform all or part of the steps of the method in the embodiments of the present invention.
The same and similar parts in the various embodiments in this specification may be referred to each other. Especially, for the terminal embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant points can be referred to the description in the method embodiment.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
Although the present invention has been described in detail by referring to the drawings in connection with the preferred embodiments, the present invention is not limited thereto. Various equivalent modifications or substitutions can be made on the embodiments of the present invention by those skilled in the art without departing from the spirit and scope of the present invention, and these modifications or substitutions are within the scope of the present invention/any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (6)
1. A method for determining an optimal path of network data traffic, the method comprising:
determining a first node, a second node, a path number N, a population number PopSize and a maximum iteration number of a network data traffic path;
acquiring consumption time of a fastest path and a fastest path for transmitting data from a first node to a second node in randomly selected PopSize paths in the N paths;
iteratively updating the fastest path and the consumed time, and acquiring an optimal path according to all the iterative fastest paths when the fastest path is stabilized as a certain path or the iterative times reach the maximum iterative times;
the iterative updating of the optimal path and the time consumption, and when the fastest path is stabilized as a certain path or the number of iterations reaches the maximum number of iterations, obtaining the optimal path according to all the iterated fastest paths comprises:
judging whether the fastest path is stable or not, and determining the fastest path as an optimal path when the fastest path is stable as a certain path;
when the fastest path is not stabilized to be a certain path, judging whether the iteration frequency reaches the maximum iteration frequency, if so, acquiring an optimal path according to all the iterative fastest paths, and otherwise, continuously iteratively updating the fastest path and consuming time;
the judging whether the fastest path is stable or not, and when the fastest path is stable as a certain path, determining that the fastest path is the optimal path includes:
setting the number n of times of stabilization of the fastest path;
and when the fastest path is judged to be a certain path repeatedly for n times, determining the fastest path as the optimal path.
2. The method of claim 1, wherein determining the first node, the second node, the number of paths N, the number of populations PopSize, and the maximum number of iterations for the network data traffic path comprises:
population number PopSize was determined according to the formula PopSize =1 × N/1000.
3. An apparatus for determining an optimal path for network data traffic, the apparatus comprising:
the determining unit is configured to determine a first node, a second node, a path number N, a population number PopSize and a maximum iteration number of a network data traffic path;
the acquisition unit is configured to acquire consumption time for transmitting a fastest path of data from a first node to a second node and a fastest path of the randomly selected PopSize population number paths in the N paths;
the acquisition unit is also configured to iteratively update the fastest path and the consumed time, and when the fastest path is stabilized as a certain path or the iteration times reach the maximum iteration times, the optimal path is acquired according to all the iterated fastest paths;
the acquiring unit specifically includes:
the first judging unit is configured to judge whether the fastest path is stable or not, and when the fastest path is stable as a certain path, the fastest path is determined to be the optimal path;
the second judgment unit is configured to judge whether the iteration frequency reaches the maximum iteration frequency when the fastest path is not stabilized to be a certain path, if so, the optimal path is obtained according to all the iterative fastest paths, and if not, the fastest path and the consumed time are continuously updated in an iterative mode;
the first judging unit specifically includes:
setting the number n of times of stabilization of the fastest path;
and when the fastest path is judged to be a certain path repeatedly for n times, determining the fastest path as the optimal path.
4. The apparatus according to claim 3, wherein the determining unit is specifically configured to:
population number PopSize was determined according to the formula PopSize =1 × N/1000.
5. An apparatus for determining an optimal path for network data traffic, the apparatus comprising:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited by any of claims 1-2.
6. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811039075.5A CN109039907B (en) | 2018-09-06 | 2018-09-06 | Method, device, equipment and storage medium for determining optimal path of network data traffic |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811039075.5A CN109039907B (en) | 2018-09-06 | 2018-09-06 | Method, device, equipment and storage medium for determining optimal path of network data traffic |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109039907A CN109039907A (en) | 2018-12-18 |
| CN109039907B true CN109039907B (en) | 2021-09-17 |
Family
ID=64623856
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811039075.5A Active CN109039907B (en) | 2018-09-06 | 2018-09-06 | Method, device, equipment and storage medium for determining optimal path of network data traffic |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109039907B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111289816B (en) * | 2020-02-11 | 2022-03-15 | 南方电网科学研究院有限责任公司 | Test sequencing optimization method and device for multi-terminal direct-current power transmission system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102843725A (en) * | 2012-08-15 | 2012-12-26 | 无锡北邮感知技术产业研究院有限公司 | Data transmission method and data transmission device |
| CN104299053A (en) * | 2014-10-13 | 2015-01-21 | 国家电网公司 | Method for selecting optimal path of power distribution and utilization communication network based on genetic algorithm |
| CN105446339A (en) * | 2015-12-22 | 2016-03-30 | 安徽工程大学 | Mobile robot path planning method |
| CN107094112A (en) * | 2017-03-31 | 2017-08-25 | 西南交通大学 | Bandwidth constraint multicast routing optimization method based on drosophila optimized algorithm |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102360452A (en) * | 2011-10-26 | 2012-02-22 | 西安电子科技大学 | Method for figuring out shortest path of large scale graphs based on fewest resource neural networks |
| CN103186710B (en) * | 2011-12-31 | 2016-08-31 | 北京金山软件有限公司 | Optimum route search method and system |
| CN103945482A (en) * | 2013-06-14 | 2014-07-23 | 北京信息科技大学 | Energy optimization routing algorithm in consideration of energy balance |
| US10395520B2 (en) * | 2016-12-19 | 2019-08-27 | Here Global B.V. | Method and apparatus for constructing a traffic model |
-
2018
- 2018-09-06 CN CN201811039075.5A patent/CN109039907B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102843725A (en) * | 2012-08-15 | 2012-12-26 | 无锡北邮感知技术产业研究院有限公司 | Data transmission method and data transmission device |
| CN104299053A (en) * | 2014-10-13 | 2015-01-21 | 国家电网公司 | Method for selecting optimal path of power distribution and utilization communication network based on genetic algorithm |
| CN105446339A (en) * | 2015-12-22 | 2016-03-30 | 安徽工程大学 | Mobile robot path planning method |
| CN107094112A (en) * | 2017-03-31 | 2017-08-25 | 西南交通大学 | Bandwidth constraint multicast routing optimization method based on drosophila optimized algorithm |
Non-Patent Citations (2)
| Title |
|---|
| 基于果蝇优化算法的最短路径路由优化;左岑;《山东农业大学学报（自然科学版）》;20160630;全文 * |
| 求解TSP问题的改进果蝇优化算法;段艳明，肖辉辉;《计算机工程与应用》;20160630;第145-146页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109039907A (en) | 2018-12-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108875035B (en) | Data storage method of distributed file system and related equipment | |
| CN111064776B (en) | Block generation method in block chain, accounting node and storage medium | |
| CN114048931B (en) | Replenishment information generation method and device, electronic equipment and computer readable medium | |
| JP2007235681A (en) | Distribution tree configuration apparatus, distribution tree configuration method and program for distribution tree configuration | |
| CN112506584A (en) | Resource file loading method, device, equipment, storage medium and product | |
| CN109039907B (en) | Method, device, equipment and storage medium for determining optimal path of network data traffic | |
| CN108347377B (en) | Data forwarding method and device | |
| CN115048254A (en) | Simulation test method, system, equipment and readable medium of data distribution strategy | |
| CN111161072A (en) | Block chain-based random number generation method, equipment and storage medium | |
| CN108196943B (en) | Virtual machine management method and device | |
| EP2797260B1 (en) | Risk mitigation in data center networks | |
| CN112003730A (en) | Method, system, terminal and storage medium for rapid cluster deployment | |
| CN108810130B (en) | Method and device for planning distribution request | |
| CN114492849B (en) | Model updating method and device based on federal learning | |
| CN109104446B (en) | Message order-preserving method, network node and storage medium | |
| CN115408034A (en) | Vehicle-mounted controller upgrading method and device, electronic equipment and storage medium | |
| CN106557430B (en) | A kind of data cached brush method and device | |
| CN114049065A (en) | Data processing method, device and system | |
| CN114157578A (en) | Network state prediction method and device | |
| CN109144991A (en) | Dynamic divides method, apparatus, electronic equipment and the computer of table can storage medium | |
| CN113691403A (en) | Topological node configuration method, related device and computer program product | |
| CN113656046A (en) | Application deployment method and device | |
| CN109151007B (en) | Data processing method, core server and transmission server for application scheduling | |
| CN113778982A (en) | Data migration method and device | |
| CN110928758B (en) | Method and device for generating test cases |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | 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 |