CN115277864B - Route determining method and device, computer readable storage medium and terminal - Google Patents
Route determining method and device, computer readable storage medium and terminal Download PDFInfo
- Publication number
- CN115277864B CN115277864B CN202210894053.7A CN202210894053A CN115277864B CN 115277864 B CN115277864 B CN 115277864B CN 202210894053 A CN202210894053 A CN 202210894053A CN 115277864 B CN115277864 B CN 115277864B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- service system
- address
- target service
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 46
- 238000013507 mapping Methods 0.000 claims description 16
- 238000004590 computer program Methods 0.000 claims description 10
- 238000012423 maintenance Methods 0.000 abstract description 15
- 230000009286 beneficial effect Effects 0.000 abstract description 8
- 230000003993 interaction Effects 0.000 description 24
- 238000012546 transfer Methods 0.000 description 10
- 230000006870 function Effects 0.000 description 7
- 238000002955 isolation Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 230000000739 chaotic effect Effects 0.000 description 5
- 238000011084 recovery Methods 0.000 description 4
- 230000001360 synchronised effect Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A route determining method and device, a computer readable storage medium and a terminal, wherein the method comprises the following steps: judging whether the IP address of a receiving node receiving a service request and the IP address of a target service system called by the service request belong to the same machine room and the same network segment; if the judgment result is negative, from the receiving node, selecting nodes one by one from adjacent nodes of the current node as forwarding nodes for next forwarding until the IP address of the current node and the IP address of the target service system belong to the same machine room and the same network segment; the adjacent nodes are nodes which belong to the same machine room and/or the same network segment as the current node. The scheme is beneficial to greatly simplifying the network structure, reducing the network opening deployment and maintenance cost, and being beneficial to realizing high-efficiency and convenient interconnection and interworking among service systems.
Description
Technical Field
The embodiment of the invention relates to the technical field of data communication, in particular to a route determining method and device, a computer readable storage medium and a terminal.
Background
The enterprise service bus (Enterprise Service Bus, ESB) is used as a common system intercommunication means for enterprises, and the flow and data transmission among heterogeneous systems are realized through the service interface standard and the information exchange standard of the standard information technology (InformationTechnology, IT) application system. Currently, enterprises generally build a plurality of data centers/machine rooms to play a role in disaster recovery or multiple activities, and meanwhile, to protect the transaction safety and continuity of key businesses, each data center/machine room can be divided into a plurality of network segments according to business needs, and network isolation is performed at the same time.
In the prior art, in order to satisfy data interaction between different/heterogeneous service systems of multiple network segments of multiple machine rooms, for a service provider system (hereinafter referred to as a service system), an ESB often adopts full-scale connection at each node, that is, each node of the ESB needs to be directly or indirectly connected with all service systems, which can cause problems of huge network opening, rapid increase of deployment cost and complicated network structure. In addition, because network isolation exists between the service systems crossing the machine room and the network segments, in order to enable the service systems with the network isolation to perform data interaction, network transfer is realized by additionally using load balancing equipment or a transfer machine, so that the investment and maintenance cost of additional equipment are increased, and the network structure is more chaotic and complex. In addition, because the network configuration of each group of nodes is different, every time one ESB node (for example, a standby node) is newly added, massive networks are required to be opened, and the targeted network opening is required to be carried out at great cost, so that the lateral expansion of the ESB is not facilitated, the interconnection and the intercommunication among service systems are not facilitated, and the unified management is not facilitated.
Disclosure of Invention
The technical problem solved by the embodiment of the invention is that when the data interaction of different service systems is realized in the prior art, the network is opened by adopting each node and all the service systems, and the routing equipment is additionally deployed when the service systems which cross machine rooms and cross network segments are interacted, so that the problems of complicated network structure, high deployment and maintenance cost and difficult management are caused.
In order to solve the above technical problems, an embodiment of the present invention provides a route determining method, including the following steps: judging whether the IP address of a receiving node receiving a service request and the IP address of a target service system called by the service request belong to the same machine room and the same network segment; if the judgment result is negative, from the receiving node, selecting nodes one by one from adjacent nodes of the current node as forwarding nodes for next forwarding until the IP address of the current node and the IP address of the target service system belong to the same machine room and the same network segment; the adjacent nodes are nodes which belong to the same machine room and/or the same network segment as the current node.
Optionally, the method further comprises: determining an optimal routing link from each routing link formed from the receiving node to the target node; forwarding the service request to the target service system sequentially via each node on the optimal routing link; the target node is one or more nodes which belong to the same machine room and the same network segment with the IP address of the target service system.
Optionally, the determining an optimal routing link among the routing links formed from the receiving node to the target node includes: among the routing links formed from the receiving node to the target node, determining the routing links with the number of the included nodes less than or equal to the preset number as standby routing links; determining one or more optimal routing links in the standby routing links; and the service request is sequentially forwarded to the target service system through each node on any one of the optimal routing links.
Optionally, at least a part of the nodes have a routing table, where the routing table includes a mapping relationship between indication information of one or more neighboring nodes of the current node and identification numbers of one or more service systems; after determining the optimal routing link, the method further comprises: and for each optimal routing link, updating the mapping relation between the indication information of each node on the optimal routing link and the identification number of the target service system to a routing table of a node before the node.
Optionally, at least a part of the nodes have a routing table, where the routing table includes a mapping relationship between indication information of one or more neighboring nodes of the current node and identification numbers of one or more service systems; from the receiving node, selecting nodes one by one from adjacent nodes of the current node as forwarding nodes for next forwarding comprises: each time a node is selected from adjacent nodes of a current node, searching whether the identification number of the service system which is the same as the identification number of the target service system exists in a routing table of the current node; and if the routing table of the current node has the same service system identification number as the target service system identification number, adopting the adjacent node corresponding to the same service system identification number as the forwarding node for the next forwarding.
Optionally, the method further comprises: if not, selecting at least one part of adjacent nodes from the adjacent nodes of the current node as forwarding nodes for next forwarding.
Optionally, the method further comprises: if the IP address of the receiving node receiving the service request and the IP address of the target service system called by the service request belong to the same machine room and the same network segment, forwarding the service request to the target service system based on the IP address of the target service system.
Optionally, before determining whether the IP address of the receiving node that receives the service request and the IP address of the target service system invoked by the service request belong to the same machine room and the same network segment, the method further includes: searching configuration information of the target service system according to the identification number of the target service system contained in the service request so as to acquire an IP address of the target service system; or determining the IP address of the target service system according to the IP address indication information of the target service system contained in the service request; or determining the IP address of the target service system according to the type of the service request.
The embodiment of the invention also provides a route determining device, which comprises: the address judging module is used for judging whether the IP address of the receiving node receiving the service request and the IP address of the target service system called by the service request belong to the same machine room and the same network segment; the route link determining module is used for selecting nodes from the receiving nodes one by one from adjacent nodes of the current node as forwarding nodes for next forwarding when the judging result is negative until the IP address of the current node and the IP address of the target service system belong to the same machine room and the same network segment; the adjacent nodes are nodes which belong to the same machine room and/or the same network segment as the current node.
The embodiment of the invention also provides a computer readable storage medium, on which a computer program is stored, which when being executed by a processor performs the steps of the above-mentioned route determination method.
The embodiment of the invention also provides a terminal, which comprises a memory and a processor, wherein the memory stores a computer program capable of running on the processor, and the processor executes the steps of the route determining method when running the computer program.
Compared with the prior art, the technical scheme of the embodiment of the invention has the following beneficial effects:
in the embodiment of the invention, whether the IP address of the receiving node receiving the service request and the IP address of the target service system called by the service request belong to the same machine room and the same network segment is judged; if the judgment result is negative, from the receiving node, selecting nodes one by one from adjacent nodes of the current node as forwarding nodes for next forwarding until the IP address of the current node and the IP address of the target service system belong to the same machine room and the same network segment; the adjacent nodes are nodes which belong to the same machine room and/or the same network segment as the current node. Compared with the prior art, in order to meet the data interaction between different service systems in a plurality of machine rooms or a plurality of network segments, network connection is often established between each node (for example, each program node in the ESB) and all service systems, so that the problems of the rapid increase of the cost of network opening, deployment, maintenance and the like and the complicated network structure are brought; in addition, in the prior art, in order to meet the data interaction between the service systems crossing machine rooms and network segments, load balancing equipment or a transfer machine is additionally deployed to realize network transfer, so that the investment and maintenance cost of additional equipment are increased, the network structure is more chaotic and complex, the expansibility is poor, and unified management is difficult; aiming at the data interaction among different service systems crossing machine rooms or network segments, the embodiment of the invention selects nodes from adjacent nodes of the current node one by one as forwarding nodes from receiving nodes for receiving service requests until the IP address of the current node (the current node can also be called as a target node) and the IP address of the target service system belong to the same machine room and the same network segment, and only needs to select nodes (namely the adjacent nodes) belonging to the same machine room and/or the same network segment with the current node when determining the forwarding nodes each time, without establishing direct network connection between each node and the target service system, and without additionally configuring network transfer equipment when crossing the machine rooms and the network segments (network isolation exists) among the service systems, thereby being beneficial to greatly simplifying the network structure, reducing the network opening deployment and the maintenance cost and being beneficial to realizing the efficient and convenient interconnection among the service systems.
Further, the method further comprises: determining an optimal routing link from each routing link formed from the receiving node to the target node; forwarding the service request to the target service system sequentially via each node on the optimal routing link; the target node is one or more nodes which belong to the same machine room and the same network segment with the IP address of the target service system. In the embodiment of the invention, the most suitable optimal routing link can be determined in each routing link formed from the receiving node to the target node according to the requirements of different application scenes. For example, a routing link including the least number of nodes or a routing link having the smallest sum of distances between the respective nodes is selected as the optimal routing link, so that the efficiency of data interaction can be improved as much as possible.
Further, the determining an optimal routing link among the routing links formed from the receiving node to the target node includes: among the routing links formed from the receiving node to the target node, determining the routing links with the number of the included nodes less than or equal to the preset number as standby routing links; determining one or more optimal routing links in the standby routing links; and the service request is sequentially forwarded to the target service system through each node on any one of the optimal routing links. In the embodiment of the invention, by determining the standby route link, when the optimal link fails, the service request can be forwarded by adopting other route links in the standby route link, so that the function of disaster recovery or multiple activities can be realized. In addition, by determining one or more optimal routing links among the standby routing links (for example, selecting one or more of the standby routing links with the least number of nodes as the optimal routing link), the data interaction efficiency can be improved to the greatest extent.
Further, at least a part of the nodes are provided with a routing table, and the routing table comprises the mapping relation between the indication information of one or more adjacent nodes of the current node and the identification numbers of one or more service systems; after determining the optimal routing link, the method further comprises: and for each optimal routing link, updating the mapping relation between the indication information of each node on the optimal routing link and the identification number of the target service system to a routing table of a node before the node. In the embodiment of the invention, after the optimal routing link is determined each time, the mapping relation in the routing table of the previous node of each node on the optimal routing link is updated, so that when the step of determining the forwarding nodes of the current node one by one is conveniently executed again later, the forwarding node of the next forwarding can be determined directly by searching the routing table of the current node, the routing link determination efficiency is improved, and the data interaction efficiency is further improved; in addition, since the current node only needs to maintain routing information (e.g., neighbor node IP address + service system identification number) of one or more neighbor nodes, data maintenance and storage costs can be reduced.
Further, at least a part of the nodes are provided with a routing table, and the routing table comprises the mapping relation between the indication information of one or more adjacent nodes of the current node and the identification numbers of one or more service systems; from the receiving node, selecting nodes one by one from adjacent nodes of the current node as forwarding nodes for next forwarding comprises: each time a node is selected from adjacent nodes of a current node, searching whether the identification number of the service system which is the same as the identification number of the target service system exists in a routing table of the current node; and if the routing table of the current node has the same service system identification number as the target service system identification number, adopting the adjacent node corresponding to the same service system identification number as the forwarding node for the next forwarding. In the embodiment of the invention, the forwarding nodes are determined by directly searching the routing table of the current node based on the identification number (which can be contained in the service request) of the target service system, thereby being beneficial to quickly determining each forwarding node and improving the determination efficiency of the routing link.
Further, if the IP address of the receiving node receiving the service request and the IP address of the target service system called by the service request belong to the same machine room and the same network segment, forwarding the service request to the target service system based on the IP address of the target service system. In the embodiment of the invention, when the service request is received, whether the IP address of the receiving node receiving the service request and the IP address of the target service system belong to the same machine room and the same network segment can be judged first, if so, the forwarding node is not required to be further determined to carry out route forwarding, but the service request can be directly sent to the target service system, the invalid operation of the subsequent determination of the route link can be avoided, the operation cost is saved, and the data interaction efficiency is improved.
Drawings
FIG. 1 is a flow chart of a route determination method in an embodiment of the invention;
FIG. 2 is a schematic diagram of network connectivity between each node and each service system in an embodiment of the present invention;
FIG. 3 is a flow chart of one embodiment of step S12 of FIG. 1;
FIG. 4 is a partial flow chart of another route determination method in an embodiment of the invention;
FIG. 5 is a schematic diagram of determining an optimal routing link from a plurality of routing links in an embodiment of the present invention;
fig. 6 is a schematic structural diagram of a route determining device according to an embodiment of the present invention.
Detailed Description
As described above, to protect the security and continuity of the key business transaction, each data center/machine room may be divided into a plurality of network segments according to the business requirement, and network isolation may be performed at the same time.
In the prior art, in order to satisfy data interaction between different/heterogeneous service systems of multiple network segments of multiple machine rooms, for a service provider system (hereinafter referred to as a service system), a full connection is often adopted at each node, that is, each node needs to be directly or indirectly connected with all service systems, and this method can bring about the problems of huge network opening, rapid increase of deployment cost and complicated network structure. In addition, because network isolation exists between the service systems crossing the machine room and the network segments, in order to perform data interaction between the service systems crossing the machine room and the network segments, network transfer is realized by means of external equalization equipment or a transfer machine, so that the investment and maintenance cost of the additional equipment are increased, and the network structure is chaotic and complex and is difficult to uniformly manage.
In the embodiment of the invention, whether the IP address of the receiving node receiving the service request and the IP address of the target service system called by the service request belong to the same machine room and the same network segment is judged; if the judgment result is negative, from the receiving node, selecting nodes one by one from adjacent nodes of the current node as forwarding nodes for next forwarding until the IP address of the current node and the IP address of the target service system belong to the same machine room and the same network segment; the adjacent nodes are nodes which belong to the same machine room and/or the same network segment as the current node. Compared with the prior art, in order to meet the data interaction between different service systems in a plurality of machine rooms or a plurality of network segments, network connection is often established between each node (for example, each program node in the ESB) and all service systems, so that the problems of the rapid increase of the cost of network opening, deployment, maintenance and the like and the complicated network structure are brought; in addition, in the prior art, in order to meet the data interaction between the service systems crossing machine rooms and network segments, load balancing equipment or a transfer machine is additionally deployed to realize network transfer, so that the investment and maintenance cost of additional equipment are increased, the network structure is more chaotic and complex, the expansibility is poor, and unified management is difficult; aiming at data interaction among different service systems crossing a machine room or a network segment, the embodiment of the invention selects nodes from adjacent nodes of a current node one by one as forwarding nodes from receiving nodes for receiving service requests until the IP address of the current node (the current node can also be called a target node) and the IP address of the target service system belong to the same machine room and the same network segment, and only needs to select nodes (namely the adjacent nodes) belonging to the same machine room and/or the same network segment with the current node every time the forwarding nodes are determined, so that network connection is not required to be established between each node and the target service system, and network terminal equipment is not required to be additionally configured when the network isolation exists between the service systems crossing the machine room and the network segment, thereby being beneficial to greatly simplifying the network structure and reducing network opening deployment and maintenance cost.
In order to make the above objects, features and advantages of the present invention more comprehensible, embodiments accompanied with figures are described in detail below.
Referring to fig. 1, fig. 1 is a flowchart of a route determining method according to an embodiment of the present invention. The method may include steps S11 to S12:
step S11: judging whether the IP address of a receiving node receiving a service request and the IP address of a target service system called by the service request belong to the same machine room and the same network segment;
step S12: if the judgment result is negative, from the receiving node, selecting nodes one by one from adjacent nodes of the current node as forwarding nodes for next forwarding until the IP address of the current node and the IP address of the target service system belong to the same machine room and the same network segment.
The adjacent nodes are nodes which belong to the same machine room and/or the same network segment as the current node.
In the implementation of step S11, the service request may be sent by a service invocation system, which is relatively speaking to the target service system. In some embodiments, the service invocation system may act as a invoked or requested target business system that may act as a service invocation system that sends business requests.
The service calling system and the target service system can be collectively called as service systems, each service system can be deployed in different machine rooms, and each machine room can have one or more network segments; in addition, the service systems may have isomerism, which may mean that the service systems are developed based on different programming languages, or may be used to implement different functions, etc.
The nodes belonging to the same machine room can be used for indicating that the distance relation between the nodes is close enough, for example, the distances of a plurality of nodes in a geographic space are smaller than a preset distance threshold value, and can also be used for indicating that the connection relation between the nodes is close enough, for example, service requests can be transmitted between the nodes without forwarding through other forwarding nodes or external routing equipment. It is understood that, when the machine room is constructed, the machine room to which each node belongs may be predetermined.
The same network segment may be the IP address and the subnet mask phase and obtain the same network address, for example, in the case that multiple nodes are located in the same local area network.
In some non-limiting embodiments, the business system may be selected from personnel systems, financial systems, and business systems for implementing other functions of the same business, or may be individual business systems of different businesses/institutions having service calls/requests and called/requested relationships.
As a non-limiting example, the nodes may be nodes in an enterprise service bus system (Enterprise Service Bus, ESB), where the ESB system is built according to multiple rooms of an enterprise, in order to ensure disaster recovery or even multiple capabilities of a platform, program nodes are often disposed in different computer room network segments, and each program node may be composed of software and hardware load machines that implement relevant functions. Specifically, ESB is a key part of the infrastructure used in building Service-oriented architecture (Service-OrientedArchitecture, SOA) based solutions, and is a set of infrastructure functions implemented by middleware technology and supporting SOA. The ESB provides functionality to connect new and existing software applications within and across enterprises, enabling interactions between management and monitoring applications with a rich set of functions.
In a specific implementation, the receiving node may be a node in each program node of the ESB, which belongs to the same machine room and/or the same network segment as the service system sending the service request, for example, a node adjacent to and closest to the service system sending the service request.
Further, before judging whether the IP address of the receiving node that receives the service request and the IP address of the target service system called by the service request belong to the same machine room and the same network segment, the method further includes: searching configuration information of the target service system according to the identification number of the target service system contained in the service request so as to acquire an IP address of the target service system; or determining the IP address of the target service system according to the IP address indication information of the target service system contained in the service request; or determining the IP address of the target service system according to the type of the service request.
The identification number may be used to uniquely determine the target service system, for example, may be indication information of the target service system or indication information of an IP address of the target service system.
It should be noted that the above specific method for acquiring/determining the IP address of the target service system is merely a non-limiting example, and in a specific implementation, the IP address of the target service system may be determined by using an existing conventional method.
In the implementation of step S12, if it is determined that the IP address of the receiving node that receives the service request and the IP address of the target service system invoked by the service request do not belong to the same machine room and are the same network segment, the manner of searching the pre-stored routing table in the current node one by one (the receiving node is the current node searched for the first time) from the receiving node is performed, so that one or more nodes can be determined from the neighboring nodes of the current node efficiently and accurately as forwarding nodes for next forwarding. However, each time the indication information of the forwarding node for the next forwarding is not found in the routing table pre-stored in the current node, at least a part of neighboring nodes among the neighboring nodes of the current node may be selected as the forwarding node for the next forwarding. Specifically, according to the needs of specific application scenarios, various factors such as the distance between the nodes, the current load condition of the nodes and the like can be comprehensively considered to select at least a part of adjacent nodes.
Referring to fig. 2, fig. 2 is a schematic diagram of network connectivity between each node and each service system in an embodiment of the present invention. Wherein each node may be a respective program node in the ESB,
there are two rooms A, B, each divided X, Y into two segments. The service system A and the node a are positioned in an X network segment of the machine room A, the service system B and the node B are positioned in a Y network segment of the machine room A, the service system C and the node D are positioned in an X network segment of the machine room B, and the service system D and the node C are positioned in a Y network segment of the machine room B.
In the prior art, in order to meet the data interaction between different service systems in a plurality of machine rooms or a plurality of network segments, network connection (network full-quantity opening) is often established between each node and all service systems, and the method can lead to a complex network structure and can lead to the problem of the rapid increase of the cost of network opening, deployment, maintenance and the like; in addition, in order to meet the data interaction between the service systems (such as the service system A and the service system D) crossing the machine room and the network segments, external routing equipment is additionally deployed to realize network transfer, so that the investment and maintenance cost of the additional equipment are increased, and the network structure is more chaotic and complex, has poor expansibility and is difficult to uniformly manage.
Compared with the prior art, the embodiment of the invention aims at data interaction among different service systems crossing a machine room or a network segment, from a receiving node receiving a service request, nodes are selected from adjacent nodes of a current node one by one as forwarding nodes until the IP address of the current node (the current node can also be called a target node) and the IP address of the target service system belong to the same machine room and the same network segment, and as the forwarding nodes are determined each time, the nodes (namely the adjacent nodes) belonging to the same machine room and/or the same network segment with the current node are selected, and direct network connection between each node and the target service system is not required to be established, for example, when the service system A interacts with the service system D, the nodes a-b-C or the nodes a-D-C are used, connection with the network system C is not required to be established, and network transit equipment (the figure is not required to be additionally configured), so that the network structure is greatly simplified, the network deployment and maintenance cost are reduced, and the interconnection and the service system is convenient to realize.
Referring to fig. 3, fig. 3 is a flowchart of one embodiment of step S12 in fig. 1. At least one part of nodes are provided with a routing table, and the routing table comprises the mapping relation between the indication information of one or more adjacent nodes of the current node and the identification numbers of one or more service systems; from the receiving node, selecting nodes one by one among the adjacent nodes of the current node as forwarding nodes for forwarding next may include steps S31 to S32, and may further include step S33, where no part of the order of execution may be performed between step S32 and step S33, and each step will be described below.
In step S31, whenever a node is selected among the neighboring nodes of the current node, it is searched in the routing table of the current node whether there is an identification number of the service system identical to the identification number of the target service system.
If so, step S32 is performed; if not, step S33 is performed.
In step S32, the adjacent node corresponding to the identification number of the same service system is adopted as the forwarding node for the next forwarding.
As a non-limiting embodiment, the first receiving node for receiving the service request is a node C, the target service system is a node C, and the routing table pre-stored in the node C is:
<interfaceRoute>
<ESB_C>http://a_X_lb/XXX</ESB_C>
<ESB_D>http://b_X_lb/XXX</ESB_D>
<ESB_F>http://b_Y_lb/XXX</ESB_F>
</interfaceRoute>
wherein < interfaceRoute > is used to indicate routing table identification information, < esb_c >, < esb_d >, < esb_f > is used to indicate identification number/number of service system C, D, F, http:// a_x_lb/XXX is used to indicate IP address of node a, and http:// b_y_lb/XXX is used to indicate IP address of node b, respectively.
Since the routing table has the same identification number as the identification number < ESB_C > of the target service system C, the node a indicated by the IP address http:// a_X_lb/XXX is determined to be used as a forwarding node for the next forwarding of the current node C according to the mapping relation between the < ESB_C > and the http:// a_X_lb/XXX.
It can be appreciated that by directly searching the routing table of the current node for determining the forwarding node based on the identification number of the target service system (which may be included in the service request), it is helpful to quickly determine each forwarding node, and the routing link determination efficiency is improved.
In step S33, at least a part of neighboring nodes among neighboring nodes of the current node are selected as forwarding nodes for the next forwarding.
Further, if the IP address of the receiving node receiving the service request and the IP address of the target service system called by the service request belong to the same machine room and the same network segment, forwarding the service request to the target service system based on the IP address of the target service system.
It can be understood that in the embodiment of the present invention, when a service request is received, it may be first determined whether the IP address of the receiving node that receives the service request and the IP address of the target service system belong to the same machine room and the same network segment, and if so, it is not necessary to further determine that the forwarding node performs route forwarding, but the service request may be directly sent to the target service system, so that an invalid operation of determining a route link subsequently may be avoided, operation overhead may be saved, and data interaction efficiency may be improved.
Referring to fig. 4, fig. 4 is a partial flow chart of another route determination method according to an embodiment of the present invention. The other route determination method may include steps S11 to S13 shown in fig. 1, and may further include steps S41 to S44, wherein steps S41 to S44 may be performed after steps S11 to S13, and different contents from those in fig. 1 will be described below.
In step S41, an optimal routing link is determined among the routing links formed from the receiving node to the target node.
In step S42, the service request is forwarded to the target service system via each node on the optimal routing link in turn.
The target node is one or more nodes which belong to the same machine room and the same network segment with the IP address of the target service system.
In the embodiment of the invention, the most suitable optimal routing link can be determined in each routing link formed from the receiving node to the target node according to the requirements of different application scenes. For example, a routing link including the least number of nodes or a routing link having the smallest sum of distances between the respective nodes is selected as the optimal routing link, so that the efficiency of data interaction can be improved as much as possible.
Further, the determining an optimal routing link among the routing links formed from the receiving node to the target node includes: among the routing links formed from the receiving node to the target node, determining the routing links with the number of the included nodes less than or equal to the preset number as standby routing links; determining one or more optimal routing links in the standby routing links; and the service request is sequentially forwarded to the target service system through each node on any one of the optimal routing links.
Referring to fig. 5, fig. 5 is a schematic diagram of determining an optimal routing link from a plurality of routing links in an embodiment of the present invention.
As a non-limiting example, an enterprise has four rooms A, B, C, D, each divided into X, Y two segments. Nodes a and B are respectively positioned on an X network section and a Y network section of the machine room A, nodes C and D are respectively positioned on an X network section and a Y network section of the machine room D, nodes e and f are respectively positioned on an X network section and a Y network section of the machine room C, and nodes g and h are respectively positioned on an X network section and a Y network section of the machine room B.
The service calling party system M of the X network segment of the machine room A needs to access the target service system N of the Y network segment of the machine room C through ESB, and the route forwarding principle is 'same machine room and/or same network segment is prior, cross machine room and cross network segment is forbidden to directly access', namely the same machine room and the same network segment are preferentially routed, cross network segment access is forbidden among different machine rooms, and each node only needs to maintain the routing link of the node.
And the ESB designs a service routing table according to the network relation of the self node and the service system and the routing forwarding principle. In the cross-machine room and cross-network segment interaction process, a plurality of service routes exist, and in the specific implementation, an optimal route link (i.e. a route link passing through the least network nodes can be selected) can be determined with the aim of minimum network resource loss. The specific process of determining the optimal routing link may mainly include the following steps:
(1) Firstly, the IP address of a receiving node a which confirms to receive a service request and the IP address of a target service system N called by the service request do not belong to the same machine room and the same network segment.
(2) From the receiving node a, selecting nodes from adjacent nodes of the current node one by one as forwarding nodes for next forwarding until the IP address of the current node and the IP address of the target service system belong to the same machine room and the same network segment, namely until the current node is the node f.
The adjacent nodes are nodes which belong to the same machine room and/or the same network segment as the current node. For example, if the node belonging to the same machine room and/or the same network segment as the node a includes b, h, b, h may be used as a forwarding node for forwarding next time, then nodes (including c, f, g) belonging to the same machine room and/or the same network segment as the node b are respectively determined, nodes (including g, d, e) belonging to the same machine room and/or the same network segment as the node h are respectively determined, and so on until the current node is the node f (i.e. the target node), thereby forming a plurality of routing links;
The target node f may be a node closest to the target service system N among nodes belonging to the same machine room and having the same network segment as the IP address of the target service system.
(3) And determining the routing links with the number of the included nodes less than or equal to the preset number from all the routing links formed from the receiving node to the target node as standby routing links.
(4) And then selecting one or more routing links with the least nodes from the standby routing links as optimal routing links, namely determining two optimal routing links: a > b > f and a > e > f.
In a specific implementation, an appropriate routing link may be selected from each standby routing link as the optimal routing link according to the needs of a specific application scenario based on other consideration factors, which is not limited in the embodiment of the present invention.
Further, after determining the optimal routing link, the service request may be forwarded to the target service system N sequentially via each node on the optimal routing link.
Further, after determining the optimal routing link, the method further comprises: and for each optimal routing link, updating the mapping relation between the indication information of each node on the optimal routing link and the identification number of the target service system to a routing table of a node before the node.
In the embodiment of the invention, by determining the standby route link, when the optimal link fails, the service request can be forwarded by adopting other route links in the standby route link, so that the function of disaster recovery or multiple activities can be realized. In addition, by determining one or more optimal routing links among the standby routing links (for example, selecting one or more of the standby routing links with the least number of nodes as the optimal routing link), the data interaction efficiency can be improved to the greatest extent.
Still further, at least a portion of the nodes have a routing table containing a mapping between indication information of one or more neighboring nodes of the current node and identification numbers of one or more business systems; after determining the optimal routing link, the method further comprises: and for each optimal routing link, updating the mapping relation between the indication information of each node on the optimal routing link and the identification number of the target service system to a routing table of a node before the node.
In the embodiment of the invention, after the optimal routing link is determined each time, the mapping relation in the routing table of the previous node of each node on the optimal routing link is updated, so that when the step of determining the forwarding nodes of the current node one by one is conveniently executed again later, the forwarding node of the next forwarding can be determined directly by searching the routing table of the current node, the routing link determination efficiency is improved, and the data interaction efficiency is further improved; in addition, since the current node only needs to maintain routing information (e.g., neighbor node IP address + service system identification number) of one or more neighbor nodes, data maintenance and storage costs can be reduced.
Referring to fig. 6, fig. 6 is a schematic diagram of a route determining device according to an embodiment of the present invention. The apparatus may include:
an address judging module 61, configured to judge whether an IP address of a receiving node that receives a service request and an IP address of a target service system invoked by the service request belong to the same machine room and the same network segment;
the routing link determining module 62 is configured to, when the determination result is no, select, from the receiving node, one by one, a node from neighboring nodes of the current node as a forwarding node for forwarding next time until the IP address of the current node and the IP address of the target service system belong to the same machine room and the same network segment;
the adjacent nodes are nodes which belong to the same machine room and/or the same network segment as the current node.
Regarding the principle, implementation and beneficial effects of the route determining device, reference is made to the foregoing and the related descriptions of the route determining method shown in fig. 1 to 4, which are not repeated herein.
The embodiment of the invention also provides a computer readable storage medium, on which a computer program is stored, which when being executed by a processor performs the steps of the above-mentioned route determination method. The computer readable storage medium may include non-volatile memory (non-volatile) or non-transitory memory, and may also include optical disks, mechanical hard disks, solid state disks, and the like.
Specifically, in the embodiment of the present invention, the processor may be a central processing unit (central processing unit, abbreviated as CPU), and the processor may also be other general purpose processors, digital signal processors (digital signalprocessor, abbreviated as DSP), application specific integrated circuits (application specific integrated circuit, abbreviated as ASIC), off-the-shelf programmable gate arrays (fieldprogrammable gate array, abbreviated as FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, and so on. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
It should also be appreciated that the memory in embodiments of the present application may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The nonvolatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an electrically erasable ROM (electrically EPROM, EEPROM), or a flash memory. The volatile memory may be a random access memory (random access memory, RAM for short) which acts as an external cache. By way of example but not limitation, many forms of random access memory (random access memory, abbreviated as RAM) are available, such as static random access memory (static RAM), dynamic Random Access Memory (DRAM), synchronous Dynamic Random Access Memory (SDRAM), double data rate synchronous dynamic random access memory (double datarate SDRAM, abbreviated as DDR SDRAM), enhanced Synchronous Dynamic Random Access Memory (ESDRAM), synchronous Link DRAM (SLDRAM), and direct memory bus random access memory (direct rambus RAM, abbreviated as DR RAM).
The embodiment of the invention also provides a terminal which comprises a memory and a processor, wherein the memory stores a computer program capable of running on the processor, and the processor executes the steps of the route determining method when running the computer program. The terminal can include, but is not limited to, terminal equipment such as a mobile phone, a computer, a tablet computer, a server, a cloud platform, and the like.
It should be understood that the term "and/or" is merely an association relationship describing the associated object, and means that three relationships may exist, for example, a and/or B may mean: a exists alone, A and B exist together, and B exists alone. In this context, the character "/" indicates that the front and rear associated objects are an "or" relationship.
The term "plurality" as used in the embodiments herein refers to two or more.
The first, second, etc. descriptions in the embodiments of the present application are only used for illustrating and distinguishing the description objects, and no order division is used, nor does it indicate that the number of the devices in the embodiments of the present application is particularly limited, and no limitation on the embodiments of the present application should be construed.
It should be noted that the serial numbers of the steps in the present embodiment do not represent a limitation on the execution sequence of the steps.
Although the present invention is disclosed above, the present invention is not limited thereto. Various changes and modifications may be made by one skilled in the art without departing from the spirit and scope of the invention, and the scope of the invention should be assessed accordingly to that of the appended claims.
Claims (10)
1. A method of route determination, comprising:
judging whether the IP address of a receiving node receiving a service request and the IP address of a target service system called by the service request belong to the same machine room and the same network segment;
if the judgment result is negative, from the receiving node, selecting nodes one by one from adjacent nodes of the current node as forwarding nodes for next forwarding until the IP address of the current node and the IP address of the target service system belong to the same machine room and the same network segment;
the adjacent nodes are nodes belonging to the same machine room and/or the same network segment as the current node;
at least one part of nodes are provided with a routing table, and the routing table comprises the mapping relation between the indication information of one or more adjacent nodes of the current node and the identification numbers of one or more service systems; from the receiving node, selecting nodes one by one from adjacent nodes of the current node as forwarding nodes for next forwarding comprises:
Each time a node is selected from adjacent nodes of a current node, searching whether the identification number of the service system which is the same as the identification number of the target service system exists in a routing table of the current node;
and if the routing table of the current node has the same service system identification number as the target service system identification number, adopting the adjacent node corresponding to the same service system identification number as the forwarding node for the next forwarding.
2. The method according to claim 1, wherein the method further comprises:
determining an optimal routing link from each routing link formed from the receiving node to the target node;
forwarding the service request to the target service system sequentially via each node on the optimal routing link;
the target node is one or more nodes which belong to the same machine room and the same network segment with the IP address of the target service system.
3. The method of claim 2, wherein determining the optimal routing link among the routing links formed from the receiving node to the target node comprises:
among the routing links formed from the receiving node to the target node, determining the routing links with the number of the included nodes less than or equal to the preset number as standby routing links;
Determining one or more optimal routing links in the standby routing links;
and the service request is sequentially forwarded to the target service system through each node on any one of the optimal routing links.
4. A method according to claim 2 or 3, wherein after determining the optimal routing link, the method further comprises:
and for each optimal routing link, updating the mapping relation between the indication information of each node on the optimal routing link and the identification number of the target service system to a routing table of a node before the node.
5. The method according to claim 1, wherein the method further comprises:
if not, selecting at least one part of adjacent nodes from the adjacent nodes of the current node as forwarding nodes for next forwarding.
6. The method according to claim 1, wherein the method further comprises:
if the IP address of the receiving node receiving the service request and the IP address of the target service system called by the service request belong to the same machine room and the same network segment, forwarding the service request to the target service system based on the IP address of the target service system.
7. The method of claim 1, wherein prior to determining whether the IP address of the receiving node that received the service request and the IP address of the target service system invoked by the service request belong to the same machine room and the same network segment, the method further comprises:
searching configuration information of the target service system according to the identification number of the target service system contained in the service request so as to acquire an IP address of the target service system;
or,
determining the IP address of the target service system according to the IP address indication information of the target service system contained in the service request;
or,
and determining the IP address of the target service system according to the type of the service request.
8. A route determination device, comprising:
the address judging module is used for judging whether the IP address of the receiving node receiving the service request and the IP address of the target service system called by the service request belong to the same machine room and the same network segment;
the route link determining module is used for selecting nodes from the receiving nodes one by one from adjacent nodes of the current node as forwarding nodes for next forwarding when the judging result is negative until the IP address of the current node and the IP address of the target service system belong to the same machine room and the same network segment;
The adjacent nodes are nodes belonging to the same machine room and/or the same network segment as the current node;
at least one part of nodes are provided with a routing table, and the routing table comprises the mapping relation between the indication information of one or more adjacent nodes of the current node and the identification numbers of one or more service systems;
the routing link determination module further performs:
each time a node is selected from adjacent nodes of a current node, searching whether the identification number of the service system which is the same as the identification number of the target service system exists in a routing table of the current node;
and if the routing table of the current node has the same service system identification number as the target service system identification number, adopting the adjacent node corresponding to the same service system identification number as the forwarding node for the next forwarding.
9. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, performs the steps of the route determination method according to any one of claims 1 to 7.
10. A terminal comprising a memory and a processor, the memory having stored thereon a computer program executable on the processor, characterized in that the processor executes the steps of the route determination method according to any of claims 1 to 7 when the computer program is executed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210894053.7A CN115277864B (en) | 2022-07-27 | 2022-07-27 | Route determining method and device, computer readable storage medium and terminal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210894053.7A CN115277864B (en) | 2022-07-27 | 2022-07-27 | Route determining method and device, computer readable storage medium and terminal |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115277864A CN115277864A (en) | 2022-11-01 |
| CN115277864B true CN115277864B (en) | 2024-01-26 |
Family
ID=83772570
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210894053.7A Active CN115277864B (en) | 2022-07-27 | 2022-07-27 | Route determining method and device, computer readable storage medium and terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115277864B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116418600B (en) * | 2023-06-09 | 2023-08-15 | 安徽华云安科技有限公司 | Node security operation and maintenance method, device, equipment and storage medium |
Citations (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1578086A1 (en) * | 2004-03-19 | 2005-09-21 | Sony International (Europe) GmbH | Addressing mechanism for nodes in a communication system |
| CN1913485A (en) * | 2005-08-11 | 2007-02-14 | 中兴通讯股份有限公司 | Method of automatic detection topology, set-up route table and implementing narrow-band service |
| EP1968257A2 (en) * | 2002-09-11 | 2008-09-10 | Microsoft Corp. | Methods for storing a file on a node of an overlay network |
| CN101540718A (en) * | 2008-03-18 | 2009-09-23 | 中国移动通信集团公司 | Method and device for realizing intercommunication of port service in local area network and local area network |
| CN102055814A (en) * | 2010-11-25 | 2011-05-11 | 深圳市科陆电子科技股份有限公司 | Method for realizing cross-network segment real-time collection |
| CN102710457A (en) * | 2012-05-07 | 2012-10-03 | 浙江宇视科技有限公司 | N+1 backup method and device of cross-network segment |
| CN105245632A (en) * | 2015-10-16 | 2016-01-13 | 电子科技大学 | Communication method between hosts in different network segments in SDN network |
| EP3334126A1 (en) * | 2016-12-07 | 2018-06-13 | Virtuosys Limited | Router node, network and method to allow service discovery in a network |
| CN109361558A (en) * | 2018-12-19 | 2019-02-19 | 上海智格网通信科技有限公司 | Distributed wireless ad hoc network management method based on grid network proxy for equipment node |
| CN109450694A (en) * | 2018-11-26 | 2019-03-08 | 武汉烽火信息集成技术有限公司 | Multinode isomery operation management method and system based on autonomous controllable software and hardware |
| CN109729190A (en) * | 2019-03-15 | 2019-05-07 | 深圳前海微众银行股份有限公司 | Network Access Method, system, equipment and computer readable storage medium |
| CN110266763A (en) * | 2019-05-20 | 2019-09-20 | 深圳壹账通智能科技有限公司 | Block chain network implementation method, system and the storage medium of cross-network segment interconnection |
| CN110557336A (en) * | 2019-09-17 | 2019-12-10 | 中国人民解放军战略支援部队信息工程大学 | Addressing routing method and system |
| CN111435948A (en) * | 2019-01-12 | 2020-07-21 | 华为技术有限公司 | Method for transmitting message in network and network equipment |
| CN113810230A (en) * | 2021-09-16 | 2021-12-17 | 广州虎牙科技有限公司 | Method, device and system for carrying out network configuration on containers in container cluster |
| CN113806066A (en) * | 2021-04-06 | 2021-12-17 | 京东科技控股股份有限公司 | Big data resource scheduling method, system and storage medium |
| CN114172802A (en) * | 2021-12-01 | 2022-03-11 | 百果园技术(新加坡)有限公司 | Container network configuration method and device, computing node, main node and storage medium |
| CN114398176A (en) * | 2022-01-04 | 2022-04-26 | 北京金山云网络技术有限公司 | Service access method, device, electronic equipment and storage medium |
| CN114513449A (en) * | 2022-02-23 | 2022-05-17 | 北京慧橙信息科技有限公司 | Method and system for optimizing routing in domain |
| CN114650254A (en) * | 2021-12-10 | 2022-06-21 | 中国联合网络通信集团有限公司 | Method and device for determining service path and computer readable storage medium |
-
2022
- 2022-07-27 CN CN202210894053.7A patent/CN115277864B/en active Active
Patent Citations (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1968257A2 (en) * | 2002-09-11 | 2008-09-10 | Microsoft Corp. | Methods for storing a file on a node of an overlay network |
| EP1578086A1 (en) * | 2004-03-19 | 2005-09-21 | Sony International (Europe) GmbH | Addressing mechanism for nodes in a communication system |
| CN1913485A (en) * | 2005-08-11 | 2007-02-14 | 中兴通讯股份有限公司 | Method of automatic detection topology, set-up route table and implementing narrow-band service |
| CN101540718A (en) * | 2008-03-18 | 2009-09-23 | 中国移动通信集团公司 | Method and device for realizing intercommunication of port service in local area network and local area network |
| CN102055814A (en) * | 2010-11-25 | 2011-05-11 | 深圳市科陆电子科技股份有限公司 | Method for realizing cross-network segment real-time collection |
| CN102710457A (en) * | 2012-05-07 | 2012-10-03 | 浙江宇视科技有限公司 | N+1 backup method and device of cross-network segment |
| CN105245632A (en) * | 2015-10-16 | 2016-01-13 | 电子科技大学 | Communication method between hosts in different network segments in SDN network |
| EP3334126A1 (en) * | 2016-12-07 | 2018-06-13 | Virtuosys Limited | Router node, network and method to allow service discovery in a network |
| CN109450694A (en) * | 2018-11-26 | 2019-03-08 | 武汉烽火信息集成技术有限公司 | Multinode isomery operation management method and system based on autonomous controllable software and hardware |
| CN109361558A (en) * | 2018-12-19 | 2019-02-19 | 上海智格网通信科技有限公司 | Distributed wireless ad hoc network management method based on grid network proxy for equipment node |
| CN111435948A (en) * | 2019-01-12 | 2020-07-21 | 华为技术有限公司 | Method for transmitting message in network and network equipment |
| CN109729190A (en) * | 2019-03-15 | 2019-05-07 | 深圳前海微众银行股份有限公司 | Network Access Method, system, equipment and computer readable storage medium |
| CN110266763A (en) * | 2019-05-20 | 2019-09-20 | 深圳壹账通智能科技有限公司 | Block chain network implementation method, system and the storage medium of cross-network segment interconnection |
| CN110557336A (en) * | 2019-09-17 | 2019-12-10 | 中国人民解放军战略支援部队信息工程大学 | Addressing routing method and system |
| CN113806066A (en) * | 2021-04-06 | 2021-12-17 | 京东科技控股股份有限公司 | Big data resource scheduling method, system and storage medium |
| CN113810230A (en) * | 2021-09-16 | 2021-12-17 | 广州虎牙科技有限公司 | Method, device and system for carrying out network configuration on containers in container cluster |
| CN114172802A (en) * | 2021-12-01 | 2022-03-11 | 百果园技术(新加坡)有限公司 | Container network configuration method and device, computing node, main node and storage medium |
| CN114650254A (en) * | 2021-12-10 | 2022-06-21 | 中国联合网络通信集团有限公司 | Method and device for determining service path and computer readable storage medium |
| CN114398176A (en) * | 2022-01-04 | 2022-04-26 | 北京金山云网络技术有限公司 | Service access method, device, electronic equipment and storage medium |
| CN114513449A (en) * | 2022-02-23 | 2022-05-17 | 北京慧橙信息科技有限公司 | Method and system for optimizing routing in domain |
Non-Patent Citations (2)
| Title |
|---|
| "IP RAN技术研究及应用";张志超;《南京邮电大学硕士学位论文》;参见第31-50页 * |
| 张志超."IP RAN技术研究及应用".《南京邮电大学硕士学位论文》.2013,参见第31-50页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115277864A (en) | 2022-11-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11050586B2 (en) | Inter-cloud communication method and related device, and inter-cloud communication configuration method and related device | |
| CN108650182B (en) | Network communication method, system, device, equipment and storage medium | |
| US9722867B2 (en) | Resource management method, resource management system and resource manager | |
| CN110554927A (en) | Micro-service calling method based on block chain | |
| CN112003961A (en) | Resource exposure method, system, equipment and medium in kubernets | |
| US7369505B2 (en) | Method and system to efficiently manage network connection to connect a client and a resource | |
| CN112350918B (en) | Service traffic scheduling method, device, equipment and storage medium | |
| WO2020057445A1 (en) | Communication system, method, and device | |
| CN115277864B (en) | Route determining method and device, computer readable storage medium and terminal | |
| WO2021139304A1 (en) | Method and device for multi-cloud interconnection | |
| CN113839862A (en) | Method, system, terminal and storage medium for synchronizing ARP information between MCLAG neighbors | |
| CN107547374B (en) | Aggregation route processing method and device | |
| CN108352997B (en) | Extending cloud aggregation points in a hierarchical distributed manner | |
| US11689943B2 (en) | Network function redundancy using binding header enhancements | |
| CN108366087B (en) | ISCSI service realization method and device based on distributed file system | |
| US20190387054A1 (en) | Method, electronic device and computer program product for searching for node | |
| US20190190813A1 (en) | Method for Synchronizing Topology Information in SFC Network, and Routing Network Element | |
| US20200244517A1 (en) | Access Point Instantiation of a Mesh Network | |
| CN109981437B (en) | Multi-data center intercommunication method based on VPC and related equipment | |
| CN110995502B (en) | Network configuration management method, device, switching equipment and readable storage medium | |
| CN113904973A (en) | Route updating method, medium, device and computing equipment | |
| CN114760360A (en) | Request response method and device, electronic equipment and computer readable storage medium | |
| US11973688B2 (en) | Control apparatus, network control method and program | |
| CN115460067B (en) | Method and system for high availability enhancement to computer networks | |
| CN102420716A (en) | Detection processing method and device for host computer confliction and network device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |