CN113923155A - Shortest path algorithm-based alliance link communication method and system - Google Patents

Shortest path algorithm-based alliance link communication method and system Download PDF

Info

Publication number
CN113923155A
CN113923155A CN202111475859.4A CN202111475859A CN113923155A CN 113923155 A CN113923155 A CN 113923155A CN 202111475859 A CN202111475859 A CN 202111475859A CN 113923155 A CN113923155 A CN 113923155A
Authority
CN
China
Prior art keywords
node
message
delay
routing
neighbor table
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202111475859.4A
Other languages
Chinese (zh)
Other versions
CN113923155B (en
Inventor
尤士豪
陈权
臧铖
陈嘉俊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Yiqiyin Hangzhou Technology Co Ltd
China Zheshang Bank Co Ltd
Original Assignee
China Zheshang Bank Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Zheshang Bank Co Ltd filed Critical China Zheshang Bank Co Ltd
Priority to CN202111475859.4A priority Critical patent/CN113923155B/en
Publication of CN113923155A publication Critical patent/CN113923155A/en
Application granted granted Critical
Publication of CN113923155B publication Critical patent/CN113923155B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/121Shortest path evaluation by minimising delays
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/20Hop count for routing purposes, e.g. TTL
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/70Routing based on monitoring results

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a method and a system for alliance link communication based on a shortest path algorithm. Each node in the alliance chain sends a detection message to an adjacent node at regular time, calculates network time delay and updates a neighbor table; each node sends routing information containing a neighbor table to an adjacent node at regular time, exchanges neighbor table information and updates the neighbor table; each node calculates the shortest paths from the node to all other nodes in the alliance chain according to the neighbor table and based on a shortest path algorithm, and updates the routing table of the node; when the node sends the common message, the shortest path of the destination node is selected from the routing list to send. The method and the system designed by the invention can automatically search the shortest path for communication, can ensure the availability of the link when partial nodes are down or the communication link is unstable, have less redundant messages, are easy to expand and have stable and reliable communication quality.

Description

Shortest path algorithm-based alliance link communication method and system
Technical Field
The invention belongs to the technical field of block chain network communication, and particularly relates to a method and a system for alliance chain communication based on a shortest path algorithm.
Background
The block chain communicates through a Peer-To-Peer (P2P) network, the P2P network is a distributed network, and data can be directly transmitted among nodes in the network without being transferred through a server. In general, each node in the blockchain alliance chain is connected with each other two by two to construct a fully-connected P2P network, but once the number of nodes in the fully-connected network increases, the network complexity is high and the deployment is difficult. And the communication network has the problems of poor service quality of part of communication links, good service quality of the communication links, bad service quality of the communication links and the like.
The shortest path algorithm is used to compute the shortest path between two points. The Dijkstra algorithm applies a greedy algorithm mode, is one of the best methods for solving the shortest path at present, solves the problem of the shortest path from a single source point to other vertexes in a directed graph, and is mainly characterized in that the next vertex selected during each iteration is the vertex which is closest to the source point and is outside a mark point. The Floyd (freouard) algorithm is a classic dynamic programming algorithm and is an algorithm for solving the shortest path between any two points, and the shortest path problem of a directed graph or a negative weight can be correctly processed. The Bellman-Ford algorithm can also handle the shortest path problem of directed graphs or negative weights, but the Bellman-Ford algorithm has a time complexity of o (ve), which is slower than the Dijkstra algorithm. The Shortest Path Fast Algorithm (SPFA)) is generally known as a queue-optimized Bellman-Ford Algorithm, and is an Algorithm for solving the single-source Shortest Path of a directed weighted graph.
Disclosure of Invention
The invention aims to provide a method and a system for alliance link communication based on a shortest path algorithm aiming at the defects of the existing block link technology, which are used for establishing a reliable alliance link network, improving the availability and stability of a communication link of the alliance link network and reducing the complexity of node deployment.
The purpose of the invention is realized by the following technical scheme:
according to a first aspect of the present specification, there is provided a method of federation chain communication based on a shortest path algorithm, the method comprising:
each node in the alliance chain maintains a neighbor table and a routing table;
the neighbor table comprises an index-node identifier comparison table, a network delay matrix of the whole network and a delay updating time table, wherein the index-node identifier comparison table records the mapping relation between the identifier of each node in the alliance chain network and the index in the table, the network delay matrix is a two-dimensional matrix and records the delay data among the nodes in the alliance chain network, and the delay updating time table records the time stamp of the data of each node in the network delay matrix;
recording the shortest paths from the node to all other nodes in the alliance chain based on the shortest path algorithm and calculated according to the neighbor table in the routing table;
each node in the alliance chain sends a detection message to an adjacent node at regular time, calculates network time delay and updates a network time delay matrix of a neighbor table of the node;
the adjacent node is a node which establishes direct connection with the node in the alliance chain;
each node sends routing information containing a neighbor table to an adjacent node at regular time, exchanges neighbor table information and updates the neighbor table;
each node regularly updates a routing table of the node;
when the node sends the common message, adding destination node information into the message load, selecting a first node in the shortest path from a routing table according to the destination node, and sending the message to the first node;
after receiving the common message, the node firstly judges the destination node in the message load, if the node is self, the node is directly processed, and if not, the node selects the shortest path to forward the message according to the routing table of the node.
Further, the shortest path algorithm adopts Dijkstra algorithm, Floyd algorithm, Bellman-Ford algorithm or SPFA algorithm.
Furthermore, each time the node sends the detection message to calculate the network time delay, the sending time is recorded, the reply time is recorded, the time delay is the difference between the two times, the time delay data is divided into different grades without directly adopting the time delay data, and the time delay data is endowed with a score according to the grades.
Further, the delay data are divided into five different levels of excellence, good, common, failing and disconnection, the lower the delay data is, the smaller the score is, and the corresponding relation among the levels, the delay data and the score is as follows:
(1) the method has the advantages that: 0-100 ms, score: 50;
(2) good: 100 ms-300 ms, score: 200 of a carrier;
(3) the method comprises the following steps: 300 ms-500 ms, score: 400, respectively;
(4) failing to meet the requirements: 500 ms-1000 ms, score: 750;
(5) disconnecting: 1000ms, score: 10000.
furthermore, each node sends a routing message containing the neighbor table of the node to the adjacent node with the time delay data meeting the requirement at regular time.
Further, after receiving the routing message of the adjacent node, the node respectively compares the delay updating time and the network delay of the received neighbor table and the self neighbor table according to the index of the neighbor table in the routing message, if the delay updating time of the corresponding index in the received neighbor table is greater than the delay updating time of the corresponding index in the self neighbor table and the network delays of the corresponding indexes are different, the network delay matrix and the delay updating time table of the self neighbor table are updated, the self routing table is triggered and updated at the same time, and finally each node maintains a neighbor table containing all node information of the alliance chain.
Further, each node in the alliance chain is based on a shortest path algorithm at regular time, the shortest paths from the node to all other nodes in the alliance chain are calculated according to the neighbor table to serve as optimal paths, the routing table of the node is updated, when the shortest paths are calculated, if different path distances are the same, one of the shortest paths is randomly selected to serve as the shortest path, and if a target node is directly connected with the node and time delay data meet requirements, the path to the target node is directly used as the shortest path.
Further, when the node sends the common message, the message load also comprises the survival time TTL, the TTL is reduced by one in each relay forwarding, if the TTL is equal to zero after multiple relay forwarding or the message does not reach the destination node, the TTL is exhausted, and the message is discarded.
According to a second aspect of the present specification, there is provided a federation chain communication system based on a shortest path algorithm, the system comprising:
the neighbor table maintenance module is used for maintaining a neighbor table of each node in the alliance chain, wherein the neighbor table comprises an index-node identifier comparison table, a network delay matrix of the whole network and a delay updating time table, the index-node identifier comparison table records the mapping relation between the identifier of each node in the alliance chain network and the index in the table, the network delay matrix is a two-dimensional matrix and records delay data among the nodes in the alliance chain network, and the delay updating time table records the time stamp of updating the data in the network delay matrix of each node;
the routing table maintenance module is used for maintaining a routing table of each node in the alliance chain, and the routing table records the shortest paths from the node to all other nodes in the alliance chain, which are calculated based on the shortest path algorithm and according to the neighbor table;
the message communication module is connected with the neighbor table maintenance module and the routing table maintenance module and is used for generating, sending and receiving messages, wherein the messages comprise detection messages, routing messages and common messages;
when sending the detection message, the message communication module firstly acquires all adjacent nodes from the neighbor table maintenance module, sends the detection message to the adjacent nodes at regular time, records the message sending time, and calculates the network delay after receiving the reply message;
when sending routing information, the information communication module firstly acquires a neighbor table from a neighbor table maintenance module, generates routing information according to the neighbor table information of the message communication module, and sends the routing information to adjacent nodes at regular time; when the message communication module receives a routing message, the routing message is delivered to the neighbor table maintenance module, the neighbor table maintenance module judges whether the time delay updating time and the network time delay are changed, and if the time delay updating time and the network time delay are changed, the neighbor table is updated;
when sending the common message, the message communication module selects the first node in the shortest path from the routing table according to the destination node information in the message load and the routing table maintenance module, and sends the message to the first node; and after receiving the common message, the message communication module judges whether to directly process the message or call the routing table maintenance module to relay and forward the message according to a target node in the message load.
Further, the routing table maintenance module updates the routing table of the routing table according to the neighbor table based on a shortest path algorithm at regular time; and the neighbor table maintenance module judges that the time delay updating time and the network time delay are changed, updates the neighbor table of the neighbor table and triggers to update the routing table of the neighbor table.
The invention has the beneficial effects that: the alliance link communication method and system based on the shortest path algorithm can enable messages to be transmitted along the shortest path, can also ensure the availability of links when some nodes are down or communication links are unstable, and has the advantages of less redundant messages, easy expansion, and stable and reliable communication quality.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings without inventive exercise.
Fig. 1 is a flowchart of a federation chain communication method based on a shortest path algorithm according to an embodiment of the present invention;
fig. 2 is a diagram of a federation chain communication system based on a shortest path algorithm according to an embodiment of the present invention.
Detailed Description
For better understanding of the technical solutions of the present application, the following detailed descriptions of the embodiments of the present application are provided with reference to the accompanying drawings.
It should be understood that the embodiments described are only a few embodiments of the present application, 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 application.
The terminology used in the embodiments of the present application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in the examples of this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
The invention provides a federation chain efficient communication method based on a shortest path algorithm.
Each node in the alliance chain maintains a neighbor table, and the neighbor table comprises:
(1) the index-node identifier comparison table records the mapping relation between the identifier of each node in the alliance chain network and the index in the table, and the node identifier can be found according to the index; the structure of the index-node identifier comparison table is shown in table 1:
TABLE 1 index-node identifier lookup table
Figure 210232DEST_PATH_IMAGE002
(2) The network delay matrix is a two-dimensional matrix, records delay data between nodes in the alliance chain network, defines node indexes as i and j, represents the network delay matrix as matrix, and represents the delay data between the node i and the node j by matrix [ i ] [ j ]; the structure of the network delay matrix is shown in table 2:
TABLE 2 network delay matrix
Figure 330635DEST_PATH_IMAGE004
(3) A time delay updating time table, which records the time stamp of each node updating the data in the network time delay matrix, and updates the time delay updating time table only when the time delay data of the nodes directly connected with the time delay updating time table changes, wherein the time delay updating time table is expressed as time, and the network time delay matrix updating time of the node i is time [ i ]; the structure of the delay update schedule is shown in table 3, for example:
TABLE 3 time delay update schedule
Figure 703847DEST_PATH_IMAGE006
Each node in the alliance chain maintains a routing table, and the shortest path from the node to all other nodes in the alliance chain is calculated according to a neighbor table based on a shortest path algorithm and recorded in the routing table.
In the embodiment, the Dijkstra algorithm is selected as the shortest path algorithm, the algorithm mainly calculates the shortest paths from the source point to all other points, and is suitable for the scene with few nodes, the number of nodes in the alliance chain is limited, no negative weight path exists in the network, and the algorithm is more suitable. However, the invention is not limited to Dijkstra algorithm, and the shortest path can be calculated by using Floyd algorithm, Bellman-Ford algorithm or SPFA algorithm.
Each node in the alliance broadcasts and sends detection messages and routing messages to adjacent nodes at regular time, maintains a self neighbor table, calculates the shortest paths from the node to all other nodes in the alliance chain according to the neighbor table through a Dijkstra algorithm, and maintains the self routing table.
In this embodiment, a source node a sends a common message to a destination node C, where the node a and the node C are not adjacent nodes, the source node a puts the destination node C into a message load, selects a shortest path to the node C from a routing table, and sends the message to a first node B of the shortest path, and after receiving the message, the node B determines whether the node B is the destination node according to the content in the message load, and if the node B is not the destination node, selects the shortest path to the destination node from the routing table of the node B for relay forwarding until the destination node C receives the message.
Defining the index of the node as i, the indexes of other nodes as j, the network delay matrix as matrix, and the delay updating schedule as time, in this embodiment, referring to fig. 1, the method for alliance-link communication based on the shortest path algorithm includes the following steps:
step 101, each node in a alliance chain sends a detection message to an adjacent node at regular time, calculates network time delay and updates a network time delay matrix of a neighbor table of the node;
102, each node sends routing information containing a neighbor table to an adjacent node at regular time, exchanges neighbor table information and updates the neighbor table;
103, each node calculates the shortest paths from the node to all other nodes in the alliance chain according to the neighbor table based on the shortest path algorithm at regular time, and updates the routing table of the node;
104, when the node sends the common message, adding destination node information into the message load, selecting a first node in the shortest path from a routing table according to the destination node, and sending the message to the first node;
and 105, after receiving the common message, the node firstly judges a destination node in the message load, if the destination node is self, the destination node is directly processed, and if the destination node is not self, the shortest path is selected according to a self routing table to forward the message.
In step 101, the network delay is calculated, instead of directly using the delay data, the delay data is divided into different levels, and a score is given to the delay data according to the levels, for example, the delay data is divided into five levels, i.e., excellent, good, common, failing, and disconnected, where the lower the delay data is, the smaller the score is, and the corresponding relationship between the levels, the delay data, and the score may refer to the following form:
(1) the method has the advantages that: 0-100 ms, score: 50;
(2) good: 100 ms-300 ms, score: 200 of a carrier;
(3) the method comprises the following steps: 300 ms-500 ms, score: 400, respectively;
(4) failing to meet the requirements: 500 ms-1000 ms, score: 750;
(5) disconnecting: 1000ms, score: 10000.
for example, a node i sends a probe message to a node j, calculates network delay, gives a score x according to the delay level, the original score y = matrix [ i ] [ j ], if x is not equal to y, updates the network delay matrix, matrix [ i ] [ j ] = x, updates the delay updating time table time [ i ] to be the current time stamp, and recalculates the shortest path.
In step 102, each node sends a routing message containing its own neighbor table to an adjacent node whose delay data meets requirements (for example, the delay level is normal or above) at regular time; and after receiving the routing message, the adjacent nodes compare the time delay updating time with the time delay data, and update the neighbor tables if the time delay updating time and the time delay data change. The node i receives the neighbor table sent by the node j, except the index i, the time delay updating time and the time delay data under other indexes are respectively compared, for example, the index j is compared, the time delay updating time table is time 1, the received time delay updating time table is time 2, if the time 1[ j ] < time 2[ j ], and the matrix1[ j ] is not equal to the matrix2[ j ], the time delay updating time table 1[ j ] and the network delay matrix1[ j ] are updated, and the shortest path is recalculated.
When the shortest path is calculated in step 103, if the distances of different paths are the same, one of the paths is randomly selected as the shortest path, and if the destination node is directly connected to itself and the delay data meets the requirement (for example, the delay level is normal or above), the shortest path is directly selected.
When the node sends the common message in step 104, the message load also includes the time-to-live TTL, the TTL is reduced by one for each relay forwarding, and if the TTL is equal to zero after multiple relay forwarding or the message does not reach the destination node, the TTL is exhausted and the message is discarded.
The present invention further provides a shortest path algorithm-based alliance chain efficient communication system, referring to fig. 2, the shortest path algorithm-based alliance chain communication system in this embodiment includes:
a neighbor table maintenance module 201, configured to maintain a neighbor table of each node in the alliance chain, where the neighbor table includes an index-node identifier comparison table, a network delay matrix of the entire network, and a delay update time table, the index-node identifier comparison table records a mapping relationship between an identifier of each node in the alliance chain network and an index in the table, the network delay matrix records delay data between each node in the alliance chain network, and the delay update time table records a timestamp of each node updating data in the network delay matrix;
a routing table maintenance module 202, configured to maintain a routing table of each node in the federation chain, where the routing table records shortest paths from the node to all other nodes in the federation chain, where the shortest paths are calculated based on a shortest path algorithm and according to a neighbor table;
a message communication module 203, connected to the neighbor table maintenance module 201 and the routing table maintenance module 202, for generating, sending and receiving messages, including probe messages, routing messages and common messages;
when the message communication module 203 sends a probe message, all the neighboring nodes are acquired from the neighbor table maintenance module 201, the probe message is sent to the neighboring nodes at regular time, the message sending time is recorded, and after a reply message is received, the network delay is calculated;
when the message communication module 203 sends a routing message, the neighbor table is firstly obtained from the neighbor table maintenance module 201, the routing message is generated according to the neighbor table information of the neighbor table, and the routing message is sent to the adjacent node with the delay data meeting the requirement (for example, the delay level is normal or above) at regular time;
when the message communication module 203 receives the routing message, the routing message is delivered to the neighbor table maintenance module 201, the neighbor table maintenance module 201 judges whether the time delay updating time and the network time delay are changed, if so, the neighbor table is updated, and the routing table is triggered to be updated;
when the message communication module 203 sends a common message, according to the destination node information and the routing table maintenance module 202, selecting a first node in the shortest path from the routing table, and sending the message to the first node;
after receiving the common message, the message communication module 203 determines whether the message is a destination node according to the destination node in the message load, if so, directly processes the message, and if not, selects a shortest path according to the self routing table in the routing table maintenance module 202 to forward the message.
It can be seen from the above embodiments that, in the method and system for alliance link communication based on the shortest path algorithm provided by the present invention, when alliance link networking is performed, the shortest path is calculated by sending a probe message and based on the shortest path algorithm, and the availability and stability of the link can be ensured even when the communication link is unstable or some nodes are down, and each node selects the shortest path to send messages, so that there are few redundant messages, and the communication quality is stable and reliable.
The above description is only for the purpose of illustrating the preferred embodiments of the one or more embodiments of the present disclosure, and is not intended to limit the scope of the one or more embodiments of the present disclosure, and any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the one or more embodiments of the present disclosure should be included in the scope of the one or more embodiments of the present disclosure.

Claims (10)

1. A method for alliance chain communication based on shortest path algorithm is characterized in that the method comprises the following steps:
each node in the alliance chain maintains a neighbor table and a routing table;
the neighbor table comprises an index-node identifier comparison table, a network delay matrix and a delay updating time table, wherein the index-node identifier comparison table records the mapping relation between the identifier of each node in the network and the index in the table, the network delay matrix records the delay data among the nodes in the network, and the delay updating time table records the time stamp of the data of each node in the network delay matrix;
recording the shortest paths from the node to all other nodes in the alliance chain based on the shortest path algorithm and calculated according to the neighbor table in the routing table;
each node in the alliance chain sends a detection message to an adjacent node at regular time to calculate network delay and update a network delay matrix of a neighbor table of the node;
each node sends routing information containing a neighbor table to an adjacent node at regular time, exchanges neighbor table information and updates the neighbor table;
each node regularly updates a routing table of the node;
when the node sends the common message, adding destination node information into the message load, selecting a first node in the shortest path from a routing table according to the destination node, and sending the message to the first node;
after receiving the common message, the node firstly judges the destination node in the message load, if the node is self, the node is directly processed, and if not, the node selects the shortest path to forward the message according to the routing table of the node.
2. The method of claim 1, wherein the shortest path algorithm employs Dijkstra algorithm, Floyd algorithm, Bellman-Ford algorithm, or SPFA algorithm.
3. The method of claim 1, wherein each time a node sends a probe message to compute network latency, the latency data is divided into different levels, and scores are assigned to the latency data according to the levels.
4. The method of claim 3, wherein the delay data is classified into five different levels of excellent, good, normal, failing, and disconnected, and the corresponding relationship between the delay data, the levels, and the score is as follows: for 0-100 ms delay data, the grade is excellent, and the score is 50; for 100 ms-300 ms delay data, the grade is good, and the score is 200; for 300 ms-500 ms delay data, the grade is common, and the score is 400; for 500 ms-1000 ms delay data, the grade is a fail, and the score is 750; for the time delay data of more than 1000ms, the grade is disconnected, and the score is 10000.
5. The method according to any of claims 1-4, characterized in that each node periodically sends routing messages containing its own neighbor table to neighboring nodes whose delay data meet the requirements.
6. The method according to any one of claims 1 to 4, wherein after receiving the routing message of the adjacent node, the node compares the delay updating time and the network delay of the received neighbor table and the self neighbor table respectively according to the index of the neighbor table in the routing message, and if the delay updating time of the corresponding index in the received neighbor table is longer than the delay updating time of the corresponding index in the self neighbor table and the network delays of the corresponding indexes are different, the network delay matrix and the delay updating time table of the self neighbor table are updated, and the updating of the self routing table is triggered at the same time.
7. The method according to any one of claims 1 to 4, wherein each node in the federation chain is based on a shortest path algorithm at regular time, the shortest paths from the node to all other nodes in the federation chain are calculated according to the neighbor table, the routing table of the node is updated, when the shortest paths are calculated, if different path distances are the same, one of the paths is randomly selected as the shortest path, and if a destination node is directly connected with the node and delay data meet requirements, the path to the destination node is directly used as the shortest path.
8. The method according to any of claims 1-4, wherein when a node sends a normal message, the message payload further comprises a time-to-live TTL, wherein each relay-forwarding TTL is decremented by one, and if a message does not reach the destination node when the relay-forwarding TTL equals zero over a plurality of times, the TTL is exhausted, and the message is discarded.
9. A federated link communication system based on shortest path algorithm, comprising:
the neighbor table maintenance module is used for maintaining a neighbor table of each node in a alliance chain, wherein the neighbor table comprises an index-node identifier comparison table, a network delay matrix and a delay updating time table, the index-node identifier comparison table records the mapping relation between the identifier of each node in the network and an index in the table, the network delay matrix records delay data among the nodes in the network, and the delay updating time table records the time stamp of each node for updating the data in the network delay matrix;
the routing table maintenance module is used for maintaining a routing table of each node in the alliance chain, and the routing table records the shortest paths from the node to all other nodes in the alliance chain, which are calculated based on the shortest path algorithm and according to the neighbor table;
the message communication module is connected with the neighbor table maintenance module and the routing table maintenance module and is used for generating, sending and receiving messages, wherein the messages comprise detection messages, routing messages and common messages;
when the detection message is sent, the message communication module firstly acquires all adjacent nodes from the neighbor table maintenance module, and regularly sends the detection message to the adjacent nodes to calculate the network time delay;
when sending routing information, the information communication module firstly acquires a neighbor table from the neighbor table maintenance module, generates routing information according to the neighbor table and sends the routing information to adjacent nodes at regular time; when the message communication module receives a routing message, the routing message is delivered to the neighbor table maintenance module, the neighbor table maintenance module judges whether the time delay updating time and the network time delay are changed, and if the time delay updating time and the network time delay are changed, the neighbor table is updated;
when sending the common message, the message communication module selects the first node in the shortest path from the routing table according to the destination node information in the message load and the routing table maintenance module, and sends the message to the first node; and after receiving the common message, the message communication module judges whether to directly process the message or call the routing table maintenance module to relay and forward the message according to a target node in the message load.
10. The system of claim 9, wherein the routing table maintenance module is configured to update its own routing table based on a shortest path algorithm according to the neighbor table; and the neighbor table maintenance module judges that the time delay updating time and the network time delay are changed, updates the neighbor table of the neighbor table and triggers to update the routing table of the neighbor table.
CN202111475859.4A 2021-12-06 2021-12-06 Shortest path algorithm-based alliance link communication method and system Active CN113923155B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111475859.4A CN113923155B (en) 2021-12-06 2021-12-06 Shortest path algorithm-based alliance link communication method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111475859.4A CN113923155B (en) 2021-12-06 2021-12-06 Shortest path algorithm-based alliance link communication method and system

Publications (2)

Publication Number Publication Date
CN113923155A true CN113923155A (en) 2022-01-11
CN113923155B CN113923155B (en) 2022-04-19

Family

ID=79248770

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111475859.4A Active CN113923155B (en) 2021-12-06 2021-12-06 Shortest path algorithm-based alliance link communication method and system

Country Status (1)

Country Link
CN (1) CN113923155B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115811498A (en) * 2023-02-06 2023-03-17 北京微芯区块链与边缘计算研究院 Node routing method, device, equipment and storage medium of alliance chain
CN116016543A (en) * 2022-12-15 2023-04-25 浪潮云信息技术股份公司 Block chain network deployment method and system based on ant colony algorithm
CN116170388A (en) * 2022-12-30 2023-05-26 蚂蚁区块链科技(上海)有限公司 Forwarding table generation method of block chain network and data transmission method thereof
CN116232971A (en) * 2022-12-14 2023-06-06 杭州蚂蚁酷爱科技有限公司 Communication method and network system based on structured P2P relay network

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108989223A (en) * 2018-06-13 2018-12-11 昆宇蓝程(北京)科技有限责任公司 A kind of satellite routing algorithm under strong link constraints
CN109309945A (en) * 2018-11-29 2019-02-05 福州大学 A kind of vehicle self-organizing network method for routing for the multi-layers scene such as urban viaduct
CN110139319A (en) * 2019-05-25 2019-08-16 西南电子技术研究所(中国电子科技集团公司第十研究所) High dynamic time-delay network propagation delay time minimizes method for routing
CN112019254A (en) * 2020-08-10 2020-12-01 航天科工空间工程发展有限公司 Active low-delay routing method for low-earth-orbit satellite network
CN112565392A (en) * 2020-12-01 2021-03-26 浙商银行股份有限公司 Convergence method of alliance chain non-full connection P2P network and P2P node

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108989223A (en) * 2018-06-13 2018-12-11 昆宇蓝程(北京)科技有限责任公司 A kind of satellite routing algorithm under strong link constraints
CN109309945A (en) * 2018-11-29 2019-02-05 福州大学 A kind of vehicle self-organizing network method for routing for the multi-layers scene such as urban viaduct
CN110139319A (en) * 2019-05-25 2019-08-16 西南电子技术研究所(中国电子科技集团公司第十研究所) High dynamic time-delay network propagation delay time minimizes method for routing
CN112019254A (en) * 2020-08-10 2020-12-01 航天科工空间工程发展有限公司 Active low-delay routing method for low-earth-orbit satellite network
CN112565392A (en) * 2020-12-01 2021-03-26 浙商银行股份有限公司 Convergence method of alliance chain non-full connection P2P network and P2P node

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
陈方亭: "《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》", 15 February 2019 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116232971A (en) * 2022-12-14 2023-06-06 杭州蚂蚁酷爱科技有限公司 Communication method and network system based on structured P2P relay network
CN116016543A (en) * 2022-12-15 2023-04-25 浪潮云信息技术股份公司 Block chain network deployment method and system based on ant colony algorithm
CN116170388A (en) * 2022-12-30 2023-05-26 蚂蚁区块链科技(上海)有限公司 Forwarding table generation method of block chain network and data transmission method thereof
CN115811498A (en) * 2023-02-06 2023-03-17 北京微芯区块链与边缘计算研究院 Node routing method, device, equipment and storage medium of alliance chain

Also Published As

Publication number Publication date
CN113923155B (en) 2022-04-19

Similar Documents

Publication Publication Date Title
CN113923155B (en) Shortest path algorithm-based alliance link communication method and system
JP4532564B2 (en) System and method for supporting multicast routing in large scale wireless mesh networks
EP1500287B1 (en) Wireless ad-hoc network and method for performing reactive routing therein
US7924726B2 (en) Arrangement for preventing count-to-infinity in flooding distance vector routing protocols
EP1400071B1 (en) Dynamic network and routing method for a dynamic network
CN104080112B (en) A kind of method for improving wireless self-organization network service reliability
WO2003058890A1 (en) Network protocol for wireless devices utilizing location information
Huang et al. AODV-based backup routing scheme in mobile ad hoc networks
EP2392158A1 (en) Method for supporting routing decisions in a wireless mesh network and wireless mesh network
CN106954243A (en) Route implementation method based on wireless chain network
US20120163233A1 (en) Method for transmitting routing information and routing apparatus in wireless network
Huang et al. On-demand location-aided QoS routing in ad hoc networks
CN112511435B (en) Method for realizing OSPF quick convergence in internal gateway protocol
CN109688614A (en) Realization method and system for high dynamic unmanned plane Routing for On-Demand Protocol in MANET
CN101938804A (en) Multipath routing protocol suitable for wireless sensing network
CN106888493B (en) Routing method and device of wireless MESH MESH network
CN113660710A (en) Routing method of mobile ad hoc network based on reinforcement learning
CN104811378A (en) Route isolation and synchronization method
EP2068500A2 (en) Method and system for flooding and multicast routing in an ad-hoc network
EP1983699A1 (en) Multicast routing protocol for a clustered mobile ad hoc network
Gruber et al. Ad hoc routing for cellular coverage extension
CN115002863A (en) Wireless network routing method and storage medium suitable for large-scale network
Sharma et al. An extensive survey on different routing protocols and issue in VANETs
Lu et al. An adaptive routing algorithm for two-tier traffic information system
CN113423114B (en) Airplane networking and routing method based on virtual topology

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
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20220607

Address after: No. 1788, Hongning Road, Xiaoshan District, Hangzhou, Zhejiang 311200

Patentee after: CHINA ZHESHANG BANK Co.,Ltd.

Patentee after: Yiqiyin (Hangzhou) Technology Co., Ltd

Address before: No. 1788, Hongning Road, Xiaoshan District, Hangzhou, Zhejiang 311200

Patentee before: CHINA ZHESHANG BANK Co.,Ltd.