CN115550240B - Network routing method, system, electronic device and readable storage medium - Google Patents
Network routing method, system, electronic device and readable storage medium Download PDFInfo
- Publication number
- CN115550240B CN115550240B CN202211480920.9A CN202211480920A CN115550240B CN 115550240 B CN115550240 B CN 115550240B CN 202211480920 A CN202211480920 A CN 202211480920A CN 115550240 B CN115550240 B CN 115550240B
- Authority
- CN
- China
- Prior art keywords
- node
- neighbor
- current source
- nodes
- target
- 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
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/02—Topology update or discovery
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a network routing method, a system, an electronic device and a readable storage medium, wherein the network routing method comprises the following steps: searching neighbor nodes of the current source node; if the neighbor node of the current source node does not contain the target node, searching whether the neighbor node of the current source node contains the neighbor node of the target node; if the neighbor node of the current source node does not contain the neighbor node of the target node, calculating the priority probability of the neighbor node of the current source node, selecting one neighbor node of the current source node according to the priority probability, and transmitting an information packet to the selected neighbor node; and setting the selected neighbor node as a new current source node, and returning to the step of searching the neighbor node of the current source node until the target node or the neighbor node of the target node is searched. The invention can shorten the path length and waiting time of the information packet to the target node and improve the throughput of the network.
Description
Technical Field
Embodiments of the present invention relate to the field of communications technologies, and in particular, to a network routing method, system, electronic device, and readable storage medium.
Background
With the rapid increase of the number of information and users, when a large amount of concurrent information is generated in the network and is not processed in time, the communication capability of the network is reduced, and the network is congested.
Currently, existing network routing strategies are broadly divided into three types: a global routing strategy that each node needs to know topology information of the whole network is required; only the routing strategy of the local topological structure information of the nodes needs to be known; a hybrid routing policy that combines global and local type routing policies.
However, in the existing routing strategy, the path length of the packet to the destination node is long, and the packet waiting time is long, which affects the packet transfer rate and the packet throughput in the network.
Disclosure of Invention
Embodiments of the present invention provide a network routing method, system, electronic device, and readable storage medium, which are used to solve the problems of low transmission rate of packets and low throughput of packets in a network.
In order to solve the technical problem, the invention is realized as follows:
in a first aspect, an embodiment of the present invention provides a network routing method, including:
receiving a mode switch signal transmitted by a vehicle mode switch;
searching neighbor nodes of the current source node;
if the neighbor node of the current source node does not contain the target node, searching whether the neighbor node of the current source node contains the neighbor node of the target node;
if the neighbor node of the current source node does not contain the neighbor node of the target node, calculating the priority probability of the neighbor node of the current source node, selecting one neighbor node of the current source node according to the priority probability, and transmitting an information packet to the selected neighbor node;
and setting the selected neighbor node as a new current source node, and returning to the step of searching the neighbor node of the current source node until the target node or the neighbor node of the target node is searched.
Optionally, before searching for all neighbor nodes of the current source node, the method further includes:
generating a network, and calculating and setting network parameters;
the network parameters include at least one of:
a packet generation rate, which is the number of packets generated in the network per unit time;
the capability of a node to process packets, the number of packets processed by the node per unit time being the number of packets processed by the node;
a degree of a node, the degree of the node being a number of edges associated with the node;
the betweenness of the nodes is the proportion of the number of shortest paths passing through the nodes in the network to the total number of the shortest paths in the network;
a packet queue length, the packet queue length being a maximum number of packet transfer requests that can be waited in a queue at a given time;
wherein, setting the network parameter comprises: and setting the number of the selected neighbor nodes for transmitting the information packets as the capability of the nodes for processing the information packets, and setting the capability of the nodes for processing the information packets as the degree of the nodes.
Optionally, the network further includes:
the network comprises a plurality of nodes, R pairs of source nodes and target nodes are selected from the plurality of nodes, and if the source nodes are the same as the target nodes, the source nodes and the target nodes are reselected;
wherein R is equal to the packet generation rate.
Optionally, after searching for the neighbor node of the current source node, the method further includes:
and when the neighbor nodes of the current source node contain the target node, directly transmitting the information packet to the target node, and deleting the information packet from the target node.
Optionally, after searching whether the neighbor node of the target node is included in the neighbor nodes of the current source node, the method further includes:
if the neighbor node of the current source node comprises the neighbor node of the target node, transmitting an information packet to the neighbor node of the target node;
and directly transmitting the information packet to the target node, and deleting the information packet from the target node.
Optionally, the priority probability is proportional to the betweenness of the nodes and inversely proportional to the length of the packet queue.
Optionally, the formula for calculating the priority probability includes:
wherein the content of the first and second substances,
；
wherein i is a current source node, i =1,2, \8230, n, j is a neighbor node of the current source node, j =1,2, \8230, n, L j For the length of the queue queued for node j,
is the betweenness of the node j,
is an adjustable parameter that is,
the priority degree of receiving the information packet by the node j is reflected, and the priority degree is in direct proportion to the betweenness of the nodes and in inverse proportion to the length of the information packet queue.
In a second aspect, an embodiment of the present invention provides a network routing system, including:
the first searching module is used for searching neighbor nodes of the current source node;
the second searching module is used for searching whether the neighbor node of the current source node contains the neighbor node of the target node or not if the neighbor node of the current source node does not contain the target node;
the first processing module is used for calculating the priority probability of the neighbor node of the current source node if the neighbor node of the current source node does not contain the neighbor node of the target node, selecting one neighbor node of the current source node according to the priority probability and transmitting an information packet to the selected neighbor node;
and the second processing module sets the selected neighbor node as a new current source node and returns to the step of searching the neighbor node of the current source node until the target node or the neighbor node of the target node is searched.
In a third aspect, an embodiment of the present invention provides an electronic device, including: a processor, a memory and a program stored on the memory and executable on the processor, the program, when executed by the processor, implementing the steps of the network routing method as described in the first aspect above.
In a fourth aspect, the present invention provides a computer-readable storage medium, on which a computer program is stored, and when executed by a processor, the computer program implements the steps of the network routing method according to the first aspect.
In the embodiment of the invention, if the neighbor nodes of the current source node do not comprise the target node and the neighbor nodes of the target node, the information packet is transmitted to one neighbor node of the current source node according to the priority probability, so that the path length and the waiting time of the information packet reaching the target node are shortened, and the transmission rate of the information packet and the throughput of a network are improved.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
fig. 1 is a schematic flowchart of a network routing method according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a network routing system according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating a network routing process performed by the pre-processing module according to an embodiment of the present invention;
fig. 4 is a schematic diagram of a packet forwarding module according to an embodiment of the present invention executing a network routing process;
fig. 5 is a schematic structural diagram of a network routing system according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. 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.
Referring to fig. 1 and fig. 2, an embodiment of the present invention provides a network routing method, including:
step 11: searching neighbor nodes of the current source node;
step 12: if the neighbor node of the current source node does not contain the target node, searching whether the neighbor node of the current source node contains the neighbor node of the target node;
step 13: if the neighbor node of the current source node does not contain the neighbor node of the target node, calculating the priority probability of the neighbor node of the current source node, selecting one neighbor node of the current source node according to the priority probability, and transmitting an information packet to the selected neighbor node;
step 14: setting the selected neighbor node as a new current source node, and returning to the step of searching the neighbor node of the current source node until the target node or the neighbor node of the target node is searched;
in the process of transmitting the information packet to the neighbor node, there is a case of unsuccessful transmission, optionally, the selected neighbor node is a neighbor node of successful transmission;
executing step 14, if there is a case of trapping into a dead cycle, for example, the current source node is the node 1, sequentially executing step 11, step 12, and step 13, selecting the node 2 as a neighbor node selected by the current source node 1 according to the priority probability, and executing step 14 to set the node 2 as a new current source node; and (3) sequentially executing the step (11), the step (12) and the step (13), selecting the node (1) as a neighbor node selected by the current source node (2) according to the priority probability, executing the step (14), setting the node (1) as a new current source node, still setting the node (2) as the current source node in the next round of circulation, and trapping in the dead circulation that the node (1) and the node (2) mutually transmit information packets. To solve this problem, optionally, if the packet passes through the same path 2 times, the path is deleted, and the process returns to step 13 again.
In the embodiment of the invention, if the neighbor nodes of the current source node do not comprise the target node and the neighbor nodes of the target node, the information packet is transmitted to one of the neighbor nodes of the current source node according to the priority probability, so that the path length and the waiting time of the information packet reaching the target node are shortened, and the transmission rate of the information packet and the throughput of a network are improved.
The preprocessing in fig. 2 is preprocessing before packet transmission, and R pairs of source nodes and destination nodes are randomly selected after the network is generated. The transfer information packet is that the information packet of the source node is transferred to the target node and the information packet is deleted from the target node.
In this embodiment of the present invention, optionally, referring to fig. 3, before searching for all neighbor nodes of the current source node, the method further includes: generating a network, and calculating and setting network parameters;
the network parameters include at least one of:
1) A packet generation rate, which is the number of packets generated in the network per unit time;
2) The capacity of a node to process information packets, wherein the node to process information packets is the number of nodes processing information in unit time;
3) The degree of a node, which is the number of edges associated with the node;
4) The betweenness of the nodes is the proportion of the number of shortest paths passing through the nodes in the network to the total number of the shortest paths in the network;
two non-adjacent nodes in the network have a shortest path, and the node with a large betweenness number is the node with a large number of times that the shortest path passes through in the network;
5) A packet queue length, the packet queue length being a maximum number of packet transfer requests that can be waited in a queue at a given time;
optionally, the length of the packet queue is set to infinity, that is, the maximum number of packet transfer requests that can be waited in the queue at a given time is infinite.
Wherein, setting the network parameter comprises: and setting the number of the selected neighbor nodes for transmitting the information packets as the capability of the nodes for processing the information packets, and setting the capability of the nodes for processing the information packets as the degree of the nodes.
Optionally, the network further includes:
the network comprises a plurality of nodes, R pairs of source nodes and target nodes are selected from the plurality of nodes, and if the source nodes are the same as the target nodes, the source nodes and the target nodes are reselected;
wherein R is equal to the packet generation rate;
an information packet corresponds to a pair of source node and target node, the generation rate of the information packet is a known parameter, the routing process of the information packet and the generation process of the information packet are synchronously carried out, the logarithm of the source node and the logarithm of the target node selected in the network are equal to the number of the information packets generated by the network in unit time, and the selection of the source node and the target node is random.
In the embodiment of the present invention, optionally, referring to fig. 4, when it is found that the neighbor node of the current source node includes the target node, the information packet is directly transmitted to the target node, and the information packet is deleted from the target node.
The traditional routing strategy ignores the local topological structure information of the target node in the routing process of the information packet, and when the neighbor node of the source node comprises the neighbor node of the target node, the traditional routing strategy still executes the set path, so that the routing transmission path is increased, and the transmission rate of the information packet is reduced. In the embodiment of the present invention, in order to solve the above problem, optionally, if the neighbor node of the current source node includes the neighbor node of the target node, an information packet is transmitted to the neighbor node of the target node, the information packet is directly transmitted to the target node, and the information packet is deleted from the target node, where the neighbor node of the target node is a known neighbor node of the target node, that is, a neighbor node of the target node obtained when a network is generated.
In the embodiment of the present invention, optionally, the priority probability is proportional to the betweenness of the nodes, and inversely proportional to the length of the packet queuing queue.
In a network, the node with large betweenness is the node with more times of passing the shortest path in the network, and the priority probability is in direct proportion to the betweenness of the nodes, namely, the information packet is transmitted to the node with large betweenness, so that the path length reaching the target node can be shortened, and the time consumed by the information packet to reach the target node is reduced. The priority probability is inversely proportional to the length of the packet queue, that is, the nodes with large number of packets waiting for transmission avoid receiving new packets, thereby reducing node congestion.
The priority probability is the probability of transmitting the information packet to the neighbor node of the current source node, and does not represent that the information packet is transmitted to the neighbor node with high priority probability. For example, the current source node 3 has a neighboring node 4 and a neighboring node 5, where the priority probability of the node 4 is 60%, the priority probability of the node 5 is 40%, which indicates that the probability of the packet being transmitted to the node 4 is 60%, and the probability of the packet being transmitted to the node 5 is 40%.
In this embodiment of the present invention, optionally, the formula for calculating the priority probability includes:
wherein the content of the first and second substances,
；
wherein i is the current source node, i =1,2, \8230, n, j is the neighbor node of the current source node, j =1,2, \8230, n, L j For the length of the queue queued for node j,
is a nodeThe number of the intermediate numbers of j is,
is an adjustable parameter that is,
the priority degree of receiving the information packet by the node j is reflected, and the priority degree is in direct proportion to the betweenness of the nodes and in inverse proportion to the length of the information packet queue.
Before the priority probability is calculated, calculating the betweenness B of each neighbor node of the current source node j And packet queue length L j 。
Referring to fig. 5, the present invention further provides a network routing system 50, including:
a search module 52, comprising:
the first searching module 521 is configured to search for a neighbor node of a current source node;
a second searching module 522, configured to search whether a neighbor node of the current source node includes a neighbor node of the target node if the neighbor node of the current source node does not include the target node;
a processing module 53 comprising:
a first processing module 531, configured to calculate a priority probability of a neighbor node of the current source node if the neighbor node of the current source node does not include the neighbor node of the target node, select one of the neighbor nodes of the current source node according to the priority probability, and transmit an information packet to the selected neighbor node;
the second processing module 532 sets the selected neighbor node as a new current source node, and returns to the step of searching for the neighbor node of the current source node until the target node or the neighbor node of the target node is searched.
Optionally, the network parameter includes at least one of:
a packet generation rate, which is the number of packets generated in the network per unit time;
the capability of a node to process packets, the number of packets processed by the node per unit time being the number of packets processed by the node;
a degree of a node, the degree of the node being a number of edges associated with the node;
the betweenness of the nodes is the proportion of the number of paths passing through the nodes in all shortest paths in the network to the total number of the shortest paths;
a packet queue length, the packet queue length being a maximum number of packet transfer requests that can be waited in a queue at a given time;
wherein, setting the network parameter comprises: and setting the number of the selected neighbor nodes for transmitting the information packets as the capability of the nodes for processing the information packets, and setting the capability of the nodes for processing the information packets as the degree of the nodes.
Optionally, the network routing system 50 further includes:
the preprocessing module 51 is configured to generate a network, calculate and set network parameters, randomly select R pairs of source nodes and target nodes, and reselect the source nodes and the target nodes if the source nodes and the target nodes are the same;
wherein R is equal to the packet generation rate.
Optionally, the network routing system 50 further includes:
and the third processing module is used for directly transmitting the information packet to the target node and deleting the information packet from the target node when the neighbor nodes of the current source node contain the target node.
Optionally, the network routing system 50 further includes:
the fourth processing module is used for transmitting an information packet to the neighbor node of the target node if the neighbor node of the current source node comprises the neighbor node of the target node; and directly transmitting the information packet to the target node, and deleting the information packet from the target node.
Optionally, the priority probability is proportional to the betweenness of the nodes, and inversely proportional to the length of the packet queue.
Optionally, the formula for calculating the priority probability includes:
wherein, the first and the second end of the pipe are connected with each other,
；
wherein i is the current source node, i =1,2, \8230, n, j is the neighbor node of the current source node, j =1,2, \8230, n, L j For the length of the queuing queue for node j,
is the betweenness of the node j,
is an adjustable parameter that is, for example,
the priority degree of receiving the information packet by the node j is reflected, and is in direct proportion to the betweenness of the nodes and in inverse proportion to the length of the queue of the information packet.
Referring to fig. 6, an embodiment of the present invention further provides an electronic device 60, which includes a processor 61, a memory 62, and a computer program stored in the memory 62 and capable of running on the processor 61, where the computer program is executed by the processor 61 to implement each process of the foregoing network routing method embodiment, and can achieve the same technical effect, and is not described herein again to avoid repetition.
The embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program implements each process of the foregoing network routing method embodiment, and can achieve the same technical effect, and in order to avoid repetition, details are not repeated here. The computer-readable storage medium may be a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrases "comprising a component of' 8230; \8230;" does not exclude the presence of another like element in a process, method, article, or apparatus that comprises the element.
Through the description of the foregoing embodiments, it is clear to those skilled in the art that the method of the foregoing embodiments may be implemented by software plus a necessary general hardware platform, and certainly may also be implemented by hardware, but in many cases, the former is a better implementation. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal (such as a mobile phone, a computer, a server, an air conditioner, or a network device) to execute the method according to the embodiments of the present invention.
While the present invention has been described with reference to the embodiments shown in the drawings, the present invention is not limited to the embodiments, which are illustrative and not restrictive, and it will be apparent to those skilled in the art that various changes and modifications can be made therein without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (10)
1. A network routing method, comprising:
searching neighbor nodes of the current source node;
if the neighbor node of the current source node does not contain the target node, searching whether the neighbor node of the current source node contains the neighbor node of the target node;
if the neighbor node of the current source node does not contain the neighbor node of the target node, calculating the priority probability of the neighbor node of the current source node, selecting one neighbor node of the current source node according to the priority probability, and transmitting an information packet to the selected neighbor node;
and setting the selected neighbor node as a new current source node, and returning to the step of searching the neighbor node of the current source node until the target node or the neighbor node of the target node is searched.
2. The method of claim 1, further comprising, before searching for all neighboring nodes of the current source node:
generating a network, and calculating and setting network parameters;
wherein the network comprises a plurality of nodes;
the network parameters include at least one of:
a packet generation rate, which is the number of packets generated in the network per unit time;
the capacity of a node to process information packets, wherein the node to process information packets is the number of nodes processing information in unit time;
a degree of a node, the degree of the node being a number of edges associated with the node;
the betweenness of the nodes is the proportion of the number of shortest paths passing through the nodes in the network to the total number of the shortest paths in the network;
a packet queue length, the packet queue length being a maximum number of packet transfer requests that can be waited in a queue at a given time;
wherein, setting the network parameter comprises: and setting the number of the selected neighbor nodes for transmitting the information packets as the capability of the nodes for processing the information packets, and setting the capability of the nodes for processing the information packets as the degree of the nodes.
3. The method of claim 1, wherein searching for neighbor nodes of the current source node further comprises:
selecting R pairs of source nodes and target nodes from a plurality of nodes of the network, and if the source nodes are the same as the target nodes, reselecting;
wherein R is equal to the packet generation rate.
4. The method of claim 1, wherein searching for neighbor nodes of the current source node further comprises:
and when the neighbor nodes of the current source node contain the target node, directly transmitting the information packet to the target node, and deleting the information packet from the target node.
5. The method of claim 1, wherein searching whether the neighbor nodes of the target node are included in the neighbor nodes of the current source node further comprises:
if the neighbor node of the current source node comprises the neighbor node of the target node, transmitting an information packet to the neighbor node of the target node;
and directly transmitting the information packet to the target node, and deleting the information packet from the target node.
6. The method of claim 2, wherein the priority probability is proportional to the betweenness of the nodes and inversely proportional to the packet queue length.
7. The method of claim 6, wherein the formula for calculating the precedence probability comprises:
wherein, the first and the second end of the pipe are connected with each other,
；
wherein i is the current source node, i =1,2, \8230, n, j is the neighbor node of the current source node, j =1,2, \8230, n, L j For the length of the queuing queue for node j,
is the betweenness of the node j,
is an adjustable parameter that is,
the priority degree of receiving the information packet by the node j is reflected, and the priority degree is in direct proportion to the betweenness of the nodes and in inverse proportion to the length of the information packet queue.
8. A network routing system, comprising;
the first searching module is used for searching neighbor nodes of the current source node;
the second searching module is used for searching whether the neighbor node of the current source node contains the neighbor node of the target node or not if the neighbor node of the current source node does not contain the target node;
the first processing module is used for calculating the priority probability of the neighbor nodes of the current source node if the neighbor nodes of the current source node do not contain the neighbor nodes of the target node, selecting one neighbor node of the current source node according to the priority probability and transmitting an information packet to the selected neighbor node;
and the second processing module sets the selected neighbor node as a new current source node and returns to the step of searching the neighbor node of the current source node until the target node or the neighbor node of the target node is searched.
9. An electronic device, comprising; a processor, a memory and a program stored on the memory and executable on the processor, the program when executed by the processor implementing the steps of the network routing method of any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that a computer program is stored on the computer-readable storage medium, which computer program, when being executed by a processor, carries out the steps of the network routing method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211480920.9A CN115550240B (en) | 2022-11-24 | 2022-11-24 | Network routing method, system, electronic device and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211480920.9A CN115550240B (en) | 2022-11-24 | 2022-11-24 | Network routing method, system, electronic device and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115550240A CN115550240A (en) | 2022-12-30 |
| CN115550240B true CN115550240B (en) | 2023-03-10 |
Family
ID=84720978
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211480920.9A Active CN115550240B (en) | 2022-11-24 | 2022-11-24 | Network routing method, system, electronic device and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115550240B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7640339B1 (en) * | 2005-02-14 | 2009-12-29 | Sun Microsystems, Inc. | Method and apparatus for monitoring a node in a distributed system |
| CN103024856A (en) * | 2012-12-31 | 2013-04-03 | 上海交通大学 | Application method of location heuristic factor in establishment of wireless ad hoc network energy-saving routing |
| CN109982406A (en) * | 2019-04-11 | 2019-07-05 | 湖南工业大学 | A kind of vehicle-carrying communication method for routing |
| CN114997877A (en) * | 2021-08-25 | 2022-09-02 | 福建宏创科技信息有限公司 | Network topology data analysis method of IP of virtual currency public link network transaction node, storage medium and electronic equipment |
| CN115102963A (en) * | 2021-08-25 | 2022-09-23 | 福建宏创科技信息有限公司 | IP (Internet protocol) distinguishing method, storage medium and electronic equipment of neighbor nodes based on virtual currency public link network transaction nodes |
| CN115329146A (en) * | 2022-08-10 | 2022-11-11 | 中国人民解放军国防科技大学 | Link prediction method in time series network, electronic device and storage medium |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090023448A1 (en) * | 2007-02-21 | 2009-01-22 | Qualcomm Incorporated | Method and apparatus for inter-system handover |
| JP5866922B2 (en) * | 2011-09-22 | 2016-02-24 | 富士ゼロックス株式会社 | Search device and program |
| CN104093166A (en) * | 2014-07-08 | 2014-10-08 | 南京信息工程大学 | Wireless sensor network connection recovery method based on minimum movement of nodes |
| CN104954263B (en) * | 2015-06-24 | 2018-07-31 | 广东中标数据科技股份有限公司 | A kind of searching method and device of complex network destination node |
| CN114070773B (en) * | 2021-10-13 | 2023-04-25 | 杭州电子科技大学 | Space network routing strategy based on shortest path length |
| CN114710817B (en) * | 2022-02-23 | 2024-05-07 | 广东技术师范大学 | Method, device and equipment for determining underwater network data transmission path |
-
2022
- 2022-11-24 CN CN202211480920.9A patent/CN115550240B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7640339B1 (en) * | 2005-02-14 | 2009-12-29 | Sun Microsystems, Inc. | Method and apparatus for monitoring a node in a distributed system |
| CN103024856A (en) * | 2012-12-31 | 2013-04-03 | 上海交通大学 | Application method of location heuristic factor in establishment of wireless ad hoc network energy-saving routing |
| CN109982406A (en) * | 2019-04-11 | 2019-07-05 | 湖南工业大学 | A kind of vehicle-carrying communication method for routing |
| CN114997877A (en) * | 2021-08-25 | 2022-09-02 | 福建宏创科技信息有限公司 | Network topology data analysis method of IP of virtual currency public link network transaction node, storage medium and electronic equipment |
| CN115102963A (en) * | 2021-08-25 | 2022-09-23 | 福建宏创科技信息有限公司 | IP (Internet protocol) distinguishing method, storage medium and electronic equipment of neighbor nodes based on virtual currency public link network transaction nodes |
| CN115329146A (en) * | 2022-08-10 | 2022-11-11 | 中国人民解放军国防科技大学 | Link prediction method in time series network, electronic device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115550240A (en) | 2022-12-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11700322B2 (en) | Service process control method and network device | |
| US7382731B1 (en) | Method and apparatus for updating probabilistic network routing information | |
| US11665084B2 (en) | Method and apparatus for determining forwarding port in information centeric network | |
| CN110601973A (en) | Route planning method, system, server and storage medium | |
| CN110943918B (en) | Networking method of centerless multi-channel concurrent transmission system | |
| CN113285923B (en) | Data security transmission method and storage medium based on air-sea cross-domain communication gateway | |
| CN104301222A (en) | Wireless ad hoc network credible routing protocol based on package transmission rate | |
| CN106255228B (en) | Method for establishing network connection, terminal equipment and node equipment | |
| CN107770771B (en) | Routing method for adding privacy protection in opportunity network | |
| CN112637061B (en) | Dynamic multi-factor path calculation method based on heuristic algorithm | |
| CN115550240B (en) | Network routing method, system, electronic device and readable storage medium | |
| CN108512765B (en) | Network content diffusion method based on network node distributed Pagerank | |
| Pu | Pro^NDN: MCDM-Based Interest Forwarding and Cooperative Data Caching for Named Data Networking | |
| CN106804053B (en) | Unicast routing method based on adaptive attractor selection in mobile self-organizing network | |
| CN109039896B (en) | Routing method and device suitable for spatial information network | |
| CN115277720B (en) | Multicast group management method, device, equipment and storage medium | |
| CN109150708B (en) | Method and device for selecting data forwarding interface | |
| JP5035410B2 (en) | Address search method and packet processing apparatus | |
| CN115277572A (en) | Congestion control method and system for multi-source multi-sink network | |
| CN110048948B (en) | DTN network data prediction forwarding method, device and medium based on initial social relationship | |
| CN109600421B (en) | Method for selecting distributed computing resources in wireless cloud computing system | |
| Abbas et al. | Opportunistic routing protocols based on fuzzy logic: present and future directions | |
| CN114553742B (en) | Network congestion node identification method and system based on ant colony algorithm | |
| Jaegal et al. | An efficient flooding algorithm for position-based wireless ad hoc networks | |
| EP4340318A1 (en) | Routing obtaining method and apparatus, storage medium, and electronic apparatus |
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 |