Cross-region communication method, apparatus, device, storage medium and program product

Abstract

The application relates to a cross-region communication method, device, equipment, storage medium and program product. The method comprises the following steps: deploying gateway edge nodes in multiple network domains, and each gateway edge node is in network intercommunication with at least one other gateway edge node; acquiring a topological relationship between the gateway edge nodes, generating a routing topological table of the gateway edge nodes based on the topological relationship; determining an optimal communication path between the gateway edge nodes based on the routing topological table; and realizing communication between different network domains based on the optimal communication path. The method can realize cross-network domain communication without deploying a gateway in the middle region of the non-communicating network domains.

Description

Technical Field

[0001] This application relates to the field of information technology, and in particular to a cross-regional communication method, apparatus, device, storage medium, and program product. Background Technology

[0002] While cloud-based deployments offer convenience, they also increase the complexity of software system deployments. Systems in unconnected networks need a gateway to forward requests if they require communication. Traditional gateway models require deploying the gateway in an intermediate zone that is interconnected with all other client and server networks to forward network requests. This method is overly reliant on the intermediate zone; if it is absent or difficult to obtain, cross-zone communication between multiple systems becomes impossible. Summary of the Invention

[0003] Therefore, it is necessary to provide a cross-regional communication method, apparatus, device, storage medium, and program product that can communicate across network domains to address the aforementioned technical problems.

[0004] In a first aspect, this application provides a cross-regional communication method, including:

[0005] Gateway edge nodes are deployed in multiple network domains, wherein each of the gateway edge nodes has at least one other gateway edge node with which it communicates with its network.

[0006] Obtain the topological relationship between each of the gateway edge nodes, and generate a routing topology table for the gateway edge nodes based on the topological relationship;

[0007] The optimal communication path between each of the gateway edge nodes is determined based on the routing topology table;

[0008] Communication between different network domains is achieved based on the optimal communication path.

[0009] In one embodiment, generating the routing topology table of the gateway edge node based on the topology relationship includes:

[0010] Obtain the neighboring nodes of each of the aforementioned gateway edge nodes;

[0011] Obtain the communication delay between each of the gateway edge nodes and its adjacent nodes;

[0012] The routing topology table is generated based on the topology relationship and the communication delay.

[0013] In one embodiment, the method further includes:

[0014] If the configuration of one of the gateway edge nodes changes, obtain the change information;

[0015] A version number for the change information is generated, and the change information is broadcast to the first neighboring node, wherein the first neighboring node is all the neighboring nodes of the gateway edge node.

[0016] In one embodiment, after broadcasting the change information to all neighboring nodes of the gateway edge node, the process includes:

[0017] When the adjacent node receives the change information, it is determined whether it is the first time the change information has been received based on the version number of the change information;

[0018] If not, the routing topology table is updated based on the change information, and the change information is broadcast to the second neighboring node, wherein the second neighboring node is all the neighboring nodes of each of the first neighboring nodes;

[0019] If so, no action will be taken.

[0020] In one embodiment, determining the optimal communication path between each of the gateway edge nodes based on the routing topology table includes:

[0021] The shortest path algorithm is used to calculate the path with the shortest communication time between the two gateway edge nodes based on the topological relationship and the communication latency.

[0022] The path with the shortest communication time is determined as the optimal communication path between the two gateway edge nodes.

[0023] In one embodiment, the step of implementing communication between different network domains based on the optimal communication path includes:

[0024] When a request is received in one of the network domains, obtain the location of the request target corresponding to the current request;

[0025] If the target of the request is in the current network domain, then the request is forwarded to the corresponding target.

[0026] If the target of the request is not in the current network domain, the request is sent to the network domain corresponding to the target of the request via the optimal communication path, and then forwarded to the target of the request.

[0027] Secondly, this application also provides a cross-regional communication device, comprising:

[0028] The deployment module is used to deploy gateway edge nodes to multiple network domains, wherein each of the gateway edge nodes has at least one other gateway edge node with which it communicates with its network.

[0029] A generation module is used to obtain the topological relationship between each of the gateway edge nodes and generate a routing topology table for the gateway edge nodes based on the topological relationship;

[0030] The determination module is used to determine the optimal communication path between each of the gateway edge nodes based on the routing topology table;

[0031] The communication module is used to enable communication between different network domains based on the optimal communication path.

[0032] Thirdly, this application also provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to perform the following steps:

[0033] Gateway edge nodes are deployed in multiple network domains, wherein each of the gateway edge nodes has at least one other gateway edge node with which it communicates with its network.

[0034] Obtain the topological relationship between each of the gateway edge nodes, and generate a routing topology table for the gateway edge nodes based on the topological relationship;

[0035] The optimal communication path between each of the gateway edge nodes is determined based on the routing topology table;

[0036] Communication between different network domains is achieved based on the optimal communication path.

[0037] Fourthly, this application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, performs the following steps:

[0038] Gateway edge nodes are deployed in multiple network domains, wherein each of the gateway edge nodes has at least one other gateway edge node with which it communicates with its network.

[0039] Obtain the topological relationship between each of the gateway edge nodes, and generate a routing topology table for the gateway edge nodes based on the topological relationship;

[0040] The optimal communication path between each of the gateway edge nodes is determined based on the routing topology table;

[0041] Communication between different network domains is achieved based on the optimal communication path.

[0042] Fifthly, this application also provides a computer program product, including a computer program that, when executed by a processor, performs the following steps:

[0043] Gateway edge nodes are deployed in multiple network domains, wherein each of the gateway edge nodes has at least one other gateway edge node with which it communicates with its network.

[0044] Obtain the topological relationship between each of the gateway edge nodes, and generate a routing topology table for the gateway edge nodes based on the topological relationship;

[0045] The optimal communication path between each of the gateway edge nodes is determined based on the routing topology table;

[0046] Communication between different network domains is achieved based on the optimal communication path.

[0047] The aforementioned cross-regional communication methods, devices, computer equipment, computer-readable storage media, and computer program products deploy gateway edge nodes in each different network domain, forming a distributed gateway structure. This simplifies the complex network structure of gateway deployment and eliminates centralized gateway devices, thereby improving the security and sustainability of the entire system. Attached Figure Description

[0048] To more clearly illustrate the technical solutions in the embodiments of this application or related technologies, the drawings used in the description of the embodiments of this application or related technologies will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0049] Figure 1 This is a flowchart illustrating a cross-regional communication method in one embodiment;

[0050] Figure 2 This is a schematic diagram of a gateway deployment architecture in the prior art;

[0051] Figure 3 This is a schematic diagram of the gateway deployment architecture in one embodiment;

[0052] Figure 4 This is a flowchart illustrating a cross-regional communication method in a specific embodiment;

[0053] Figure 5 This is a structural block diagram of a cross-regional communication device in one embodiment;

[0054] Figure 6 This is an internal structural diagram of a computer device in one embodiment. Detailed Implementation

[0055] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0056] In one embodiment, such as Figure 1 As shown, a cross-regional communication method is provided. This embodiment illustrates the method applied to a terminal, but it is understood that the method can also be applied to a server, and to a system including both a terminal and a server, and is implemented through interaction between the terminal and the server. In this embodiment, the method includes the following steps:

[0057] Step 101: Deploy gateway edge nodes for multiple network domains, wherein each gateway edge node has at least one other gateway edge node with which it communicates with its network.

[0058] Step 102: Obtain the topological relationship between each of the gateway edge nodes, and generate a routing topology table for the gateway edge nodes based on the topological relationship;

[0059] Step 103: Determine the optimal communication path between each of the gateway edge nodes based on the routing topology table;

[0060] Step 104: Implement communication between different network domains based on the optimal communication path.

[0061] Please see Figure 2 , Figure 2 This paper illustrates an existing gateway deployment architecture. Due to the rapid development of cloud computing, many companies are migrating their IT systems to the cloud. While cloud-based deployments offer convenience, they also increase the complexity of software system deployments. Systems on different networks need to communicate with each other, requiring a gateway to forward requests. Traditional gateway models require deploying the gateway in an intermediate area that is interconnected with all other client and server networks to forward network requests. However, in practice, not all scenarios have an intermediate network area, making traditional gateway architectures inadequate.

[0062] Based on this, this application proposes a decentralized gateway architecture. Please see [link / reference]. Figure 3 , Figure 3 This application provides a gateway deployment architecture. For example, this embodiment does not centrally deploy a gateway, but instead deploys a gateway edge node in each network domain. Each gateway edge node ensures network connectivity with at least one other gateway edge node, and each gateway edge node needs to be added to the network topology. For example, network connectivity methods may include public network connectivity, VPC peering connectivity, physical layer network cable connectivity, firewall connectivity, etc., and are not specifically limited here.

[0063] Once each gateway edge node in the gateway network and its adjacent nodes are determined, the topological relationships between the gateway edge nodes can be established, and a routing topology table can be generated based on these relationships. The optimal communication path between the gateway edge nodes can be calculated using this routing topology table, and communication between different network domains can be achieved based on the optimal communication path when cross-regional communication is required.

[0064] Unlike traditional cross-regional communication methods that centrally deploy gateway devices in intermediate areas of multiple different network domains, this embodiment deploys gateway edge nodes in each different network domain, forming a distributed gateway structure. This simplifies the complex network structure of gateway deployment and eliminates centralized gateway devices, improving the security and sustainability of the entire system. Furthermore, the gateway structure proposed in this embodiment can be deployed and used in new network domains, sharing configurations with other gateway edge nodes and automatically forming a network, offering flexibility.

[0065] In an exemplary embodiment, generating the routing topology table of the gateway edge nodes based on the topology relationship includes: obtaining the neighboring nodes of each gateway edge node; obtaining the communication delay between each gateway edge node and its neighboring nodes; and generating the routing topology table based on the topology relationship and the communication delay.

[0066] Specifically, the topology of gateway edge nodes is an abstract spatial layout of each gateway edge node. The routing topology table records each gateway edge node in the gateway network, as well as each node's neighboring nodes. In addition, the routing topology table also records the latency information between every two adjacent edge nodes.

[0067] In this embodiment, the routing topology table provides a clear understanding of the location and connectivity of each gateway edge node. The routing topology table further includes latency information between any two adjacent gateway edge nodes, providing crucial latency estimation and path selection data for network communication.

[0068] In an exemplary embodiment, the method further includes: acquiring change information when the configuration of one of the gateway edge nodes changes; generating a version number of the change information; and broadcasting the change information to a first neighboring node, wherein the first neighboring node is all neighboring nodes of the gateway edge node.

[0069] The gateway configuration includes user configuration and gateway configuration, and changes to these configurations are referred to as change information. Gateway configuration mainly includes information such as routing topology table, heartbeat configuration, and addresses of adjacent edge nodes; user configuration mainly includes user, role, registration interface, and permission information.

[0070] When the gateway configuration changes, the corresponding current gateway edge node assigns a unique version number to the information based on the current timestamp, and then broadcasts this information to all neighboring nodes. For example, to facilitate differentiation, this embodiment defines the neighboring nodes of the current gateway edge node as the first neighboring node. It is important to note that the version number of the changed information is uniquely determined; one version number corresponds one-to-one with one changed piece of information. Gateway configuration refers to the configuration within the gateway network. For example, adding a new network domain or enabling communication between two previously unconnected gateway edge nodes can all be considered changes to the gateway configuration.

[0071] In an exemplary embodiment, after broadcasting the change information to all neighboring nodes of the gateway edge node, the process includes: if a neighboring node receives the change information, determining whether it is the first time the change information has been received based on the version number of the change information; if not, updating the routing topology table based on the change information and broadcasting the change information to a second neighboring node, wherein the second neighboring node is all neighboring nodes of each first neighboring node; if yes, no processing is performed.

[0072] Upon receiving the information, the first neighboring node first checks whether it has already received the same version number of information. If it has, it does not process it; if it has not, it updates its local network topology table based on the information and continues to broadcast the information to the second neighboring node connected to it. This process continues until all gateway edge nodes in the gateway network maintain the same routing topology table.

[0073] Based on this, this application enables all gateway edge nodes to update their network topology tables in a timely and accurate manner. It ensures that all nodes in the entire gateway network can synchronize and maintain a consistent routing topology table. This allows the entire network structure to maintain a stable operating state and effectively improves the reliability of network communication.

[0074] In an exemplary embodiment, determining the optimal communication path between each of the gateway edge nodes based on the routing topology table includes: calculating the path with the shortest communication time between the two gateway edge nodes based on the topological relationship between the two gateway edge nodes and the communication latency using a shortest path algorithm; and determining the path with the shortest communication time as the optimal communication path between the two gateway edge nodes.

[0075] For example, the shortest path algorithm can be Dijkstra's algorithm. Dijkstra's algorithm is a single-source shortest path algorithm. It identifies the initiating gateway edge node as the source node and the receiving gateway edge node as the target node. When using Dijkstra's algorithm, the source node to be calculated is selected, and the shortest paths from the source node to other nodes are calculated step by step. The shortest distance and path information from each node to the source node are recorded. The final shortest path to the target node is the optimal communication path from the source node to the target node. This embodiment can calculate the path with the shortest communication time between two gateway edge nodes that need to communicate, and then determine this path with the shortest communication time as the optimal communication path between the two gateway edge nodes, thereby achieving efficient and low-latency data transmission.

[0076] In an exemplary embodiment, the communication between different network domains based on the optimal communication path includes: when a request is received in one of the network domains, obtaining the location of the request target corresponding to the current request; if the request target is in the current network domain, forwarding the request to the corresponding request target; if the request target is not in the current network domain, sending the request to the network domain corresponding to the request target via the optimal communication path, and then forwarding it to the request target.

[0077] For example, the request received here is a traffic request from a client. When a request initiated by a client is received, the target of the request, i.e., the server, is determined. If the server and the network edge node are in the same network domain, the request is forwarded to the corresponding server. If the requested server is in another network domain, the optimal communication path is calculated according to the routing topology table, and the request is sent to the network edge node of the corresponding network domain based on the optimal communication path.

[0078] In this embodiment, when a request is received in a network domain, the target location of the request is first determined, i.e., the network domain where the target of the request is located. If the target of the request is located within the current network domain, the request is directly forwarded to the target location. If the target of the request is not located in the current network domain, the system will forward the request to the target network domain through a pre-determined optimal communication path, ensuring that the request can be delivered to its destination efficiently and accurately.

[0079] To more clearly illustrate the cross-regional communication method provided in this application, the following detailed embodiment is provided:

[0080] by Figure 3Taking the gateway structure and deployment architecture as an example, the gateway structure in this embodiment is a decentralized structure, so there is no centrally deployed gateway. One gateway edge node is deployed in each service domain. Each edge node must ensure network communication with at least one other edge node and must be added to the gateway's network topology.

[0081] Please see Figure 4 For ease of explanation, Figure 4 This application presents a specific implementation process in a modular form, defining a network domain, including the server, as a service domain. The gateway internal structure provided in this embodiment includes a request receiving module, a routing topology table, a configuration module, a broadcast module, and a gateway front-end.

[0082] Specifically, the request receiving module is primarily the entry point for the gateway edge nodes, through which client traffic requests enter. This module is mainly responsible for client authentication, authorization, traffic statistics, and some basic gateway protection, such as handling frequent client calls.

[0083] The routing topology table is the core component of this embodiment. It records each edge node in the gateway network, as well as each node's adjacent edge nodes, thus constructing a topology table of edge nodes. It also records the latency information between every two adjacent edge nodes. Using this information, the fastest path for network communication between any two nodes can be calculated using a shortest path algorithm.

[0084] The gateway configuration includes both user configuration and gateway configuration. Changes to the configuration are called messages. Edge nodes assign a unique version number to each message based on the current timestamp and then broadcast the message to all neighboring nodes. Upon receiving the message, a neighboring node first checks if it has already received a message with the same version number. If it has, it does not process it; otherwise, it updates its local network topology table based on the message and immediately broadcasts the message. Thus, all edge nodes in the entire gateway network maintain the same routing topology table.

[0085] After processing the client's request, the request receiving module forwards it to the request forwarding module. This module first determines the server in the request. If the server and the edge node are in the same network domain, the request is forwarded to the corresponding server. If the server is in a different network domain, the optimal communication path is calculated based on the network topology table, and the request is sent to the edge node in the next network domain.

[0086] The configuration module maintains the basic configuration for gateway operation. It is mainly divided into two parts: gateway configuration and user configuration. Gateway configuration mainly includes information such as routing topology table, heartbeat configuration, and addresses of adjacent edge nodes; user configuration mainly includes information such as users, roles, registration interfaces, and permission information.

[0087] The broadcast module is mainly used for heartbeat broadcasting of the gateway and sending change information to surrounding nodes when the current gateway configuration changes.

[0088] In this gateway architecture, a front-end page for a specific service domain is not mandatory. Users can configure settings on the front-end page of any network domain, and these settings will be broadcast to all gateways.

[0089] It should be understood that although the steps in the flowcharts of the embodiments described above are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the embodiments described above may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the steps or stages of other steps.

[0090] Based on the same inventive concept, this application also provides a cross-regional communication device for implementing the cross-regional communication method described above. The solution provided by this device is similar to the implementation described in the above method; therefore, the specific limitations in one or more cross-regional communication device embodiments provided below can be found in the limitations of the cross-regional communication method described above, and will not be repeated here.

[0091] In one exemplary embodiment, such as Figure 5 As shown, a cross-regional communication device 500 is provided, including: a deployment module 501, a generation module 502, a determination module 503, and a communication module 504, wherein:

[0092] Deployment module 501 is used to deploy gateway edge nodes to multiple network domains, wherein each of the gateway edge nodes has at least one other gateway edge node with which it communicates with its network.

[0093] The generation module 502 is used to obtain the topological relationship between each of the gateway edge nodes and generate a routing topology table for the gateway edge nodes based on the topological relationship;

[0094] The determination module 503 is used to determine the optimal communication path between each of the gateway edge nodes based on the routing topology table;

[0095] The communication module 504 is used to realize communication between different network domains based on the optimal communication path.

[0096] In an exemplary embodiment, the generation module 502 is further configured to:

[0097] Obtain the neighboring nodes of each gateway edge node; obtain the communication delay between each gateway edge node and its neighboring nodes; generate the routing topology table based on the topology relationship and the communication delay.

[0098] In an exemplary embodiment, the generation module 502 is further configured to:

[0099] If the configuration of a gateway edge node changes, obtain the change information; generate a version number of the change information; and broadcast the change information to a first neighboring node, wherein the first neighboring node is all the neighboring nodes of the gateway edge node.

[0100] In an exemplary embodiment, the generation module 502 is further configured to:

[0101] If a neighboring node receives the change information, it determines whether it is the first time the change information has been received based on the version number of the change information. If not, it updates the routing topology table based on the change information and broadcasts the change information to the second neighboring node, where the second neighboring node is all the neighboring nodes of each of the first neighboring nodes. If yes, no action is taken.

[0102] In an exemplary embodiment, the determining module 503 is further configured to:

[0103] Using the shortest path algorithm, the path with the shortest communication time between the two gateway edge nodes is calculated based on the topological relationship and the communication latency; the path with the shortest communication time is determined as the optimal communication path between the two gateway edge nodes.

[0104] In an exemplary embodiment, the communication module 504 is further configured to:

[0105] When a request is received in one of the network domains, the location of the request target corresponding to the current request is obtained; if the request target is in the current network domain, the request is forwarded to the corresponding request target; if the request target is not in the current network domain, the request is sent to the network domain corresponding to the request target via the optimal communication path, and then forwarded to the request target.

[0106] Each module in the aforementioned cross-regional communication device can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in a computer device, or stored in the memory of a computer device as software, so that the processor can call and execute the operations corresponding to each module.

[0107] In one exemplary embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as follows: Figure 6 As shown, this computer device includes a processor, memory, input / output interfaces (I / O), and a communication interface. The processor, memory, and I / O interfaces are connected via a system bus, and the communication interface is also connected to the system bus via the I / O interfaces. The processor provides computational and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system, computer programs, and a database. The internal memory provides the environment for the operation of the operating system and computer programs stored in the non-volatile storage media. The database stores a routing topology table. The I / O interfaces are used for exchanging information between the processor and external devices. The communication interface is used for communicating with external terminals via a network connection. When executed by the processor, the computer program implements a cross-regional communication method.

[0108] Those skilled in the art will understand that Figure 6 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0109] In one exemplary embodiment, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to perform the following steps:

[0110] Gateway edge nodes are deployed in multiple network domains, wherein each of the gateway edge nodes has at least one other gateway edge node with which it communicates with its network.

[0111] Obtain the topological relationship between each of the gateway edge nodes, and generate a routing topology table for the gateway edge nodes based on the topological relationship;

[0112] The optimal communication path between each of the gateway edge nodes is determined based on the routing topology table;

[0113] Communication between different network domains is achieved based on the optimal communication path.

[0114] In one embodiment, a computer-readable storage medium is provided having a computer program stored thereon, the computer program performing the following steps when executed by a processor:

[0115] Gateway edge nodes are deployed in multiple network domains, wherein each of the gateway edge nodes has at least one other gateway edge node with which it communicates with its network.

[0116] Obtain the topological relationship between each of the gateway edge nodes, and generate a routing topology table for the gateway edge nodes based on the topological relationship;

[0117] The optimal communication path between each of the gateway edge nodes is determined based on the routing topology table;

[0118] Communication between different network domains is achieved based on the optimal communication path.

[0119] In one embodiment, a computer program product is provided, including a computer program that, when executed by a processor, performs the following steps:

[0120] Gateway edge nodes are deployed in multiple network domains, wherein each of the gateway edge nodes has at least one other gateway edge node with which it communicates with its network.

[0121] Obtain the topological relationship between each of the gateway edge nodes, and generate a routing topology table for the gateway edge nodes based on the topological relationship;

[0122] The optimal communication path between each of the gateway edge nodes is determined based on the routing topology table;

[0123] Communication between different network domains is achieved based on the optimal communication path.

[0124] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of the relevant data must comply with relevant regulations.

[0125] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM). The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, artificial intelligence (AI) processors, etc., and are not limited to these.

[0126] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0127] The embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are specific and detailed, they should not be construed as limiting the scope of this patent application. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this application should be determined by the appended claims.

Claims

1. A cross-regional communication method, characterized in that, The method includes: Gateway edge nodes are deployed in multiple network domains, wherein each of the gateway edge nodes has at least one other gateway edge node with which it communicates with its network. The topological relationships between the gateway edge nodes are obtained, and a routing topology table for the gateway edge nodes is generated based on the topological relationships. The topological relationships between the gateway edge nodes are an abstract spatial layout of each gateway node. The routing topology table includes: each gateway edge node in the gateway network, the adjacent nodes of each node, and the latency information between each pair of adjacent edge nodes. The optimal communication path between each of the gateway edge nodes is determined based on the routing topology table; Communication between different network domains is achieved based on the optimal communication path described above; The step of generating the routing topology table for the gateway edge node based on the topology relationship includes: Obtain the neighboring nodes of each of the aforementioned gateway edge nodes; Obtain the communication delay between each of the gateway edge nodes and its adjacent nodes; The routing topology table is generated based on the topological relationships and the communication delay; Determining the optimal communication path between each gateway edge node based on the routing topology table includes: The shortest path algorithm is used to calculate the path with the shortest communication time between the two gateway edge nodes based on the topological relationship and the communication latency. The path with the shortest communication time is determined as the optimal communication path between the two gateway edge nodes.

2. The method according to claim 1, characterized in that, The method further includes: If the configuration of one of the gateway edge nodes changes, obtain the change information; A version number for the change information is generated, and the change information is broadcast to the first neighboring node, wherein the first neighboring node is all the neighboring nodes of the gateway edge node.

3. The method according to claim 2, characterized in that, After broadcasting the change information to all neighboring nodes of the gateway edge node, the process includes: When the adjacent node receives the change information, it is determined whether it is the first time the change information has been received based on the version number of the change information; If not, the routing topology table is updated based on the change information, and the change information is broadcast to the second neighboring node, wherein the second neighboring node is all the neighboring nodes of each of the first neighboring nodes; If so, no action will be taken.

4. The method according to claim 1, characterized in that, The method of achieving communication between different network domains based on the optimal communication path includes: When a request is received in one of the network domains, obtain the location of the request target corresponding to the current request; If the target of the request is in the current network domain, then the request is forwarded to the corresponding target. If the target of the request is not in the current network domain, the request is sent to the network domain corresponding to the target of the request via the optimal communication path, and then forwarded to the target of the request.

5. A cross-regional communication device, characterized in that, The device includes: The deployment module is used to deploy gateway edge nodes to multiple network domains, wherein each of the gateway edge nodes has at least one other gateway edge node with which it communicates with its network. The generation module is used to obtain the topological relationship between each of the gateway edge nodes and generate a routing topology table for the gateway edge nodes based on the topological relationship; the topological relationship between the gateway edge nodes is an abstract spatial layout of each gateway node; the routing topology table includes: each gateway edge node in the gateway network, the adjacent nodes of each node, and the latency information between each pair of adjacent edge nodes; The determination module is used to determine the optimal communication path between each of the gateway edge nodes based on the routing topology table; The communication module is used to enable communication between different network domains based on the optimal communication path. The generation module is further configured to obtain the neighboring nodes of each of the gateway edge nodes; obtain the communication delay between each of the gateway edge nodes and its neighboring nodes; and generate the routing topology table based on the topology relationship and the communication delay. The determining module is further configured to calculate the shortest communication path between the two gateway edge nodes based on the topological relationship and the communication delay using a shortest path algorithm; and determine the shortest communication path as the optimal communication path between the two gateway edge nodes.

6. The apparatus according to claim 5, characterized in that, The generation module is further configured to acquire change information when the configuration of a gateway edge node changes; generate a version number of the change information; and broadcast the change information to a first neighboring node, wherein the first neighboring node is all neighboring nodes of the gateway edge node.

7. The apparatus according to claim 6, characterized in that, The generation module is further configured to, when the neighboring node receives the change information, determine whether it is the first time the change information has been received based on the version number of the change information; if not, update the routing topology table based on the change information and broadcast the change information to the second neighboring node, wherein the second neighboring node is all the neighboring nodes of each of the first neighboring nodes; if yes, no processing is performed.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 4.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 4.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 4.

Images