RapidIO network equipment routing method, system and device

Abstract

The invention provides a RapidIO network equipment routing method, system and device, and the method comprises the steps: obtaining a topological structure of a RapidIO network system, and forming a topological graph; based on the topological graph, calculating an optimal link when a plurality of links exist between any two directly connected switching nodes; setting a cost and path array between all switching nodes, calculating the minimum cost between any two switching nodes, and updating a path between the two switching nodes based on the minimum cost; starting from the host, calculating the path with the minimum cost in the possible paths passing through all the switching nodes as a planned path; starting from the last switching node of the planned path, performing backtracking based on the planned path, and forming an added planned path; and traversing from the host again, adding, planning a path, and adding the route to each switching node. According to the scheme, the maintenance packet can arrive at the destination faster through shortest path transmission, the transmission delay is reduced, and the network response speed is improved.

Description

Technical Field

[0001] The present invention relates to the fields of integrated circuit design, network equipment data transmission management and RapidIO network, and in particular to a RapidIO network equipment routing method, system and device. Background Art

[0002] The RapidIO protocol has the characteristics of high bandwidth, low latency, high flexibility, and strong reliability. It is the best choice for interconnection technology in high-performance embedded communication systems. Usually, the RapidIO network management system contains endpoint devices (PE, Processing Element) and switching devices (SWITCH). The former is responsible for generating, sending and processing data packets, while the latter is responsible for receiving and forwarding data packets. Among the endpoint devices, there is usually a device as the master control node, which performs network maintenance tasks such as initial enumeration, topology management, and route deployment for the RapidIO network. Among them, topology management and route deployment are the premise and necessary conditions for device management. They mainly maintain the topology data of the RapidIO network and provide data support for planning routes from the master control to each device.

[0003] Data is forwarded between devices in the RapidIO network based on ID numbers. Considering that switching devices do not have IDs, when the target device is a switching device, a combination of ID numbers and hop counts (hopCount) is required for addressing. The hop count is the number of switching devices that pass from the packet source device to the target device. Therefore, if the master device wants to access all switching devices in the network, it is necessary to plan a path from the master device to all switching nodes (repeated access to the switch is allowed) as the basis for configuring the management route. Existing technologies use the order of traversing the switches during the RapidIO initial enumeration process to configure the management route, while the RapidIO initial enumeration uses a depth-first algorithm to traverse all switches in the system and endpoints connected to the switches. Due to the limitations of the depth-first algorithm, when the network topology is complex, traversing all devices may require a large number of previously traversed paths to be rolled back. The management route configured in this way greatly increases the transmission distance and time of the maintenance packet, wasting network resources. Summary of the invention

[0004] In view of this, the embodiments of the present invention provide a RapidIO network device routing method, system and device, and specifically provide the following technical solutions: In a first aspect, the present invention provides a RapidIO network device routing method, the method comprising: S1, obtaining the topology structure of the RapidIO network system and forming a topology map based on the switching nodes; S2. Based on the topology graph, calculate the optimal link when there are multiple links between any two directly connected switching nodes; S3, setting the cost and path array between all switching nodes, and calculating the minimum cost between any two switching nodes, and updating the path between the two switching nodes based on the minimum cost; S4. Starting from the host, calculate the path with the minimum cost among the possible paths passing through all the switching nodes as the planned path; S5, starting from the last switching node of the planned path, backtracking based on the planned path, and obtaining all the switching nodes in the planned path, and adding the optimal link between any two directly connected switching nodes in the planned path to the planned path, until backtracking to the switching node directly connected to the host, forming a planned path after adding; S6. Traverse the added and planned paths from the host again, and add the routes to each switching node.

[0005] Preferably, the RapidIO network system includes at least a host, a RapidIO switch device and an endpoint device; each of the RapidIO switch devices is a switch node, and when a route is added to each switch node based on a post-addition planned path, the host can access any RapidIO switch device and any endpoint device in the RapidIO network.

[0006] Preferably, the host is used for system enumeration and management of routing planning, the RapidIO switching device is used for processing and forwarding data, and the endpoint device is used for sending or receiving data.

[0007] Preferably, in the adjacency matrix, a corresponding value is set only for whether there is a direct link between any two switching nodes. For example, if there is a direct link, the corresponding adjacency matrix element is set to 1, otherwise it is set to 0.

[0008] Preferably, S4 also includes balancing the maintenance package data traffic in the switching node: if the path between two switching nodes has been traversed once and it is necessary to return to the source switching node in order to access the next switching node, if there are multiple ports available for establishing links between the two switching nodes, the ports that are not planned into the previous path are preferentially used to configure the link.

[0009] Preferably, in S2, the optimal link is confirmed in the following manner: The bandwidths of different links between two switching nodes are calculated, and the link with higher bandwidth is taken as the optimal link between the two switching nodes.

[0010] Preferably, after the balancing process, it also includes using the endpoint device access path to optimize the access to the switching device: using the ID of the endpoint device as the ID of the switching node in the path for the host to access the endpoint device, and using the hop count of the endpoint device minus one as the hop count of the switching node in the path for the host to access the endpoint device, and the switching node is directly connected to the endpoint device.

[0011] Preferably, in S4, starting from the master control, calculating the path with the minimum cost among possible paths passing through all switching nodes specifically includes: S41, pre-processing the cost and path array of all paths between switching nodes, wherein the cost is represented by the number of hops from the source switching device to the destination switching device; the path array is set to a two-dimensional array a[i][j], representing the last switching node in the path from switching node i to switching node j; S42, calculating the minimum cost between any two switching nodes, and updating the path between the two switching nodes to the path corresponding to the minimum cost; S43, starting from the switching node to which the host is directly connected, calculating the cost of passing through each switching node, and increasing the cost corresponding to the path by one each time a switching node is passed, until one or more paths that can access all switching nodes are constructed; S44. Select the path with the minimum cost from the paths obtained in S43 as the planned path.

[0012] Preferably, the method further comprises: when a link failure state occurs at a port of a switching node, if the link failure port is in a planned path and there is a redundant link between two switching nodes involved in the link failure port, replacing the link failure port with a port of the redundant link on the switching node where the link failure port is located; If there is no redundant link between the two switching nodes involved in the link failure port, re-initiate path planning and repeat steps S2 to S6; if the switching node involved in the link failure port is not connected to any device in the topology map, remove the switching node from the topology map and repeat steps S2 to S6.

[0013] Preferably, in S1, each RapidIO switch device and endpoint device in the entire RapidIO network is enumerated starting from the host to form a topology map, and the topology map is stored in the form of an adjacency matrix; the adjacency matrix does not include the host and the endpoint device.

[0014] In a second aspect, the present invention further provides a RapidIO network device routing system, the system comprising: a host, a RapidIO switching device and an endpoint device; the system is used to execute the RapidIO network device routing method as described above, the host comprising: A topology map building unit, used for forming a topology map based on switching nodes for a RapidIO network; An optimal link calculation unit, used to calculate the optimal link when there are multiple links between any two switching nodes; The path planning unit is used to form a planned path based on a path with the minimum cost, and to form an added planned path based on backtracking of the planned path.

[0015] In a third aspect, the present invention further provides a RapidIO network device routing apparatus, which at least comprises a processor and a memory, wherein the processor calls computer instructions in the memory to execute the RapidIO network device routing method as described above.

[0016] Compared with the existing technology, this solution further optimizes the planning of the RapidIO network system route, using a combination of backup links and optimized links, so that the master device's access to other devices in the entire system is not affected, and the stability and transmission efficiency of the management route link are improved. Compared with the path planning method of management routing in the existing technology, this solution has at least the following advantages: Maintenance packages can reach their destination faster through the shortest path transmission, reducing transmission delays and thus improving network response speed. Reducing network resource costs, reducing transmission distance and time, and improving service responsiveness and availability. Achieving balanced distribution of traffic and avoiding overload of certain nodes or links, thereby improving overall network stability and performance. Effectively utilizing network resources and improving overall network capacity and throughput. Reducing service interruptions caused by path failures or congestion and enhancing service continuity and reliability. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0018] Figure 1 A schematic diagram of a RapidIO network routing method according to an embodiment of the present invention; Figure 2 An example of a RapidIO network topology structure according to an embodiment of the present invention; Figure 3 An example of a topological graph stored using an adjacency matrix according to an embodiment of the present invention; Figure 4 Schematic diagram of the system architecture of an embodiment of the present invention. DETAILED DESCRIPTION

[0019] The embodiments of the present invention are described in detail below in conjunction with the accompanying drawings. It should be clear that the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0020] Those skilled in the art should know that the following specific embodiments or specific implementations are a series of optimized settings listed by the present invention to further explain the specific content of the invention, and these settings can be combined or used in association with each other, unless the present invention clearly states that some or a specific embodiment or implementation cannot be associated or used together with other embodiments or implementations. At the same time, the following specific embodiments or implementations are only used as the most optimized settings, and are not to be understood as limiting the scope of protection of the present invention.

[0021] Based on the above discussion, in order to solve the deficiencies of the prior art, the present invention provides a method for planning the management route of a RapidIO network device. After the RapidIO network is enumerated, first, according to the topological diagram obtained by enumeration, the shortest path between each two switching nodes is pre-calculated using, for example, the Floyd algorithm; then, the total cost of passing through each switching node from the master device is calculated using state compression plus dynamic programming until all switching nodes are passed; finally, the optimal path is found according to the previously calculated cost and all the switching nodes passed are traced back to plan the management route. The ID of the exchange in the path still uses a unique ID, and the hop count (hopCount) is the hop count from the master to each exchange in the planned path. At the same time, if the switching node is connected to an endpoint device, the ID and hop count (hopCount) of the endpoint device minus one can be used as the ID and hop count of the switching node, and the path is planned as a backup link to improve the practicality and transmission efficiency of the link.

[0022] In a specific embodiment, in combination Figure 1 As shown, the routing method of this solution mainly includes the following key settings and steps: 1. The system targeted by this embodiment is at least a basic RapidIO network system, that is, it includes a master control device (or host), a RapidIO switching device and an endpoint device. The master control device is also regarded as an endpoint device, which is responsible for system enumeration and management of routing planning, the RapidIO switching device is responsible for processing and forwarding data, and the endpoint device is responsible for sending or receiving data. This is the basic network system setting method for executing the method described in this embodiment. Those skilled in the art can understand that other necessary network system devices can be added on the basis of the above infrastructure, and these conventional adjustments should be regarded as falling within the scope of protection of the present invention.

[0023] 2. Based on the above network system, a topology diagram containing all the switching nodes of the system is obtained. After the system is started, the master device starts from the HOST (i.e., the host) to enumerate other devices in the entire network. After completion, a complete topology diagram stored in the adjacency matrix is ​​formed, such as Figure 3 As shown, the adjacency matrix of this embodiment can be set as follows: with nodes (i.e. Figure 3 The SW in the matrix is ​​numbered as the horizontal and vertical axes. Each element in the matrix represents the connection relationship between two nodes. There are many ways to assign values ​​to each element. In this embodiment, Figure 3 The value assignment method is that 0 represents that there is no direct connection between the two switching nodes, and 1 represents that there is at least one direct link connection between the two switching nodes (that is, there is no other intermediate node between the two switching nodes and they are directly connected). In addition, combined with Figure 1 , the initialization step is mainly to obtain the above-mentioned adjacency matrix. The adjacency matrix does not include the links between the endpoints (i.e., endpoint devices) and the switching nodes, but only includes the links between the switching nodes and the host and the switching nodes. It is further explained that in this solution, the management and control of the switching devices are mainly carried out, and the main purpose is to achieve access to all switching devices, so that access to the endpoint devices that need to be accessed can be achieved through the configuration of the switching devices.

[0024] 3. For the complete topology diagram, the optimal path is obtained by using the shortest path algorithm starting from the main control device and passing through all switching nodes. The route of each switch is configured based on the planned path to improve the transmission efficiency of the link while ensuring the normal sending and receiving of maintenance packets.

[0025] 4. After obtaining the optimal path, the maintenance package data traffic is balanced, and the following principles are followed in the balancing process: If the path between two switching nodes is traversed once and it is necessary to return to the source switching device (i.e., the switching node) in order to access the next switching device, if there are multiple ports available for establishing links between the two switching nodes (that is, equivalent to the existence of multiple remaining links), the ports that are not planned in the previous path are used first to configure the link route.

[0026] 5. After performing maintenance packet data traffic balancing, host access to endpoint devices (such as Figure 2 The switching path optimization of endpoint A in , using the endpoint device ID and hop count (hopCount) minus one as the switching node directly linked to the endpoint device (see Figure 2The ID and hop count of the switching node SW6 directly connected to the endpoint device A in the optimization plan path are used as the backup link. If the connection between the endpoint device and the switching device is disconnected, the backup link can still be used to ensure the normal sending and receiving of the maintenance package. It is further explained here that in this embodiment, the hop count is used as the cost, that is, the cost of the path; the ID and the specific hop count are used for addressing.

[0027] It can be understood here that for a switching node in the network that is not directly connected to an endpoint device, its ID is set to 0xff. The hop count of such a switching node can be determined by the number of switching nodes passed through in the initialization planning optimal path. In this embodiment, the hop count of the switching node is the number of switching nodes passed through from the host to the switching node, for example Figure 2 In the example, the host accesses the switching node SW2 through the switching node SW0, so the hop count of SW2 in this path is 1. After the optimal path planning in this scheme, all the switching nodes in the network will have an ID and a hop count, among which the ID and hop count of the switching node directly connected to the endpoint device are updated to the ID of the endpoint device to which it is directly connected, and the hop count is updated to the hop count of the endpoint device to which it is directly connected minus 1. In addition, in a more special case, when a switching node is directly connected to multiple endpoint devices, the ID of the switching node is updated to the ID of the endpoint device with the smallest ID among the connected endpoint devices, and the hop counts of the endpoint devices connected to the same switching node are generally the same. Therefore, in this case, the hop count of the switching node is set according to the hop count of any endpoint device to which it is directly connected, and the hop count results of the switching node are often the same.

[0028] 6. When a link down event occurs between the links of the switching nodes, if the disconnected port is detected in the port of the above path planning, the planned path needs to be updated. If there are still redundant links between the two switches, one of the redundant links can be directly selected for use. If not, the algorithm in the above step 3 needs to be called to re-plan the management routing path. In a preferred implementation, if there are multiple redundant links, the link with the highest bandwidth is selected.

[0029] 7. After the path planning is completed and configured to each switching device, the master device can access all switching devices and endpoint devices connected to them, and manage and maintain the entire RapidIO network through modules such as error management and traffic statistics. Here, modules such as error management, traffic statistics, device management, network enumeration, topology management, traffic monitoring, port management, and routing configuration are other supporting modules for network management and maintenance, and their working methods can use conventional methods in the prior art, which will not be described here.

[0030] The following is combined again Figure 1, 2 , combined with a specific example, the method of routing planning based on network topology is further explained in detail, Figure 2 The RapidIO shown in the topology does not list enough endpoint devices and links between switching nodes. It is only used as an example for illustration. The endpoint device with network management function is the host. The specific implementation process of this solution is as follows: (1) The host initiates network enumeration to obtain a network topology diagram including all endpoint devices and switching devices, and the host can access any device in the network; here, the network topology diagram can be obtained by, for example, a depth-first algorithm. The topology diagram is represented by an adjacency matrix.

[0031] (2) Based on the topological graph and related data structure obtained in the previous step, the data structure can be referenced Figure 3 The adjacency matrix shown in the figure calculates the optimal link between any two switching nodes. The optimal link between two switching nodes is calculated by calculating the bandwidth of different links between the two switching nodes to determine whether it is the optimal link. Figure 2 As shown in the figure, each SW in the figure represents a switching node. Take the link between SW0 and SW1 as an example, where SW0 has port 4 and port 5, and SW1 has port 4 and port 5. There are two links between SW0 and SW1, namely port 4 of SW0 and port 5 of SW1, and port 5 of SW0 and port 4 of SW1. The bandwidth of the former link is higher than that of the latter link, so the former link is selected as the optimal link between SW0 and SW1; taking SW1 and SW2 as an example, SW1 needs to establish a link between SW0 and SW2. First, look at the link between SW1 and SW0, and still select the one with higher bandwidth as the best. Then the optimal link between SW1 and SW2 is from port 4 of SW0 to port 5 of SW1, and then from port 8 of SW0 to port 3 of SW2.

[0032] (3) Preprocess the cost and path-related array of the connection paths between all switching nodes. The cost is expressed as the number of hops from the source switching device (i.e., the source switching node) to the destination switching device (i.e., the destination switching node). Assuming there are n switching nodes, the path-related array is an n*n two-dimensional array. a[i][j] represents the last switching node in the path from switching node i to switching node j. If a[i][j] = k, a[i][k] = i, then the path from switching node i to switching node j is ikj. Based on the topology graph, the path-related array between any two switching nodes can be obtained. Combined with Figure 2As shown, taking SW2 to SW5 as an example, if a[2][5]=4, a[2][4]=3, a[2][3]=2, then the path from SW2 to SW5 is SW2-SW3-SW4-SW5, then cost[2][3] = 1, cost[2][4] = cost[2][3] + cost[3][4], cost[2][5]= cost[2][4] + cost[4][5], this cost is 1 for adjacent switching nodes, and non-adjacent switching nodes need to be calculated cumulatively; if a[2][5]=6, a[2][6]=2, then the path from SW2 to SW5 is SW2-SW6-SW5, and the cost (i.e., cost) calculation is referred to above. In summary, for the cost setting, SW2 and SW3 are directly connected, then the cost between the two switching nodes can be set to 1, and the previous switching node is SW2, but SW2 and SW5 are not directly connected, so the cost calculation needs to be cumulative. It can be understood here that the method of using the endpoint device ID and the hop count minus one to update the ID and hop count of the switching node directly connected to the endpoint device is to update the switching nodes directly connected to the endpoint device after the hop count and cost of the above-mentioned switching nodes are initialized. For example, the switching node of the host device uses the host ID and the hop count minus one to access the switching node, and the switching node not directly connected to the endpoint device still uses the method of this paragraph to set the hop count. Here, as mentioned above, for the switching node not directly connected to the endpoint device, its ID is set to 0xff, and these switching nodes are distinguished by the hop count. It is further explained here that 0xff is a reserved ID, and this embodiment uses it on the switching node to avoid the risk of using other IDs that may conflict with the endpoint device ID.

[0033] (4) Calculate the minimum cost between any two switching nodes and update the related paths. For example, there are two routes between SW2 and SW5, SW2-SW3-SW4-SW5 and SW2-SW6-SW5. The cost of the former is 3 and the cost of the latter is 2. Then, the cost between the two switching nodes is set to 2, and the previous switching node is SW6. That is, the path between SW2 and SW5 is updated to the minimum cost path SW2-SW6-SW5.

[0034] (5) The host device is directly connected to SW0, and the cost of walking through each switching node starting from SW0 is calculated. The cost is increased by one for each switching node (including repeated switching nodes). In this embodiment, state compression is used to indicate whether each switching node has been walked through. The state compression is represented by an array. Each bit in the array represents the corresponding switching node. That is, the number of switching nodes in the topology map is set to the corresponding number of bits. The bit that is set indicates that the corresponding switching node has been walked through. For example, if SW0 is walked first, the 0th bit of the state bit is set to 1. The corresponding state bit of the next switching node is set to 1. At the same time, the previous successor node with a smaller cost is continuously updated according to the cost calculated by the previous state bit until all switching nodes are walked through, that is, the state bits related to all switching nodes are 1. Finally, a path starting from the main control that can access all switching nodes (that is, all switching nodes in the topology network) is constructed; it can be understood that there may be multiple paths planned at this time, that is, the multiple paths can achieve access to all switching nodes in the network starting from the host.

[0035] (6) Find the path with the lowest cost among all paths, and then, based on the last switching node of this path, continuously backtrack to find the previous switching node, and add the optimal link between two adjacent switching nodes to the planned path. If there is more than one optimal link between two switching nodes, you can choose based on bandwidth and use the link with wider bandwidth as the optimal path. If the bandwidths of multiple optional optimal paths are the same, then the first one or any one of them can be selected. Of course, other performance indicators can also be added here for further screening until you reach SW0 which is directly connected to the host.

[0036] (7) Traverse the planned path from the beginning and add the route to the corresponding switching node. If the link between the two switching nodes has been used and there are multiple links, update the optimal link between the switching nodes to an unused link for next use. Here, when updating the optimal link between the switching nodes, the method in step (6) can also be used, that is, select the link with a wider bandwidth as the optimal. If there are multiple identical optimal paths with the same bandwidth, select the first one or any one of them. Combined again Figure 2 As shown in the figure, for example, the planned path is SW0-SW1-SW0-SW2-SW6-SW5-SW4-SW7-SW8-SW7-SW10-SW9. When SW0 goes to SW1, the optimal link between SW0 and SW1 is port 5 of SW0 and port 4 of SW1. At this time, since there are multiple links between SW0 and SW1, the optimal link between SW0 and SW1 will be updated to port 4 of SW0 and port 5 of SW1. When SW1 returns to SW0, this link will be used. That is, when it is possible not to reuse, non-repeated links will be used first.

[0037] (8) When a switch port (i.e., a port in a switching node) experiences a link failure (i.e., link down) state, if the port is in the planned path and there is a redundant link between the two switching nodes, the failed routing port is replaced by the port of the redundant link. For example, the routing of each switch configuration (i.e., the routing relationship between the internal ports of each switching node) is SW0-2->SW0-5, SW1-4->SW1-5, SW0-4->SW0-8, SW2-3->SW2-9, SW6-1->SW6-7, SW5-9->SW5-5, SW4-4->SW4-6, SW7-7->SW7-9, SW8-7->SW8-7, SW7-9->SW7-10, SW10-7->SW10-11, SW9-10->SW9-7, SW3-6->SW3-6, if S Port 4 of W4 has a link failure and the port is disconnected. However, port 4 of SW4 is in the planned path, which will cause the route SW4-4->SW4-6 to fail. The switch devices after this route in the planned path cannot be accessed, so the redundant link SW4 port 7 is used to replace the original route. Since the link failure of port 4 of SW4 affects the link with SW5, the route related to SW5 should also be replaced by port 0 of SW5, that is, SW5-5 is replaced by SW5-0. At this time, the routes related to SW5 and SW4 become SW5-9->SW5-0 and SW4-7->SW4-6. If there is no redundant link between switches, such as the link between SW2 and SW6 is disconnected, the path planning will be re-initiated and steps (2)-(7) will be repeated.

[0038] It can be seen from the description of the above embodiments that this solution effectively improves the stability and transmission efficiency of the routing link. The maintenance package can reach the destination faster through the shortest path transmission, reduce transmission delay, and thus improve the network response speed. At the same time, it can achieve balanced distribution of traffic, effectively utilize network resources, and avoid overload of certain nodes or links, thereby improving the stability and performance of the overall network, reducing service interruptions caused by path failures or congestion, and enhancing service continuity and reliability.

[0039] In another embodiment, the present invention can also be implemented in a system manner, combining Figure 4 As shown, the system includes: Host, multiple RapidIO switching devices and endpoint devices. The endpoint device may include multiple, Figure 4 Only one is used as an example; the system is used to execute the RapidIO network device routing method as described above, and the host includes: A topology map building unit, used for forming a topology map based on switching nodes for a RapidIO network; An optimal link calculation unit, used to calculate the optimal link when there are multiple links between any two switching nodes; The path planning unit is used to form a planned path based on a path with the minimum cost, and to form an added planned path based on backtracking of the planned path.

[0040] In another embodiment, the present solution can be implemented by means of a device, which may include a corresponding module for performing each or several steps in the above-mentioned embodiments. Therefore, each step or several steps of the above-mentioned embodiments can be performed by a corresponding module, and the device may include one or more of these modules. The module may be one or more hardware modules specially configured to perform the corresponding steps, or implemented by a processor configured to perform the corresponding steps, or stored in a computer-readable medium for implementation by a processor, or implemented by some combination.

[0041] The apparatus may be implemented using a bus architecture. The bus architecture may include any number of interconnecting buses and bridges, depending on the specific application and overall design constraints of the hardware. The bus connects together various circuits including one or more processors, memories, and / or hardware modules. The bus may also connect various other circuits such as peripherals, voltage regulators, power management circuits, external antennas, and the like.

[0042] Any process or method description in the flowchart or otherwise described herein can be understood as a module, fragment or portion of a code representing one or more executable instructions for implementing the steps of a specific logical function or process, and the scope of the preferred embodiment of the present solution includes other implementations, in which the functions may not be performed in the order shown or discussed, including performing the functions in a substantially simultaneous manner or in a reverse order according to the functions involved, which should be understood by a person skilled in the art of the present solution. The processor performs the various methods and processes described above. For example, the method implementation in the present solution can be implemented as a software program, which is tangibly contained in a machine-readable medium, such as a memory. In some embodiments, part or all of the software program can be loaded and / or installed via a memory and / or a communication interface. When the software program is loaded into the memory and executed by the processor, one or more steps in the method described above can be performed. Alternatively, in other embodiments, the processor can be configured to perform one of the above methods in any other appropriate manner (e.g., by means of firmware).

[0043] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed by the present invention should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims

1. RapidIO network device routing method, characterized in that: The method comprises: S1, obtaining the topology structure of the RapidIO network system and forming a topology map based on the switching nodes; S2. Based on the topology graph, calculate the optimal link when there are multiple links between any two directly connected switching nodes; S3, set the cost and path array between all switching nodes, and calculate the minimum cost between any two switching nodes, and update the path between the two switching nodes based on the minimum cost; S4. Starting from the host, calculate the path with the minimum cost among the possible paths passing through all the switching nodes as the planned path; S5, starting from the last switching node of the planned path, backtracking based on the planned path, obtaining all the switching nodes in the planned path, and adding the optimal link between any two directly connected switching nodes in the planned path to the planned path, until backtracking to the switching node directly connected to the host, forming a planned path after adding; S6. Traverse the added and planned paths from the host again, and add the routes to each switching node.

2. The method according to claim 1, characterized in that The RapidIO network system includes at least a host, a RapidIO switching device and an endpoint device; each RapidIO switching device is a switching node, and after adding a route to each switching node based on a post-addition planned path, the host can access any RapidIO switching device and any endpoint device in the RapidIO network.

3. The method according to claim 1, characterized in that The S4 also includes balancing the maintenance packet data traffic in the switching node: if the path between two switching nodes has been traversed once and it is necessary to return to the source switching node in order to access the next switching node, if there are multiple ports available for establishing links between the two switching nodes, the ports that are not planned into the previous path are preferentially used to configure the links.

4. The method according to claim 1, characterized in that: In S2, the optimal link is confirmed in the following manner: The bandwidths of different links between two switching nodes are calculated, and the link with higher bandwidth is taken as the optimal link between the two switching nodes.

5. The method according to claim 3, characterized in that: After the balancing process, the method also includes using the endpoint device access path to optimize the access to the switching device: using the endpoint device ID as the ID of the switching node in the path for the host to access the endpoint device, and using the endpoint device hop count minus one as the switch node hop count in the path for the host to access the endpoint device, and the switch node is directly connected to the endpoint device.

6. The method according to claim 1, characterized in that In S4, starting from the master control, the path with the minimum cost among the possible paths passing through all the switching nodes is calculated, which specifically includes: S41, pre-processing the cost and path array of all paths between switching nodes, wherein the cost is represented by the number of hops from the source switching device to the destination switching device; the path array is set to a two-dimensional array a[i][j], representing the last switching node in the path from switching node i to switching node j; S42, calculating the minimum cost between any two switching nodes, and updating the path between the two switching nodes to the path corresponding to the minimum cost; S43, starting from the switching node to which the host is directly connected, calculating the cost of passing through each switching node, and increasing the cost corresponding to the path by one each time a switching node is passed, until one or more paths that can access all switching nodes are constructed; S44. Select the path with the minimum cost from the paths obtained in S43 as the planned path.

7. The method according to claim 1, characterized in that The method further comprises: when a link failure state occurs at a port of a switching node, if the link failure port is in a planned path and there is a redundant link between two switching nodes involved in the link failure port, replacing the link failure port with a port of a redundant link on the switching node where the link failure port is located; If there is no redundant link between the two switching nodes involved in the link failure port, re-initiate path planning and repeat steps S2 to S6; if the switching node involved in the link failure port is not connected to any device in the topology map, remove the switching node from the topology map and repeat steps S2 to S6.

8. The method according to claim 1, characterized in that In S1, each RapidIO switch device and endpoint device in the entire RapidIO network is enumerated starting from the host to form a topology map, and the topology map is stored in the form of an adjacency matrix; the adjacency matrix does not include the host and the endpoint device.

9. RapidIO network device routing system, characterized in that: The system comprises: a host, a RapidIO switching device and an endpoint device; the system is used to execute the RapidIO network device routing method according to any one of claims 1 to 8, wherein the host comprises: A topology map building unit, used for forming a topology map based on switching nodes for a RapidIO network; An optimal link calculation unit, used to calculate the optimal link when there are multiple links between any two switching nodes; The path planning unit is used to form a planned path based on a path with the minimum cost, and to form an added planned path based on backtracking of the planned path.

10. RapidIO network device routing device, characterized in that: The device at least includes a processor and a memory, and the processor calls computer instructions in the memory to execute the RapidIO network device routing method according to any one of claims 1-8.

Images