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

Abstract

The invention relates to a cross-regional communication method and device, equipment, a storage medium and a program product. The method comprises the following steps: deploying gateway edge nodes for a plurality of network domains, wherein each gateway edge node at least has another gateway edge node which is intercommunicated with the network of the gateway edge node; obtaining a topological relation between the gateway edge nodes, and generating a routing topology table of the gateway edge nodes based on the topological relation; determining an optimal communication path between the gateway edge nodes based on the routing topology table; and realizing communication among different network domains based on the optimal communication path. Through adoption of the method, cross-network domain communication can be realized without deploying a gateway in a middle area of a network domain.

Description

Technical Field

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

[0002] While cloud computing-based deployment methods bring convenience, they also increase the complexity of software system deployment. If systems in unconnected networks need to communicate with each other, they need to use a gateway to forward requests. The traditional gateway model requires the gateway to be deployed in an intermediate area, and this area is interconnected with all other client and server networks in order to complete network request forwarding. This method relies too much on the intermediate area. If the intermediate area does not exist or is difficult to obtain, cross-region communication between multiple systems cannot be achieved. Summary of the invention

[0003] Based on this, it is necessary to provide a cross-regional communication method, device, equipment, storage medium and program product that can communicate across network domains in response to the above technical problems.

[0004] In a first aspect, the present application provides a cross-region communication method, comprising:

[0005] Deploy gateway edge nodes to multiple network domains, wherein each gateway edge node has at least one other gateway edge node that is interconnected with its network;

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

[0007] Determine the optimal communication path between each of the gateway edge nodes 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 topological relationship includes:

[0010] Obtaining adjacent nodes of each of the gateway edge nodes;

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

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

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

[0014] When a configuration of one of the gateway edge nodes changes, obtaining change information;

[0015] A version number of the change information is generated, and the change information is broadcast to a first neighboring node, wherein the first neighboring node is all 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 following steps are performed:

[0017] When the neighboring node receives the change information, judging whether it is the first time to receive the change information 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 nodes, wherein the second neighboring nodes are all 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] Calculate the shortest communication path between the two gateway edge nodes based on the topological relationship and the communication delay of the two gateway edge nodes by using the shortest path algorithm;

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

[0023] In one of the embodiments, the 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, obtaining a location of a request target corresponding to the current request;

[0025] If the request target is in the current network domain, forwarding the request to the corresponding request target;

[0026] 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.

[0027] In a second aspect, the present application also provides a cross-region communication device, including:

[0028] A deployment module, configured to deploy gateway edge nodes to multiple network domains, wherein each of the gateway edge nodes has at least one other gateway edge node interoperable with its network;

[0029] A generating module, configured to obtain a topological relationship between each of the gateway edge nodes, and generate a routing topology table of the gateway edge nodes based on the topological relationship;

[0030] A determination module, configured to determine an optimal communication path between each of the gateway edge nodes based on the routing topology table;

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

[0032] In a third aspect, the present application further provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0033] Deploy gateway edge nodes to multiple network domains, wherein each gateway edge node has at least one other gateway edge node that is interconnected with its network;

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

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

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

[0037] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the following steps are implemented:

[0038] Deploy gateway edge nodes to multiple network domains, wherein each gateway edge node has at least one other gateway edge node that is interconnected with its network;

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

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

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

[0042] In a fifth aspect, the present application further provides a computer program product, including a computer program, which implements the following steps when executed by a processor:

[0043] Deploy gateway edge nodes to multiple network domains, wherein each gateway edge node has at least one other gateway edge node that is interconnected with its network;

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

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

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

[0047] The above cross-region communication method, device, computer equipment, computer-readable storage medium and computer program product deploy gateway edge nodes in each unconnected network domain to form a distributed gateway structure. It can simplify the complex network structure of gateway deployment and remove the centralized gateway device, thereby improving the security and sustainability of the entire system. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0049] Figure 1 A schematic diagram of a flow chart of a cross-region communication method in one embodiment;

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

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

[0052] Figure 4 It is a flowchart of a cross-region communication method in a specific embodiment;

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

[0054] Figure 6 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0055] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0056] In one embodiment, Figure 1 As shown, a cross-region communication method is provided. This embodiment takes the method applied to a terminal as an example. It can be understood that the method can also be applied to a server, and can also be applied to a system including a terminal and a server, and is implemented through the interaction between the terminal and the server. In this embodiment, the method includes the following steps:

[0057] Step 101, deploying gateway edge nodes to multiple network domains, wherein each of the gateway edge nodes has at least one other gateway edge node interoperable with its network;

[0058] Step 102, obtaining a topological relationship between each of the gateway edge nodes, and generating a routing topology table of the gateway edge nodes based on the topological relationship;

[0059] Step 103, determining an 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] See also Figure 2 , Figure 2 An existing gateway deployment architecture is shown. Due to the booming development of cloud computing, many companies have migrated their IT systems to the cloud. While cloud computing-based deployment methods bring convenience, they also increase the complexity of software system deployment. If systems in different networks need to communicate with each other, they need to use a gateway to forward requests. The traditional gateway mode requires the gateway to be deployed in an intermediate area, and this area is interconnected with all other client and server networks in order to complete network request forwarding. However, in actual practice, not all scenarios have an intermediate network area, so the traditional gateway architecture is not competent.

[0062] Based on this, this application proposes a decentralized gateway structure. Figure 3 , Figure 3 Gateway deployment architecture provided for this application. Exemplarily, this embodiment does not centrally deploy gateways, but deploys a gateway edge node in each network domain, each gateway edge node at least ensures network interconnection with another gateway edge node, and each gateway edge node needs to be added to the topological relationship of the network. Exemplarily, the network interconnection method can include interconnection through the public network, interconnection through vpc peer connection, connection through physical layer network cable, connection through firewall, etc., which are not specifically limited here.

[0063] After determining each gateway edge node in the gateway network and the adjacent nodes of each gateway edge node, the topological relationship between the gateway edge nodes can be determined, and a routing topology table can be further generated based on the topological relationship. Based on the routing topology table, the optimal communication path between the gateway edge nodes can be calculated, and communication between different network domains can be achieved based on the optimal communication path when there is a need for cross-regional communication.

[0064] In the above cross-region communication method, unlike the traditional method of centrally deploying gateway devices in the middle areas of multiple different network domains, gateway edge nodes are deployed in each unconnected network domain to form a distributed gateway structure. This embodiment can simplify the complex network structure of gateway deployment, and remove the centralized gateway device, thereby improving the security and sustainability of the entire system. In addition, the gateway structure proposed in this embodiment can be deployed in a new network domain and can be used, and can share configurations with other gateway edge nodes, automatically form a network, and has the advantage of flexibility.

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

[0066] Specifically, the topological relationship of the gateway edge nodes is the abstract spatial layout of each gateway edge node. The routing topology table records each gateway edge node in the gateway network, as well as the adjacent nodes of each node. In addition, the routing topology table also records the delay information between each two adjacent edge nodes.

[0067] In this embodiment, the location and connection status of each gateway edge node can be clearly understood through the routing topology table. The routing topology table further includes the delay information between each two adjacent gateway edge nodes, providing important delay estimation and path selection basis for network communication.

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

[0069] The configuration in the gateway includes user configuration and gateway configuration. The change of configuration is called change information. Gateway configuration mainly includes routing topology table, heartbeat configuration, adjacent edge node address and other information; user configuration mainly includes user, role, registration interface, permission information and so on.

[0070] In the event that the gateway configuration changes, the corresponding current gateway edge node will give the information a unique version number based on the current timestamp, and then broadcast the information to all adjacent nodes. Exemplarily, for ease of distinction, this embodiment defines the adjacent node of the current gateway edge node as the first adjacent node. It should be noted that the version number of the change information is uniquely determined, and one version number corresponds to one change information. The gateway configuration is the configuration inside the gateway network. For example, the addition of a new network domain, the intercommunication of two gateway edge nodes that were originally not interoperable, etc. can all be regarded as changes in the gateway configuration.

[0071] In an exemplary embodiment, after broadcasting the change information to all neighboring nodes of the gateway edge node, it includes: when the neighboring node receives the change information, judging whether it is the first time to receive the change information 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 the second neighboring node, wherein the second neighboring node is all neighboring nodes of each of the first neighboring nodes; if so, no processing is performed.

[0072] After receiving the information, the first neighbor node first determines whether it has received the information with the same version number. If it has, it will not process it. If it has not, it will update the local network topology table of the first neighbor node according to the information and continue to broadcast the information to the second neighbor node connected to it. And so on, all gateway edge nodes in the gateway network will eventually maintain the same routing topology table.

[0073] Based on this, the present application enables all gateway edge nodes to update their network topology tables in a timely and accurate manner. This ensures that all nodes in the entire gateway network can synchronize and maintain a consistent routing topology table. In this way, the entire network structure can maintain a stable working state, effectively improving the reliability of network communications.

[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 and the communication delay of the two gateway edge nodes through 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] Exemplarily, the shortest path algorithm can adopt the Dijkstra algorithm. The Dijkstra algorithm is a single-source shortest path algorithm, which determines the initiating gateway edge node as the source node and the receiving gateway edge node as the target node. When using the Dijkstra algorithm, the source node to be calculated is selected, and the shortest path from the source node to other nodes is calculated step by step, and the shortest distance and path information from each node to the source node are recorded. The shortest path to the target node is finally obtained as the optimal communication path from the source node to the target node. This embodiment can calculate the path with the shortest communication time between the 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 via the optimal communication path to the network domain corresponding to the request target, and then forwarding it to the request target.

[0077] Exemplarily, the request received here is a traffic request from a client. When a request initiated by a client is received, the request target in the request, that is, the server, is judged. 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, that is, the network domain where the target of the request is located. If the target of the request is located in the current network domain, the request is directly forwarded to the target location. If the target of the request is not in the current network domain, the system will forward the request to the network domain where the target is located through a pre-determined optimal communication path to ensure that the request can be efficiently and accurately delivered to the destination.

[0079] In order to more clearly illustrate the cross-region communication method provided by the present application, a most detailed embodiment is described below:

[0080] by Figure 3Taking the gateway structure and deployment architecture of as an example, the gateway structure in this embodiment is a decentralized structure, so there is no centrally deployed gateway during deployment. A gateway edge node is deployed in each service domain, and each edge node at least guarantees network intercommunication with another edge node and needs to be added to the network topology of the gateway.

[0081] See also Figure 4 , for ease of explanation, Figure 4 A specific implementation process of the present application is presented in a modular form, and the network domain including the server is determined as a service domain. Among them, the internal structure of the gateway provided by 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 mainly the entrance of the gateway edge node, and the client's traffic request enters from this module. This module is mainly responsible for the client's identity authentication, authorization, traffic statistics and some basic protection of the gateway, such as frequent client calls.

[0083] The routing topology table is the core part of this embodiment. The routing topology table records each edge node in the gateway network and the adjacent edge nodes of each node, thereby constructing a topology table of edge nodes. And the delay information between each two adjacent edge nodes is recorded. With the above information, the shortest path algorithm can be used to calculate the fastest path for network communication between any two nodes.

[0084] There are two types of configurations in the gateway: user configuration and gateway configuration. The change in configuration is called information. The edge node will give the information a unique version number based on the current timestamp, and then broadcast the information to all adjacent nodes. After receiving the information, the adjacent node first determines whether it has received the information with the same version number. If it has, it will not process it; if not, it will update the local network topology table based on the information and broadcast the information urgently. As a result, all edge nodes in the entire gateway network will maintain the same routing topology table.

[0085] After processing the client's request, the request receiving module sends the request to the request forwarding module. The 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 requested server is in another network domain, the optimal communication path is calculated according to the network topology table, and the request is sent to the edge node of the next network domain.

[0086] The configuration module maintains the basic configuration of the gateway operation. It is mainly divided into two parts: gateway configuration and user configuration. Gateway configuration mainly includes routing topology table, heartbeat configuration, adjacent edge node address and other information; user configuration mainly includes users, roles, registration interfaces, permission information and so on.

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

[0088] In this gateway structure, the front-end page of a certain service domain is not necessary. Users can configure settings on the front-end page of any network domain, and the configuration can be broadcast to all gateways.

[0089] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0090] Based on the same inventive concept, the embodiment of the present application also provides a cross-regional communication device for implementing the cross-regional communication method involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in one or more cross-regional communication device embodiments provided below can refer to the above limitations on the cross-regional communication method, which will not be repeated here.

[0091] In an exemplary embodiment, Figure 5 As shown, a cross-region 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] A deployment module 501 is used to deploy gateway edge nodes to multiple network domains, wherein each gateway edge node has at least one other gateway edge node that is interconnected with its network;

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

[0094] A determination module 503, configured to determine an optimal communication path between each of the gateway edge nodes based on the routing topology table;

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

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

[0097] Acquire the adjacent nodes of each of the gateway edge nodes; acquire the communication delay between each of the gateway edge nodes and the adjacent nodes; and generate the routing topology table based on the topological relationship and the communication delay.

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

[0099] When a configuration of the gateway edge node changes, change information is obtained; a version number of the change information is generated, and the change information is broadcast to a first adjacent node, wherein the first adjacent node is all adjacent nodes of the gateway edge node.

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

[0101] When the adjacent node receives the change information, it determines whether it is the first time to receive the change information 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 adjacent node, wherein the second adjacent node is all adjacent nodes of each of the first adjacent nodes; if so, no processing is performed.

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

[0103] By using the shortest path algorithm, a path with the shortest communication time between the two gateway edge nodes is calculated based on the topological relationship and the communication delay of the two gateway edge nodes; and 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 above-mentioned inter-regional communication device can be implemented in whole or in part by software, hardware and a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute operations corresponding to each module above.

[0107] In an exemplary embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as shown in FIG. Figure 6 As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store a routing topology table. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a cross-regional communication method is implemented.

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

[0109] In an exemplary embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the following steps are implemented:

[0110] Deploy gateway edge nodes to multiple network domains, wherein each gateway edge node has at least one other gateway edge node that is interconnected with its network;

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

[0112] Determine the optimal communication path between each of the gateway edge nodes 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, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

[0115] Deploy gateway edge nodes to multiple network domains, wherein each gateway edge node has at least one other gateway edge node that is interconnected with its network;

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

[0117] Determine the optimal communication path between each of the gateway edge nodes 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, comprising a computer program, which, when executed by a processor, implements the following steps:

[0120] Deploy gateway edge nodes to multiple network domains, wherein each gateway edge node has at least one other gateway edge node that is interconnected with its network;

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

[0122] Determine the optimal communication path between each of the gateway edge nodes 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, stored data, displayed data, 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 relevant data must comply with relevant regulations.

[0125] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present 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. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0126] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, 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 above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A cross-region communication method, characterized in that: The method comprises: Deploy gateway edge nodes to multiple network domains, wherein each gateway edge node has at least one other gateway edge node that is interconnected with its network; Acquire the topological relationship between each of the gateway edge nodes, and generate a routing topology table of the gateway edge nodes based on the topological relationship; Determine the optimal communication path between each of the gateway edge nodes based on the routing topology table; Communication between different network domains is achieved based on the optimal communication path.

2. The method according to claim 1, characterized in that The generating the routing topology table of the gateway edge node based on the topological relationship includes: Obtaining adjacent nodes of each of the gateway edge nodes; Obtaining the communication delay between each of the gateway edge nodes and the adjacent nodes; The routing topology table is generated based on the topological relationship and the communication delay.

3. The method according to claim 2, characterized in that The method further comprises: When a configuration of one of the gateway edge nodes changes, obtaining change information; A version number of the change information is generated, and the change information is broadcast to a first neighboring node, wherein the first neighboring node is all neighboring nodes of the gateway edge node.

4. The method according to claim 3, characterized in that: After broadcasting the change information to all neighboring nodes of the gateway edge node, the method further comprises: When the neighboring node receives the change information, judging whether it is the first time to receive the change information 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 nodes, wherein the second neighboring nodes are all neighboring nodes of each of the first neighboring nodes; If so, no action will be taken.

5. The method according to claim 2, characterized in that: The determining the optimal communication path between each of the gateway edge nodes based on the routing topology table includes: Calculate the shortest communication path between the two gateway edge nodes based on the topological relationship and the communication delay of the two gateway edge nodes by using the shortest path algorithm; The path with the shortest communication time is determined as the optimal communication path between the two gateway edge nodes.

6. The method according to claim 1, characterized in that The implementing communication between different network domains based on the optimal communication path includes: When a request is received in one of the network domains, obtaining a location of a 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, 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.

7. A cross-region communication device, characterized in that: The device comprises: A deployment module, configured to deploy gateway edge nodes to multiple network domains, wherein each of the gateway edge nodes has at least one other gateway edge node interoperable with its network; A generating module, configured to obtain a topological relationship between each of the gateway edge nodes, and generate a routing topology table of the gateway edge nodes based on the topological relationship; A determination module, configured to determine an optimal communication path between each of the gateway edge nodes based on the routing topology table; A communication module is used to implement communication between different network domains based on the optimal communication path.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

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

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

Images