A routing method in a high-speed serial communication network

Abstract

The invention discloses a routing method in a high-speed serial communication network, and belongs to the field of communication. The transmission process of a data packet in the entire high-speed serial communication network is split into multiple parts according to nodes, and the latter is abstracted as a data packet sent from a local port. The routing of the data packet at each node determines that the data packet is sent to a specific remaining port of the node; the address in the data packet is divided into two parts by routing: a remapping index and a routing rule index; when the data packet arrives from a protocol device or a port on the node, the node reads the routing rule index of the address, and the node queries the corresponding specific routing rule through the index according to the routing rule index table, and then decides to send the data packet to the designated port according to the indication of the routing rule. The invention can quickly establish routing rules, and realize various complex routing requirements through flexible combination, and solves the difficulty of cumbersome, complex and error-prone routing rules in complex networks.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a routing method in a high-speed serial communication network. Background Art

[0002] A high-speed serial communication link is composed of a pair of high-speed serial transceivers connected to each other through cables. A high-speed serial communication network is composed of one or more high-speed serial communication links connected to each other. A system built with a high-speed serial communication network as the framework is called a high-speed serial communication system. Each high-speed serial transceiver in the system is called a node in the system.

[0003] like Figure 1 As shown in the figure, various protocol devices are mounted on the nodes of the high-speed serial communication network, and communicate with other devices of the same protocol through the high-speed serial communication network. Some of these protocols are one-way communication and some are two-way communication, and in each specific application, unicast, multicast and broadcast access may be required in the entire network. As the core network connecting these protocol devices, the high-speed serial communication network needs to be able to meet the diverse routing requirements of various protocols. Summary of the invention

[0004] The object of the present invention is to provide a routing method in a high-speed serial communication network to solve the problems in the background technology.

[0005] In order to solve the above technical problems, the present invention provides a routing method in a high-speed serial communication network, comprising:

[0006] The transmission process of data packets in the entire high-speed serial communication network is divided into multiple parts according to nodes, and they are logically merged to simplify the routing task. The routing of the data packet at each node determines whether the data packet is sent to the remaining specific port of the node;

[0007] The address in the data packet is divided into two parts: a remapping index and a routing rule index; when a data packet arrives from a protocol device or a port on a node, the node reads the routing rule index of the address, and the node queries the corresponding specific routing rule through the index according to the routing rule index table, and then decides to send the data packet to the designated port according to the instructions of the routing rule.

[0008] In one embodiment, in each part of the data packet split according to the nodes, there are two situations for the routing of the data packet: one is to transmit from one or some ports of the current node to the next node directly connected to it; the other is to convert it into the original protocol at the current node and forward it to the protocol device on the node, and abstract the latter into a data packet and send it from the local port.

[0009] In one embodiment, before each port sends the data packet, the address in the data packet is remapped to a new address based on the address remapping value of the sending port according to the remapping index query. After the data packet is sent from the port to the next node, the next stage of routing and remapping is performed according to the new address.

[0010] In one embodiment, the data packet is routed at each node according to the current address and the new address is remapped to the next node until it finally reaches the target protocol device, completing its routing task in the entire high-speed serial communication network.

[0011] In one embodiment, each node of the high-speed serial communication network has a remapping index table, and the value of the remapping address is determined by two parameters: the sending port where the data packet is located and the remapping index value in the original address; the original address of a data packet only carries a fixed remapping index value, and when the data packet is sent from multiple ports of the node, they will be assigned different new addresses according to the different ports, so that it can be routed as required in the subsequent network.

[0012] In one implementation, different data packets may have different routing topologies from the beginning, and they carry different remapping index values ​​to cope with their own completely different routing requirements. Data packets with different remapping index values ​​have completely independent remapping contents at each node in the entire link, so they are independent of each other.

[0013] In one implementation, each node formulates its own set of routing rules based on the number of its high-speed serial communication ports and the location information of the ports in the entire high-speed serial communication network; the specific routing information is untied from the address through the routing rule index, so that each node can tailor its own routing rules, and when associating them to the index value, they are arranged through overall planning so that a specific routing rule index value corresponds to a specific global routing rule.

[0014] The present invention provides a routing method in a high-speed serial communication network, which can quickly establish routing rules and realize various complex routing requirements through flexible combination. The present invention makes the routing requirements clear and the routing implementation simple by splitting the overall complex routing requirements into local simple routing requirements. The routing rule setting and calling method proposed in the present invention has high flexibility, which solves the difficulty of cumbersome, complex and error-prone routing rules in complex networks; the proposed address remapping scheme flexibly associates various local routing rules, and the combination freedom is very high, which can meet various routing requirements. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Figure 1It is a structural diagram of various protocol devices mounted on the nodes of a high-speed serial communication network.

[0016] Figure 2 The figure is a schematic diagram of dividing the addresses in the data packet into the remapping index and the routing rule index.

[0017] Figure 3 This is a representation of the routing rule index.

[0018] Figure 4 This is a schematic diagram of the correspondence between the sending port and the address remapping value in the remapping index. DETAILED DESCRIPTION

[0019] The following is a further detailed description of a routing method in a high-speed serial communication network proposed by the present invention in conjunction with the accompanying drawings and specific embodiments. The advantages and features of the present invention will become clearer according to the following description. It should be noted that the accompanying drawings are all in a very simplified form and are not in precise proportions, and are only used to conveniently and clearly assist in explaining the purpose of the embodiments of the present invention.

[0020] The transmission process of data packets in the entire high-speed serial communication network is divided into multiple parts according to the nodes. In each part, there are two cases for the routing of data packets: 1. Transmit from one (some) ports of the current node to the next node directly connected to it; 2. Convert to the original protocol at the current node and forward to the protocol device on the node. The latter case is abstracted as data packets sent from local port 0, and they are logically merged to simplify the routing task. The routing of data packets at each node is to decide which ports of all other ports of the node to send the data packets to.

[0021] The routing system of the high-speed serial communication network of the present invention divides the address in the data packet into two parts: a remapping index and a routing rule index, such as Figure 2 When a data packet arrives from a protocol device or a port on a node, the node reads the routing rule index of the address and the node responds according to the following Figure 3 The routing rule index table shown in the figure can be used to query the corresponding specific routing rule through the index, and then decide which port to send the data packet to according to the instructions of the routing rule. Figure 4 As shown in the figure, before each port sends the data packet, the address remapping value based on the sending port is queried according to the remapping index, and the address in the data packet is remapped into a new address. After the data packet is sent from the port to the next node, the next stage of routing and remapping can be performed according to the new address. The data packet completes the routing according to the current address at each node, and remaps the new address to the next node until it finally reaches the target protocol device, completing its routing task in the entire high-speed serial communication network.

[0022] like Figure 3 As shown in the figure, each node formulates its own set of routing rules according to the number of its high-speed serial communication ports and the position of the ports in the entire high-speed serial communication network, namely Figure 3 The destination port mask in . Each bit in the destination port mask represents a port on the node. If the value of the bit is 1, it means that it needs to be sent to the port, and if the value of the bit is 0, it means that it does not need to be sent to the port. Because the number of high-speed serial communication ports of each high-speed serial communication node in the high-speed serial communication network is not necessarily the same, and the position of each high-speed serial communication port in the high-speed serial communication network is also different, the destination port mask corresponding to a specific routing requirement may be completely different. The routing rule index can be used to decouple specific routing information from the address to a certain extent, so that each node can tailor its own routing rules, and when it is associated with the index value, it can be arranged through overall planning. A specific routing rule index value can correspond to a specific global routing rule, and there is no regularity in the routing rules of this set of routing rules on each high-speed serial communication node.

[0023] For example, Figure 1 Protocol A device 1 in the example needs to control protocol A device 4, protocol A device 5, and protocol A device 6 simultaneously through multicast. The system establishes an independent routing index value 3 for this routing requirement, and uses it fixedly on the entire high-speed serial communication network to complete this routing task. The target port masks corresponding to routing index 3 on high-speed serial communication nodes 1, 2, 4, 5, and 6 are: 4B1010, 3B100, 4B0101, 2B01, and 2B01, respectively. It can be seen that in order to achieve this overall routing goal, the routing rules on each node are different.

[0024] As mentioned above, after the current node completes the routing, it is necessary to remap the address of the data packet from each port to ensure that it can be routed and remapped as planned at the next node after it leaves the port. Therefore, each high-speed serial communication node will have a remapping index table. Figure 4As shown in the figure, the value of the remapped address is determined by two parameters: 1. The sending port of the data packet; 2. The remap index value in the original address. The original address of a data packet only carries a fixed remap index value. When the data packet is sent from multiple ports of the node, they will be assigned different new addresses according to the ports. This is because the position of each port on the node in the high-speed serial communication network and the local network it connects to are different. Usually, the data packets sent from different ports have different subsequent routes. This requires that a new address be assigned to the data packet sent from each port so that it can be routed as required in the subsequent network. Different data packets may have different routing topologies from the beginning. They can carry different remap index values ​​to cope with their own completely different routing requirements. Data packets with different remap index values ​​have completely independent remap content in each node on the entire link, which can be independent of each other and do not affect each other.

[0025] The remapping mechanism proposed in the present invention enables the data packet to flexibly remap the address at each port of each node, and provides multiple groups of remapping options to cope with complex and diverse remapping requirements in the system.

[0026] The present invention designs a routing system for a high-speed serial communication network, which can customize routing rules according to the characteristics of each node and its position in the network, and can organically combine them through global coordination to cope with the complex and diverse routing requirements on the entire communication network.

[0027] The present invention decomposes the routing requirements of a data packet in the entire network into multiple local routing requirements, and performs routing in each local area according to the address carried by the data packet. The overall complex routing requirements are divided into local simple routing requirements, making the implementation of routing simple and clear. The address of the data packet contains a routing rule index rather than the routing rule itself. Each node searches its own preset routing rule index table for the routing rule on its side according to the routing rule index in the address, so that each node can flexibly set the routing rule corresponding to the index, which not only makes the routing rule more in line with the characteristics of the node itself, but also allows the routing rules on different nodes to be flexibly combined to achieve the overall routing function.

[0028] The address of the data packet contains the index information of address remapping. The node comprehensively determines the new address of the data packet based on the index information and the location of the sending port of the data packet, and prepares for the routing and address remapping of the data packet at the next node. The local routes are connected in series through the remapping mechanism to build the overall route of the data packet in the network. Through the two-dimensional address remapping table established with index and port as parameters, different data packets can obtain different remapped addresses at the same port of the same node by using different remap indexes; the same data packet can obtain different remapped addresses at different ports of the same node, which has very high flexibility.

[0029] The above description is only a description of the preferred embodiments of the present invention, and is not intended to limit the scope of the present invention. Any changes or modifications made by a person skilled in the art in the field of the present invention based on the above disclosure shall fall within the scope of protection of the claims.

Claims

1. A routing method in a high-speed serial communication network, characterized in that: include: The transmission process of data packets in the entire high-speed serial communication network is divided into multiple parts according to nodes, and they are logically merged to simplify the routing task. The routing of the data packet at each node determines whether the data packet is sent to the remaining specific port of the node; The address in the data packet is divided into two parts: a remapping index and a routing rule index; when a data packet arrives from a protocol device or a port on a node, the node reads the routing rule index of the address, and the node queries the corresponding specific routing rule through the index according to the routing rule index table, and then decides to send the data packet to the designated port according to the instruction of the routing rule; In each part of the data packet split according to the node, there are two cases of data packet routing: one is to transmit from one or some ports of the current node to the next node directly connected to it; the other is to convert to the original protocol at the current node and forward it to the protocol device on the node, which is abstracted as a data packet and sent from the local port; Before each port sends the data packet, it queries the address remapping value based on the sending port according to the remapping index, and remaps the address in the data packet into a new address. After the data packet is sent from the port to the next node, the next stage of routing and remapping is performed according to the new address. The data packet completes routing at each node according to the current address, and remaps the new address to the next node for use, until it finally reaches the target protocol device, completing its routing task in the entire high-speed serial communication network; Each node in the high-speed serial communication network is provided with a remapping index table, and the value of the remapping address is determined by two parameters: the sending port where the data packet is located and the remapping index value in the original address; the original address of a data packet carries only a fixed remapping index value, and when the data packet is sent from multiple ports of the node, different new addresses will be assigned to them according to the different ports, so that it can be routed as required in the subsequent network.

2. The routing method in a high-speed serial communication network as claimed in claim 1, characterized in that: Different data packets may have different routing topologies from the beginning. They carry different remapping index values ​​to cope with their own completely different routing requirements. Data packets with different remapping index values ​​have completely independent remapping contents at each node in the entire link, making them independent of each other.

3. The routing method in a high-speed serial communication network as claimed in claim 2, characterized in that: Each node formulates its own set of routing rules based on the number of its high-speed serial communication ports and the location information of the ports in the entire high-speed serial communication network; the specific routing information is untied from the address through the routing rule index, so that each node can tailor its own routing rules, and when associating them with the index value, they are arranged through overall planning so that a specific routing rule index value corresponds to a specific global routing rule.

Images