CN110932981B - Data exchange system supporting automatic routing - Google Patents

Data exchange system supporting automatic routing Download PDF

Info

Publication number
CN110932981B
CN110932981B CN201911182744.9A CN201911182744A CN110932981B CN 110932981 B CN110932981 B CN 110932981B CN 201911182744 A CN201911182744 A CN 201911182744A CN 110932981 B CN110932981 B CN 110932981B
Authority
CN
China
Prior art keywords
node
routing
information
route
switching
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
Application number
CN201911182744.9A
Other languages
Chinese (zh)
Other versions
CN110932981A (en
Inventor
易存道
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Baolande Software Co ltd
Original Assignee
Beijing Baolande Software Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Baolande Software Co ltd filed Critical Beijing Baolande Software Co ltd
Priority to CN201911182744.9A priority Critical patent/CN110932981B/en
Publication of CN110932981A publication Critical patent/CN110932981A/en
Application granted granted Critical
Publication of CN110932981B publication Critical patent/CN110932981B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/25Routing or path finding in a switch fabric
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/74Address processing for routing

Abstract

The embodiment of the invention provides a data exchange system supporting automatic routing, which comprises: the system comprises a console, a management node communicated with the console and a plurality of switching nodes hierarchically deployed under the management node; the console issues task instruction information; the management node and the switching node determine a routing path according to the parent-child relationship information and the routing configuration information, and send the task information to the target node according to the routing path; and the target node executes the corresponding task after receiving the task information, reports the task execution result to the management node step by step from the father node and finally reports to the console. The data exchange system supporting automatic routing provided by the embodiment of the invention realizes automatic routing generation, improves the data exchange efficiency and the automation level of data sharing and supports personalized routing configuration by determining the routing path of data forwarding according to the parent-child relationship information and the routing configuration information.

Description

Data exchange system supporting automatic routing
Technical Field
The invention relates to the technical field of communication, in particular to a data exchange system supporting automatic routing.
Background
With the continuous development of the information age, the information exchange of different departments and different regions is gradually increased, and the development of the computer network technology provides guarantee for information transmission and data sharing. Data sharing is to enable users who use different computers and different software in different places to read data of others and perform various operations, operations and analyses. The data sharing is realized, more people can fully use the existing data resources, the repeated labor and corresponding cost of data collection, data acquisition and the like are reduced, and the attention is focused on developing new application programs and system integration. Data sharing is realized through data exchange, the problem of data isolated island can be solved, the division and region gap are broken, and information sharing is realized.
However, conventional data exchange or data sharing is typically implemented through an interface or data exchange software. No matter the interface or the data exchange software, the automatic routing is not supported, so that the efficiency of data exchange is influenced, and the automation level of data sharing is reduced.
Disclosure of Invention
To solve the problems in the prior art, an embodiment of the present invention provides a data exchange system supporting automatic routing, including: console consoles and nodes; the nodes comprise a management node in communication connection with the console of the console and a plurality of switching nodes hierarchically deployed under the management node; wherein the number of switching nodes of each level is at least one; each of the switching nodes has a unique parent node; the management node and the switching node store node configuration information of all nodes configured by the console of the console and route configuration information of the node; the node configuration information comprises parent-child relationship information; the console is used for issuing task instruction information, and the task instruction information comprises task information and information of a target node for executing a task; the management node and the switching node are used for determining a routing path according to the parent-child relationship information and the routing configuration information, and sending the task information to the target node according to the routing path; and the target node is used for executing a corresponding task according to the task information after receiving the task information, reporting a task execution result to the management node step by step from the father node, and reporting the management node to the console of the console.
Further, when the management node and the switching node are configured to determine a routing path according to the parent-child relationship information and the routing configuration information, the management node and the switching node are specifically configured to: determining a first forwarding route according to the parent-child relationship information; judging whether the node stores the routing configuration information from the node to the target node; if yes, determining a second forwarding route according to the route configuration information; acquiring a first route path length of the first forwarding route and acquiring a second route path length of the second forwarding route; and determining the routing path according to the first routing path length and the second routing path length.
Further, the determining the routing path according to the first routing path length and the second routing path length includes: if the length of the second route path is shorter than the length of the first route path, determining the second forwarding route as the route path; otherwise, the first forwarding route is determined as the routing path.
Further, the determining a first forwarding route according to the parent-child relationship information includes: acquiring the relation between a destination node and a source node; the source node is the management node or the switching node which currently sends the task information, and the destination node is the management node or the switching node which currently receives the task information; if the destination node and the source node are parent-child nodes, directly taking a path from the source node to the destination node as the first forwarding route; and if the destination node and the source node are not parent-child nodes, acquiring a relationship type between the destination node and the source node, and determining the first forwarding route according to the relationship type.
Further, the determining the first forwarding route according to the relationship type includes: if the destination node is an ancestor node of the source node, determining the first forwarding route by sequentially searching father nodes; if the destination node is a descendant node of the source node, determining the first forwarding route by sequentially searching the descendant nodes; and if the destination node and the source node have a common father node, determining the first forwarding route by searching the common father node.
Further, the determining the first forwarding route by looking up the common parent node includes: searching and determining the common father node; and calculating an upward forwarding route from the source node to the common father node, and calculating a downward forwarding route from the common father node to the destination node, wherein the upward forwarding route and the downward forwarding route form the first forwarding route.
Further, the node configuration information further includes IP address information and port information; and the management node and the switching node send the task information or the task execution result to the next node according to the IP address information and the port information.
Further, the target node is also used for warehousing and storing the task execution result.
Further, the console of the console is also used for node topology display.
Further, if the switching node is a cross-network node, the switching node is deployed on a front-end processor.
The data exchange system supporting automatic routing, which comprises the console, the management node and the plurality of exchange nodes arranged in a layered mode, realizes automatic routing generation by determining the routing path of data forwarding according to the parent-child relationship information and the routing configuration information, improves the data exchange efficiency and the automation level of data sharing, and supports personalized routing configuration.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a schematic structural diagram of a data switching system supporting automatic routing according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a switching node in a data switching system supporting automatic routing according to an embodiment of the present invention;
fig. 3 is a flowchart of a node routing algorithm of a data switching system supporting automatic routing according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a data switching system supporting automatic routing according to another embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Fig. 1 is a schematic structural diagram of a data switching system supporting automatic routing according to an embodiment of the present invention. As shown in fig. 1, the system includes a console 1 and nodes; the nodes comprise a management node 2 which is in communication connection with the console 1 of the console and a plurality of switching nodes 3 which are hierarchically deployed under the management node; wherein the number of switching nodes 3 of each level is at least one; each of the switching nodes 3 has a unique parent node; the management node 2 and the switching node 3 store node configuration information of all nodes configured by the console of the console and route configuration information of the node; the node configuration information comprises parent-child relationship information; the console 1 is configured to issue task instruction information, where the task instruction information includes task information and information of a target node that executes a task; the management node 2 and the switching node 3 are configured to determine a routing path according to the parent-child relationship information and the routing configuration information, and send the task information to the target node according to the routing path; and the target node is used for executing a corresponding task according to the task information after receiving the task information, reporting a task execution result to the management node 2 step by step from a father node, and reporting the management node 2 to the console 1.
The console 1 is a web management end, and a user performs task configuration, command issuing and task result data viewing through the console 1, and meanwhile, the console 1 supports node information configuration and node routing configuration, and can also support operations such as node topology display. The console 1 communicates only with the management node 2.
The nodes are executors of data exchange tasks, execute actual data exchange tasks, and are divided into management nodes 2 and switching nodes 3. All node configuration information, routing information related to the node, task information (which may be stored only by the node performing the task), and the like are stored on the node.
One set of system only has one management node 2, the console 1 of the console communicates with the management node 2, realize the task, order and issue and obtain the task data reported and demonstrate through the management node 2; the management node 2 only communicates with its direct child node and does not communicate with the subordinate nodes of its child node; the management node 2 is also responsible for forwarding data.
The switching node 3 is a node other than the management node 2, and is mainly responsible for executing data switching tasks and reporting execution results, and is only in communication with a parent node and a child node thereof directly by default, and if the node is configured with routing information, the node can be in communication with a corresponding node according to the configured route. The switching node may have subordinate children, and its children may also persist. The switching nodes can be deployed in multiple levels and are easy to expand.
The console 1 is configured to configure node configuration information of all nodes, where the node configuration information includes parent-child relationship information. The management node 2 and the switching node 3 each store node configuration information of all the nodes. The console 1 is also used for configuring the routing configuration information of part of the switching nodes to perform personalized node routing configuration. Some nodes have fixed communication modes, for example, the management node 2 only communicates with its direct child node, so the management node 2 may not be configured with node routing. And if some nodes do not support personalized route configuration, the node route configuration is not needed. The node configured for node routing stores routing configuration information including specific configured routing information, for example, which path the node can transmit data to a certain switching node. And the stored routing configuration information of the nodes which do not carry out node routing configuration is empty.
The console 1 is configured to issue task instruction information, where the task instruction information includes task information and information of a target node that executes a task. The task instruction information issued by the console 1 is first transmitted to the management node 2, and then is forwarded layer by layer until reaching the target node executing the task. The path from the management node 2 to the destination node may be referred to as a routing path, and the management node 2 and the switching node 3 on the routing path determine the routing path according to the parent-child relationship information and the routing configuration information. The management node 2 and each switching node 3 on the routing path determine the route from the node to the target node according to the parent-child relationship information and the route configuration information, so as to forward data to the next node, thereby sequentially determining each step on the routing path.
Because a route can be determined according to the parent-child relationship information and a route can also be determined according to the route configuration information, specifically, the selection of the route path can be determined according to a set rule, for example, according to the value of a certain performance parameter.
Of course, when the management node 2 and each switching node 3 on the routing path determine a route from the local node to the target node according to the parent-child relationship information and the routing configuration information, if the routing configuration information is empty, or the routing configuration information does not configure routing information from the local node to the target node, the routing configuration information is negligible, and the corresponding route is determined only according to the parent-child relationship information.
After the routing path is determined, the management node 2 and the switching node 3 send the task information to the target node according to the routing path. And after receiving the task information, the target node executes a corresponding task according to the task information to obtain a task execution result. Since each switching node has a unique father node, when data is returned, the target node only needs to report the task execution result to the management node 2 from the father node step by step, and the management node reports to the console 1.
In the embodiment of the present invention, if no special description is provided, the parent node and the child node both refer to an directly subordinate parent node and an directly subordinate child node, that is, a parent node and a child node which are directly connected.
The data exchange system supporting automatic routing, which comprises the console, the management node and the plurality of exchange nodes arranged in a layered mode, realizes automatic routing generation by determining the routing path of data forwarding according to the parent-child relationship information and the routing configuration information, improves the data exchange efficiency and the automation level of data sharing, and supports personalized routing configuration.
Further, based on the above embodiment, when the management node 2 and the switching node 3 are configured to determine a routing path according to the parent-child relationship information and the routing configuration information, the management node is specifically configured to: determining a first forwarding route according to the parent-child relationship information; judging whether the node stores the routing configuration information from the node to the target node; if yes, determining a second forwarding route according to the route configuration information; acquiring a first route path length of the first forwarding route and acquiring a second route path length of the second forwarding route; and determining the routing path according to the first routing path length and the second routing path length.
And when the management node 2 and the switching node 3 are used for determining a routing path according to the parent-child relationship information and the routing configuration information, determining a first forwarding route according to the parent-child relationship information. Then, whether the node stores the routing configuration information from the node to the target node is judged. And if the routing configuration information from the node to the target node is not stored in the node or the routing configuration information is null, taking the first forwarding route as the routing path. And if the node stores the route configuration information from the node to the target node, determining a second forwarding route according to the route configuration information. The second forwarding route may be derived directly from the route configuration information. And acquiring the first route path length of the first forwarding route and acquiring the second route path length of the second forwarding route. And determining the routing path according to the first routing path length and the second routing path length. For example, the shorter routing path length is used as the routing path.
On the basis of the above embodiment, in the embodiment of the present invention, the first forwarding route is determined according to the parent-child relationship information, the second forwarding route is determined according to the routing configuration information, the routing path is determined according to the routing path lengths of the first forwarding route and the second forwarding route, automatic selection of the routing is performed when data forwarding is performed, route information with a more optimized path is automatically selected, and the data forwarding rate is increased.
Further, based on the above embodiment, the determining the routing path according to the first routing path length and the second routing path length includes: if the length of the second route path is shorter than the length of the first route path, determining the second forwarding route as the route path; otherwise, the first forwarding route is determined as the routing path.
And if the routing path length of the second forwarding route determined according to the routing configuration information is smaller, determining the second forwarding route as the routing path. And if the routing path length of the first forwarding route determined according to the parent-child relationship information is smaller, or the routing path length of the second forwarding route determined according to the routing configuration information is equal to the routing path length of the first forwarding route determined according to the parent-child relationship information, taking the first forwarding route determined according to the parent-child relationship information as the routing path.
On the basis of the above embodiment, in the embodiment of the present invention, when the length of the second routing path is shorter than the length of the first routing path, the second forwarding route is determined as the routing path, so that the rationality of determining the routing path is further improved, and the data exchange efficiency is improved.
Further, based on the above embodiment, the determining a first forwarding route according to the parent-child relationship information includes: acquiring the relation between a destination node and a source node; the source node is the management node or the switching node which currently sends the task information, and the destination node is the management node or the switching node which currently receives the task information; if the destination node and the source node are parent-child nodes, directly taking a path from the source node to the destination node as the first forwarding route; and if the destination node and the source node are not parent-child nodes, acquiring a relationship type between the destination node and the source node, and determining the first forwarding route according to the relationship type.
Determining a first forwarding route according to the parent-child relationship information, including: acquiring the relation between a destination node and a source node; the source node is the management node or the switching node which currently sends the task information, and the destination node is the management node or the switching node which currently waits to receive the task information. I.e. data is sent from the source node to the destination node. If the destination node and the source node are direct parent-child nodes, directly taking a path from the source node to the destination node as the first forwarding route; and if the destination node and the source node are not parent-child nodes, acquiring a relationship type between the destination node and the source node, and determining the first forwarding route according to the relationship type.
On the basis of the embodiment, the embodiment of the invention directly forwards data when the source node and the destination node are parent and child nodes; and when the source node and the destination node are not parents and children, determining the first forwarding route according to the relationship type, thereby realizing the rapid determination of the first forwarding route.
Further, based on the above embodiment, the determining the first forwarding route according to the relationship type includes: if the destination node is an ancestor node of the source node, determining the first forwarding route by sequentially searching father nodes; if the destination node is a descendant node of the source node, determining the first forwarding route by sequentially searching the descendant nodes; and if the destination node and the source node have a common father node, determining the first forwarding route by searching the common father node.
And when the first forwarding route is determined according to the relationship type, if the destination node is an ancestor node of the source node, sequentially searching father nodes to determine the first forwarding route. Since the switching node 3 has a unique parent node, if the destination node is an ancestor node of the source node, the first forwarding route can be determined by searching the parent node layer by layer. If the destination node is a descendant node of the source node, the first forwarding route is determined by sequentially searching the child nodes, and the searched child nodes can be sequentially searched and determined through parent-child relationship information, so that the first forwarding route is determined. If the destination node and the source node have a common father node, that is, are not ancestor nodes or descendant nodes, and are sibling nodes or other nodes having a common father node, the first forwarding route is determined according to the common father node by searching the common father node. Wherein the common parent node comprises an directly-affiliated common parent node and a non-directly-affiliated common parent node.
On the basis of the above embodiments, the embodiments of the present invention implement reliable acquisition of the first forwarding route by determining the first forwarding route for each relationship type of the source node and the destination node.
Further, based on the above embodiment, the determining the first forwarding route by searching the common parent node includes: searching and determining the common father node; and calculating an upward forwarding route from the source node to the common father node, and calculating a downward forwarding route from the common father node to the destination node, wherein the upward forwarding route and the downward forwarding route form the first forwarding route.
When the common father node is searched for and the first forwarding route is determined, the common father node is searched for and determined according to the father-son relationship information. And if the common father node is used as an ancestor node or a directly-subordinate father node of the source node, sequentially searching the father nodes to determine an upward forwarding route from the source node to the common father node. And the destination node is used as a direct child node or a descendant node of the common father node, and the downward forwarding route from the common father node to the destination node is determined by sequentially searching child nodes. And the first forwarding route is formed by the upward forwarding route and the downward forwarding route.
On the basis of the above embodiment, in the embodiment of the present invention, the upward forwarding route from the source node to the common parent node and the downward forwarding route from the common parent node to the destination node are calculated, so as to obtain the first forwarding route, thereby further improving the reliability of obtaining the first forwarding route.
Further, based on the above embodiment, the node configuration information further includes IP address information and port information; and the management node and the switching node send the task information or the task execution result to the next node according to the IP address information and the port information.
The corresponding switching node 3 can be found through the IP address, the switching node is usually a server, and there are many ports for the server, and each application program corresponds to one port, so that after the corresponding switching node 3 is found through the IP address, actual access can be performed through the port, and data forwarding, data exchange and sharing are realized.
Therefore, the node configuration information further includes IP address information and port information; and the management node and the switching node send the task information or the task execution result to the next node according to the IP address information and the port information, so that data forwarding, data switching and sharing are realized.
On the basis of the above embodiments, the embodiments of the present invention provide a premise for realizing actual data forwarding by making the node configuration information further include IP address information and port information.
In the data exchange system supporting automatic routing provided in the embodiment of the present invention, the data exchange process may include the following steps:
1. a console, a management node and a switching node are deployed (the switching node can have multiple layers and is deployed according to needs, and for the cross-network node, the switching node is deployed on a front-end processor thereof).
And 2, the console terminal establishes node information (mainly comprising deployment information IP, ports, parent-child relations and the like of the nodes) according to the deployed nodes.
3. And initializing the nodes, namely sending an initialization instruction of a designated node to the management node through the console, and sending the instruction to the designated node by the management node (the management node sends the instruction to the directly subordinate child node thereof, and if the directly subordinate child node is not the node needing initialization, the directly subordinate child node continues to forward the instruction downwards until the node needing initialization is found, so that the node which is successfully initialized can be normally used).
4. And maintaining data source information of the corresponding node and exchanging tasks at the console end. The data source information refers to data source information set by the exchange task.
5. Issuing a task instruction, executing a data exchange task, wherein the data exchange task is only executed on a node to which the task belongs, and nodes to which the non-task belongs only undertake the forwarding work of the instruction; and after receiving the task instruction, the node executing the task starts to execute the task, the result is finally reported to the father node of the node, and the father node reports the result step by step until the result is reported to the management node.
And 6, configuring the node route at the console end, customizing the personalized node route, meeting the exchange requirements of different scenes, and after the console end route is successfully configured, sending the route information to the related nodes below the console end route through the management node for storage.
Fig. 2 is a schematic structural diagram of a switching node in a data switching system supporting automatic routing according to an embodiment of the present invention. The switching node may be divided into different modules to implement its functions. As shown in fig. 2, the main functional structure modules of the switching node are:
1. a node storage module:
all node configuration information, routing information related to the node, task information and the like are stored on the node.
2. A configuration information analysis module:
the method is mainly used for analyzing the configuration information of the nodes, acquiring the execution task information and the routing configuration information and the like.
3. A data processing module:
and the data acquisition task of the source node and the data transmission task of the destination node are completed, and the nodes do not store the exchange data.
4. A route calculation module:
the routing configuration information used for forwarding the computing nodes obtains the shortest routing information according to the default routing and the configured routing, and improves the data transmission efficiency.
5. A task scheduling module:
for performing tasks, data warehousing, etc., according to the task configuration.
Fig. 3 is a flowchart of a node routing algorithm of a data switching system supporting automatic routing according to an embodiment of the present invention. As shown in fig. 3, first, route configuration information is obtained, whether a route is configured is determined, and if yes, the configured route is utilized; if not, acquiring the relationship between the destination node and the source node, judging whether the destination node and the source node are parent and child nodes, and if so, directly forwarding the data; if not, the relationship type between the destination node and the source node is further judged. If the destination node is an ancestor node of the source node, determining the route from the source node to the destination node by sequentially searching father nodes; if the destination node is a descendant node of the source node, determining the route from the source node to the destination node by sequentially searching the descendant nodes; if the destination node and the source node have a common father node, the route from the source node to the common father node is determined by searching the father node, and the route from the common father node to the destination node is determined by searching the child node, so that the route from the source node to the destination node is determined.
Fig. 4 is a schematic structural diagram of a data switching system supporting automatic routing according to another embodiment of the present invention. For convenience of explanation, switching nodes belonging to the child nodes of switching node a are denoted by a child node 1 and a child node 2, switching nodes belonging to the child nodes of switching node B are denoted by B child node 1 and B child node 2, and switching nodes belonging to the child nodes of switching node C are denoted by C child node 1 and C child node 2. Routing information which represents an access path from a source node to a destination node can be configured for the exchange node in a personalized way at a console management terminal. When the switching node finishes data collection and data forwarding, the switching node automatically forwards data according to the routing information of the node, and the following further exemplifies the adopted routing algorithm with reference to fig. 4 as follows:
1. and (3) a routing algorithm between the exchange node and the direct-belonging parent-child node or the grandchild node and the descendant node is as follows:
and (4) default routing:
a. the destination node is a directly-subordinate father node or a directly-subordinate child node
After the source node finishes data acquisition, the source node needs to send acquired data to a destination end, the source node needs to judge whether the destination node is a direct child node or a direct father node of the source node, the direct child node and the direct father node can be directly forwarded, the number of transit nodes is 0, the path is shortest, and the length of the routing path is 1.
For example, the data exchange between the sub-node A1 and the switching node A in the structure diagram of the switching system, and the route path length is 1.
b. The destination node is a descendant or ancestor node of the source node:
the source node is required to find out the corresponding destination node downwards or upwards, and the number of the crossed child nodes or parent nodes is the number of the transit nodes, for example, n, and then the routing path length is n.
For example, data exchange between the a child node 1 and the management node in the structure diagram of the switching system, the default data exchange routing path is: the A child node 1- > the switching node A- > the management node, and the routing path length is 2.
And (3) route configuration:
a. the destination node is a directly-subordinate child node or a directly-subordinate father node of the source node:
the routing is directly forwarded without judging whether the routing exists, and the routing path of the directly subordinate node is shortest;
b. the destination node is a descendant or ancestor node of the source node:
firstly, the length n of a default routing path is calculated, then a routing path m is calculated according to the configured routing, and then the routing configuration information required to be forwarded is automatically obtained according to the sizes of n and m.
For example, data exchange between the a child node 1 and the management node in the structure diagram of the switching system, the default data exchange routing path is: a child node 1- > exchange node A- > management node, and the default routing path length is 2; if the route from the A child node to the management node is configured, the new route path may be: and the A child node 1- > is a management node, the route path length is 1, and the path length is better than the default route, so that the data can be forwarded according to the configured route during data forwarding.
2. Routing algorithm among nodes at the same level:
and (4) default routing:
A. common parent node with direct membership:
and after the data is acquired by the source node, the data is sent to the directly-subordinate father node of the source node, the directly-subordinate father node forwards the data to the target brother node, the route only passes through the father node, and the route path is 2.
For example, data exchange between the a child node 1 and the a child node 2 in the structure diagram of the switching system, the default data exchange routing path is: a child node 1- > exchange node A- > A child node 2, the default routing path length is 2.
B. Non-directly subordinate father node:
the source node end firstly calculates a required data forwarding routing path, and the specific calculation method is as follows:
the source node finds a father node which is common with the destination node (if the source node does not have the common father node, the management node is the common father node of the related node) according to the node configuration information stored by the source node, for example, the routing path from the source node to the father node is n; and then the common father node acquires the routing path m of the destination node according to the node configuration information and the destination node information stored in the common father node, and the routing path from the source node to the destination node is (n + m).
For example, in the data exchange between the a child node 1 and the B child node 2 in the structure diagram of the switching system, if the common parent node is the management node, the route from the a child node 1 to the management node is calculated as follows: the A child node 1- > the exchange node A- > the management node, and the routing path is 2; the route from the management node to the B child node 2 is recalculated as follows: management node- > switch node B- > B child node 2, the length of the routing path is 2, and the default data switch routing path between the a child node 1 and the B child node 2 is: the A child node 1- > switching node A- > management node- > switching node B- > B child node 2, and the default routing path length is 4.
And (3) route configuration:
A. common parent node with direct membership:
if the routing information is configured between the source node and the destination node, the routing path from the source node to the destination node is 1, the default routing path algorithm is the same as the above case, and is 2, and then the route with the shorter path can be automatically selected for data forwarding during data forwarding.
For example, data exchange between the a child node 1 and the a child node 2 in the structure diagram of the switching system, the default data exchange routing path is: a child node 1- > exchange node A- > A child node 2; if the route from the A child node to the A child node 2 is configured, the new route path may be the A child node 1- > A child node 2, and the path length is better than the default route, and the data is forwarded according to the configured route when the data is forwarded.
B. Non-directly subordinate father node:
a source node end firstly calculates a default routing path, and according to a routing algorithm of a non-directly-subordinate father node in the default routing, the routing algorithm is n for example; then, when the configured routing path is m according to the configured node routing calculation, the shortest path is automatically selected for data forwarding according to the sizes of n and m during data forwarding; and if n and m are equal, namely the lengths of the configured routing path and the default routing path are equal, the default routing path is adopted by default for forwarding the data information.
For example, in the data exchange between the a child node 1 and the B child node 2 in the structure diagram of the switching system, if the common parent node is the management node, the route from the a child node 1 to the management node is calculated as follows: the A child node 1- > the exchange node A- > the management node, and the routing path is 2; the route from the management node to the B child node 2 is recalculated as follows: management node- > switch node B- > B child node 2, the length of the routing path is 2, and the default data switch routing path between the a child node 1 and the B child node 2 is: the A child node 1- > the switching node A- > the management node- > the switching node B- > the B child node 2, and the default routing path length is 4; if the A child node to B child node 2 route is configured, the new routing path may be: the A child node 1- > B child node 2 has a route path length of 1, and the path length is better than the default route, so that the data can be forwarded according to the configured route during data forwarding.
3. Routing algorithm among nodes in different levels:
and (4) default routing:
the source node end firstly calculates a required data forwarding routing path, and the specific calculation method is as follows:
the source node finds a father node which is common with the destination node (if the source node does not have the common father node, the management node is the common father node of the related node) according to the node configuration information stored by the source node, for example, the routing path from the source node to the father node is n; and then the common father node acquires the routing path m of the destination node according to the node configuration information and the destination node information stored in the common father node, and the routing path from the source node to the destination node is (n + m).
For example, in the data exchange between the switching node a and the C child node 2 in the switching system structure diagram, if the common parent node is the management node, the route from the switching node a to the management node is calculated as follows: the switching node A- > is a management node, and the routing path is 1; and then the route from the management node to the C child node 2 is calculated as follows: the management node- > the switching node C- > C child node 2 has a routing path length of 2, and the default data switching routing path between the switching node a and the C child node 2 is: switching node a- > management node- > switching node C- > C child node 2, and the default routing path length is 3.
And (3) route configuration:
the source node first calculates a default routing path according to the above algorithm, for example, n. Then, calculating the configured routing path as m according to the configured node routing, and automatically selecting the shortest path for data forwarding according to the sizes of n and m during data forwarding; and if n and m are equal, namely the lengths of the configured routing path and the default routing path are equal, the default routing path is adopted by default for forwarding the data information.
For example, in the data exchange between the switching node a and the C child node 2 in the switching system structure diagram, if the common parent node is the management node, the route from the switching node a to the management node is calculated as follows: the switching node A- > is a management node, and the routing path is 1; and then the route from the management node to the C child node 2 is calculated as follows: the management node- > the switching node C- > C child node 2 has a routing path length of 2, and the default data switching routing path between the switching node a and the C child node 2 is: the switching node A- > management node- > switching node C- > C child node 2, and the default routing path length is 3; if the route from switching node A to C child node 2 is configured, the new routing path may be: and the switching node A- > C child node 2 has the routing path length of 1, and the path length is better than the default route, so that the data can be forwarded according to the configured route during data forwarding.
The data exchange system supporting automatic routing provided by the embodiment of the invention supports automatic routing, can define data routing in a multi-level exchange node in a personalized manner, automatically selects the routing when data forwarding is carried out, automatically selects more optimized routing information of a path, and improves the data forwarding rate.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims (8)

1. A data switching system supporting automatic routing, comprising: console consoles and nodes; the nodes comprise a management node in communication connection with the console of the console and a plurality of switching nodes hierarchically deployed under the management node; wherein the number of switching nodes of each level is at least one; each of the switching nodes has a unique parent node;
the management node and the switching node store node configuration information of all nodes configured by the console of the console and route configuration information of the node; the node configuration information comprises parent-child relationship information;
the console is used for issuing task instruction information, and the task instruction information comprises task information and information of a target node for executing a task;
the management node and the switching node are used for determining a routing path according to the parent-child relationship information and the routing configuration information, and sending the task information to the target node according to the routing path;
when the management node and the switching node are configured to determine a routing path according to the parent-child relationship information and the routing configuration information, the management node and the switching node are specifically configured to:
determining a first forwarding route according to the parent-child relationship information;
judging whether the node stores the routing configuration information from the node to the target node; if yes, determining a second forwarding route according to the route configuration information;
acquiring a first route path length of the first forwarding route and acquiring a second route path length of the second forwarding route;
determining the routing path according to the first routing path length and the second routing path length;
determining the routing path according to the first routing path length and the second routing path length includes:
if the length of the second route path is shorter than the length of the first route path, determining the second forwarding route as the route path; otherwise, determining the first forwarding route as the routing path;
and the target node is used for executing a corresponding task according to the task information after receiving the task information, reporting a task execution result to the management node step by step from the father node, and reporting the management node to the console of the console.
2. The data exchange system supporting automatic routing according to claim 1, wherein the determining a first forwarding route according to the parent-child relationship information includes:
acquiring the relation between a destination node and a source node; the source node is the management node or the switching node which currently sends the task information, and the destination node is the management node or the switching node which currently receives the task information;
if the destination node and the source node are parent-child nodes, directly taking a path from the source node to the destination node as the first forwarding route;
and if the destination node and the source node are not parent-child nodes, acquiring a relationship type between the destination node and the source node, and determining the first forwarding route according to the relationship type.
3. The data switching system supporting automatic routing of claim 2, wherein the determining the first forwarding route according to the relationship type comprises:
if the destination node is an ancestor node of the source node, determining the first forwarding route by sequentially searching father nodes;
if the destination node is a descendant node of the source node, determining the first forwarding route by sequentially searching the descendant nodes;
and if the destination node and the source node have a common father node, determining the first forwarding route by searching the common father node.
4. The data switching system supporting automatic routing of claim 3, wherein the determining the first forwarding route by looking up the common parent node comprises:
searching and determining the common father node;
and calculating an upward forwarding route from the source node to the common father node, and calculating a downward forwarding route from the common father node to the destination node, wherein the upward forwarding route and the downward forwarding route form the first forwarding route.
5. The data switching system supporting automatic routing of claim 1 wherein the node configuration information further includes IP address information and port information; and the management node and the switching node send the task information or the task execution result to the next node according to the IP address information and the port information.
6. The data switching system supporting automatic routing of claim 1, wherein the target node is further configured to store the task execution results in a database.
7. The system of claim 1, wherein the console is further configured to perform node topology exposure.
8. The system according to claim 1, wherein if the switching node is a cross-network node, the switching node is deployed on a front-end processor.
CN201911182744.9A 2019-11-27 2019-11-27 Data exchange system supporting automatic routing Active CN110932981B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911182744.9A CN110932981B (en) 2019-11-27 2019-11-27 Data exchange system supporting automatic routing

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911182744.9A CN110932981B (en) 2019-11-27 2019-11-27 Data exchange system supporting automatic routing

Publications (2)

Publication Number Publication Date
CN110932981A CN110932981A (en) 2020-03-27
CN110932981B true CN110932981B (en) 2021-10-08

Family

ID=69846695

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911182744.9A Active CN110932981B (en) 2019-11-27 2019-11-27 Data exchange system supporting automatic routing

Country Status (1)

Country Link
CN (1) CN110932981B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112822257B (en) * 2020-12-31 2023-07-25 北京中交兴路信息科技有限公司 Web service management system, method and storage medium
CN114500558A (en) * 2021-12-21 2022-05-13 天翼云科技有限公司 Task layered reporting system and control method thereof
CN114710532B (en) * 2022-04-02 2023-10-03 中国科学院水生生物研究所 Method and device for suppressing security electricity utilization alarm of museum
CN117793036A (en) * 2022-09-29 2024-03-29 华为技术有限公司 Node control method, device and processing system

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103428090A (en) * 2012-05-15 2013-12-04 深圳中兴力维技术有限公司 Dynamic routing method, routing server and system for heterogeneous network
CN106912082A (en) * 2017-02-13 2017-06-30 上海斐讯数据通信技术有限公司 Wireless mesh network system, node, data transmission method and file transmitting method
CN107733802A (en) * 2017-09-18 2018-02-23 深圳市盛路物联通讯技术有限公司 A kind of node control method and system of distributed network topology structure
CN109150638A (en) * 2018-11-01 2019-01-04 郑州云海信息技术有限公司 A kind of route management method and device
CN109495567A (en) * 2018-11-16 2019-03-19 网宿科技股份有限公司 A kind of dispositions method of static routing, equipment and system

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103929790A (en) * 2014-04-02 2014-07-16 上海交通大学 Two-layer routing method for Ad Hoc network
CN109219102B (en) * 2017-06-30 2021-08-03 华为技术有限公司 Data forwarding method and device
JP6904127B2 (en) * 2017-07-19 2021-07-14 富士通株式会社 Relay node determination program, relay node determination method and parallel processing device

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103428090A (en) * 2012-05-15 2013-12-04 深圳中兴力维技术有限公司 Dynamic routing method, routing server and system for heterogeneous network
CN106912082A (en) * 2017-02-13 2017-06-30 上海斐讯数据通信技术有限公司 Wireless mesh network system, node, data transmission method and file transmitting method
CN107733802A (en) * 2017-09-18 2018-02-23 深圳市盛路物联通讯技术有限公司 A kind of node control method and system of distributed network topology structure
CN109150638A (en) * 2018-11-01 2019-01-04 郑州云海信息技术有限公司 A kind of route management method and device
CN109495567A (en) * 2018-11-16 2019-03-19 网宿科技股份有限公司 A kind of dispositions method of static routing, equipment and system

Also Published As

Publication number Publication date
CN110932981A (en) 2020-03-27

Similar Documents

Publication Publication Date Title
CN110932981B (en) Data exchange system supporting automatic routing
US20200336387A1 (en) Topological map presentation system, topological map presentation method, and computer readable recording medium
CA2256223C (en) Traffic route finder in communications network
US10911336B2 (en) Scalable visualization of health data for network devices
CN108712286B (en) Method and device for determining network topology structure and storage medium
CN109451540B (en) Resource allocation method and equipment for network slices
CN107431651A (en) The life cycle management method and equipment of a kind of network service
US20120023409A1 (en) Obtaining and displaying network topology information
CN112532408B (en) Method, device and storage medium for extracting fault propagation condition
CA2701107A1 (en) Method and apparatus for concurrent topology discovery
CN108512782A (en) Accesses control list is grouped method of adjustment, the network equipment and system
JP2017069895A (en) Fault separation method and administrative server for performing fault separation
CN112015696A (en) Data access method, data relationship setting method, data access device, data relationship setting device and storage medium
US8392577B2 (en) Reduction of message flow between bus-connected consumers and producers
Liao et al. Live: learning and inference for virtual network embedding
US9100202B2 (en) Message routing based on modeled semantic relationships
JP2015007876A (en) Control request method, information processing device, system, and program
Feng et al. COVE: Co-operative virtual network embedding for network virtualization
CN112860496A (en) Fault repair operation recommendation method and device and storage medium
CN113691403B (en) Topology node configuration method, related device and computer program product
CN108734398A (en) Task flow synchronisation control means, device and storage medium and electronic equipment
CN114125597A (en) Optical fiber scheduling method and device
CN109412944B (en) Request forwarding method and device based on micro-service and server
WO2023005993A1 (en) Method and apparatus for selecting cloud platform, and device, and medium
CN112949887B (en) Method, device and equipment for planning dispatch path and computer readable storage medium

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