Routing broadcast method independent of clock synchronization

Abstract

The invention discloses a route broadcasting method independent of clock synchronization, and relates to the field of 5G communication. According to the method, after a terminal accesses a node, the node periodically broadcasts routing information of the terminal to other nodes, the routing information comprises the age of the current routing information, and after the terminal changes node access, a new node continuously and periodically broadcasts the routing information of the terminal to other nodes; and the rest nodes determine the latest terminal access node according to the age recorded in the routing information sent by the successive nodes, namely the node corresponding to the routing information of the young age. According to the scheme for judging whether the routing information is new or old according to the age, the scheme does not depend on clock synchronization, the deployment complexity and difficulty of 5G LAN networking are simplified, and the scheme can be suitable for more complex and changeable scenes.

Description

Technical Field

[0001] This invention relates to the field of 5G communication, and in particular to a routing broadcast method that does not rely on clock synchronization, for use in a 5G LAN network with multiple 5G communication nodes, where terminals move between different nodes, and each node needs to broadcast the routing information of the terminals under its node to other nodes. Background Technology

[0002] Timestamp: refers to the total number of seconds from a fixed time (e.g., 00:00:00 Beijing time on January 1, 2023) to the present. The larger the value, the newer it is.

[0003] The age of routing information refers to how much time (in seconds) has passed since the routing information was generated; that is, the difference between the current timestamp and the timestamp when the routing information was generated.

[0004] 5G LAN: Multiple 5G nodes form a network, which are horizontally connected through 5G air interface channels. Terminals within the network can freely access and communicate with each other across multiple nodes.

[0005] In the field of 5G communication, since terminals access the network via the air interface, they are not fixed to a certain node but can move randomly. To address a terminal (using its IP address information), it is necessary to know which node the terminal is currently on. When a terminal accesses a node, it begins to broadcast its current routing information (the terminal's IP address and the node it is currently on, etc.) to other nodes. This allows other nodes to accurately address the terminal. If the terminal moves to another node, the new node will also broadcast the terminal's routing information. The receiving node needs to determine which node broadcasts the latest routing information for the terminal, and the latest routing information is recorded.

[0006] The common practice for determining the age of routing information is to use timestamps. The larger the timestamp value, the newer the routing information. However, this requires that the clocks of each node are synchronized. If the clocks of the nodes are not synchronized, it may be wrong to use timestamps to determine the age of routing information.

[0007] Traditional methods of determining the age of routing information based on timestamps are only suitable for clock synchronization. In diverse and complex scenarios, ensuring clock synchronization for every node is difficult, especially when networking with different vendors. Finding a method to identify the age of routing information without relying on clock synchronization would allow 5G LAN networks to adapt to more scenarios. Summary of the Invention

[0008] In view of this, the present invention proposes a route broadcasting method that does not rely on clock synchronization. This method determines the age of the route information by using the amount of time (in seconds) since its generation, that is, by its age; the younger the age, the newer the route information.

[0009] To achieve the above objectives, the technical solution adopted by the present invention is as follows:

[0010] A clock-synchronization-independent route broadcasting method includes the following steps:

[0011] Step 1: The terminal connects at node 1;

[0012] Step 2: Node 1 periodically broadcasts the terminal's routing information to other nodes, including: the terminal's IP address, the node it is located on, i.e., Node 1, and the age of the current routing information. The age of the routing information is the difference between the timestamp when the current node broadcasts the routing information and the timestamp when the terminal accesses the current node.

[0013] Step 3: Node 3 receives the routing information of the terminal broadcast for the first time by Node 1, checks the current routing record table, finds that there is no routing information for the terminal, and then creates a new routing information record; thereafter, it performs periodic updates.

[0014] Step 4: The terminal moves from node 1 to node 2 to connect;

[0015] Step 5: Node 2 periodically broadcasts the terminal's routing information to other nodes, including: the terminal's IP address, the node it is located on, i.e., Node 2, and the age of the current routing information;

[0016] Step 6: When Node 3 receives the terminal routing information broadcast by Node 2 for the first time, it checks the current routing record table and finds that there is already a routing record for the terminal. It compares the age of the routing information recorded in the existing routing record of the terminal with the age of the routing information carried in the broadcast message of Node 2. The node with the smaller routing information age, i.e., Node 2, is recorded as the latest routing node. The node information in the terminal routing information is updated to Node 2. The subsequent recording and updating of routing information is performed, and the terminal routing information sent by Node 1 is deleted from the record.

[0017] Due to the adoption of the above technical solution, the beneficial effects of this invention compared with the prior art are as follows:

[0018] The solution provided by this invention for determining the age of routing information based on age can simplify the complexity and difficulty of 5G LAN network deployment without relying on clock synchronization, and can be applied to more complex and ever-changing scenarios. Attached Figure Description

[0019] Figure 1This is a flowchart illustrating the process of using timestamps to determine routing information errors in scenarios where clocks are out of sync.

[0020] Figure 2 This is a schematic diagram illustrating the process of determining the age of routing information based on age in an embodiment of the present invention.

[0021] Figure 3 This is a schematic diagram illustrating the process of determining the age of routing information by independently calculating the local timestamp based on age in an embodiment of the present invention. Detailed Implementation

[0022] The invention will be further described below with reference to the accompanying drawings and specific embodiments.

[0023] A routing broadcast method that does not rely on clock synchronization, such as Figure 2 As shown, it includes the following steps:

[0024] Step 1: The terminal connects at node 1;

[0025] Step 2: Node 1 periodically broadcasts the terminal's routing information to other nodes, including: the terminal's IP address, the node it is located on, i.e., Node 1, and the age of the current routing information. The age of the routing information is the difference between the timestamp when the current node broadcasts the routing information and the timestamp when the terminal accesses the current node.

[0026] Step 3: Node 3 receives the routing information of the terminal broadcast for the first time by Node 1, checks the current routing record table, finds that there is no routing information for the terminal, and then creates a new routing information record; thereafter, it performs periodic updates.

[0027] Step 4: The terminal moves from node 1 to node 2 to connect;

[0028] Step 5: Node 2 periodically broadcasts the terminal's routing information to other nodes, including: the terminal's IP address, the node it is located on, i.e., Node 2, and the age of the current routing information;

[0029] Step 6: When Node 3 receives the terminal routing information broadcast by Node 2 for the first time, it checks the current routing record table and finds that there is already a routing record for the terminal. It compares the age of the routing information recorded in the existing routing record of the terminal with the age of the routing information carried in the broadcast message of Node 2. The node with the smaller routing information age, i.e., Node 2, is recorded as the latest routing node. The node information in the terminal routing information is updated to Node 2. The subsequent recording and updating of routing information is performed, and the terminal routing information sent by Node 1 is deleted from the record.

[0030] Step 7: The server initiates an access request to the terminal from node 3;

[0031] Step 8: Based on the terminal's routing information, the node correctly addresses the terminal at node 2;

[0032] Step 9: Node 2 successfully forwards the access request to the terminal.

[0033] like Figure 1 The diagram illustrates a scenario where clock discrepancies lead to errors in determining routing information using timestamps, causing access to the terminal to fail. The specific error process includes the following steps:

[0034] Premise: The clocks of node 1 and node 2 are out of sync, with node 1's time being 100 seconds ahead of node 2;

[0035] Step 1: The terminal connects at node 1;

[0036] Step 2: Node 1 broadcasts the terminal's routing information to other nodes, including: the terminal's IP address, the node it is on (Node 1), and Node 1's current timestamp 1;

[0037] Step 3: Node 3 receives the routing information of the terminal broadcast by Node 1, checks the current routing record table, finds that there is no routing information for the terminal, and then creates a new routing information record.

[0038] Step 4: After 30 seconds, the terminal moves from node 1 to node 2 to connect;

[0039] Step 5: Node 2 broadcasts the terminal's routing information to other nodes, including: the terminal's IP address, the node it is on (Node 2), and Node 2's current timestamp 2. Because Node 2 is 100 seconds behind Node 1, although the terminal accessed Node 2 30 seconds after its last access to Node 1, Node 2's current timestamp 2 is still 70 seconds smaller than Node 1's timestamp 1 (100-30=70).

[0040] Step 6: Node 3 receives the routing information of the terminal broadcast by Node 2, checks the current routing record table, finds that there is already a routing record for the terminal, compares the existing record with the timestamp carried in the broadcast message. Since timestamp 2 is 70 seconds smaller than timestamp 1, it considers the routing message to be older and does not update the routing record. The routing information of the terminal is still registered on Node 1.

[0041] Step 7: The server initiates an access request to the terminal from node 3;

[0042] Step 8: Based on the terminal's routing information, the node incorrectly addresses the terminal to node 1;

[0043] Step 9: Node 1 receives a request to access the terminal, but there is no information about the terminal on Node 1 (the terminal has actually moved to Node 2), resulting in access failure.

[0044] While determining the age of routing information based on age is intuitive, age is constantly changing. Updating the age information in all routing records across all nodes in real-time is computationally intensive. In practice, nodes receiving routing information can calculate a local timestamp for the route based on the age information and their current timestamp. This calculation only needs to be done once upon receiving the routing information, and subsequent determinations can be based on the local timestamp, significantly reducing computational load. The local timestamp calculation method is as follows: The routing broadcast message carries age information, filled in by the node sending the broadcast message. Age refers to the time (in seconds) elapsed since the terminal accessed the node at the broadcast moment. The specific algorithm is: timestamp of the broadcast routing information at the moment of broadcast - timestamp of the terminal accessing the node. Each node receiving the broadcast message independently calculates the local timestamp for the routing information based on the age information. The specific algorithm is: current timestamp of the receiving node - age information carried in the message. The calculation result is recorded as the timestamp of the route in the routing information record for subsequent route age determination; a larger value indicates a newer route. As can be seen from the above algorithm, the timestamp of the routing information of each receiving node is calculated independently by the node based on its age, and is not affected by the clocks of other nodes. Therefore, this avoids the problem of needing clock synchronization among all nodes. As shown in Figure 3, a routing broadcast method that does not rely on clock synchronization specifically includes the following steps:

[0045] Step 1: The terminal successfully connects to node 1, and the timestamp 1_1 of node 1 at this moment is recorded;

[0046] Step 2: Node 1 broadcasts the terminal's routing information to other nodes, records the timestamp 1_2 of Node 1 at this moment, and the broadcast message includes: the terminal's IP address, the node it is on (Node 1), and its current age 1 (timestamp 1_2 - timestamp 1_1).

[0047] Step 3: Node 3 receives the terminal's routing information broadcast by Node 1, records the timestamp 3_1 of Node 3 at this moment, checks the current routing record table, finds no routing information for this terminal, and then creates a new routing information record. The timestamp 1 of this routing information is calculated based on the age (timestamp 3_1 - age 1).

[0048] Step 4: The terminal moves from node 1 to node 2 and successfully connects. Record the timestamp 2_1 of node 2 at this moment.

[0049] Step 5: Node 2 broadcasts the terminal's routing information to other nodes, records the timestamp 2_2 of Node 2 at this moment, and the broadcast message includes: the terminal's IP address, the node it is on (Node 2), and its current age 2 (timestamp 2_2 - timestamp 2_1).

[0050] Step 6: Node 3 receives the terminal's routing information broadcast by Node 2, records the current timestamp 3_2, checks the current routing record table, and finds that there is already a routing record for this terminal. It calculates the local timestamp 2 of this routing message based on the age (timestamp 3_2 - age 2), and compares it with the timestamp in the existing record. In this scenario, taking real-time routing announcements as an example, the node immediately starts broadcasting routes after the terminal connects, so the values ​​of age 1 and age 2 are very small (the age in this section refers to the age carried in the message at the moment of broadcast), and can be considered equal. The difference between timestamp 2 and timestamp 1 is equivalent to the difference between timestamp 3_2 and timestamp 3_1 (timestamp 2 – timestamp 1 = (timestamp 3_2 - age 2) - (timestamp 3_1 - age 1) = timestamp 3_2 - ... The timestamp 3_1), while the timestamp 3_2 is definitely larger than 3_1 (the difference is the length of time the terminal stayed on node 1 before moving to node 2), which means that the routing information in the message is updated, and the node information in the terminal's routing information will be updated to node 2;

[0051] Step 7: The server initiates an access request to the terminal from node 3;

[0052] Step 8: Based on the terminal's routing information, the node correctly addresses the terminal at node 2;

[0053] Step 9: Node 2 successfully forwards the access request to the terminal.

[0054] Those skilled in the art will recognize that the described embodiments are intended to help readers understand the principles of the invention and should be understood as not limiting the scope of protection of the invention to the described embodiments. Various modifications and variations can be made to the invention by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the invention should be included within the scope of the claims of the invention.

Claims

1. A routing broadcast method that does not rely on clock synchronization, characterized in that, Includes the following steps: Step 1: The terminal connects at node 1; Step 2: Node 1 periodically broadcasts the terminal's routing information to other nodes, including: the terminal's IP address, the node it is located on, i.e., Node 1, and the age of the current routing information. The age of the routing information is the difference between the timestamp when the current node broadcasts the routing information and the timestamp when the terminal accesses the current node. Step 3: Node 3 receives the routing information of the terminal broadcast for the first time by Node 1, checks the current routing record table, finds that there is no routing information for the terminal, and then creates a new routing information record; thereafter, it performs periodic updates. Step 4: The terminal moves from node 1 to node 2 to connect; Step 5: Node 2 periodically broadcasts the terminal's routing information to other nodes, including: the terminal's IP address, the node it is located on, i.e., Node 2, and the age of the current routing information; Step 6: When Node 3 receives the terminal routing information broadcast by Node 2 for the first time, it checks the current routing record table and finds that there is already a routing record for the terminal. It compares the age of the routing information recorded in the existing routing record of the terminal with the age of the routing information carried in the broadcast message of Node 2. The node with the smaller routing information age, i.e., Node 2, is recorded as the latest routing node. The node information in the terminal routing information is updated to Node 2. The subsequent recording and updating of routing information is performed, and the terminal routing information sent by Node 1 is deleted from the record.

Images