A peer-to-peer optical interconnection circuit switching networking method and system based on DPU

Abstract

This application discloses a DPU-based peer-to-peer optical interconnect circuit switching networking method and system. The method includes: collecting networking information of the optical interconnect circuit switching network, establishing a peer-to-peer networking model based on the networking information, and setting up access nodes equipped with DPU accelerator cards between the primary network and the auxiliary network for interconnection and intercommunication based on the peer-to-peer networking model; the DPU adopts peer-to-peer traffic agreement to realize a peer-to-peer optical interconnect circuit interaction network. The method and system of the present invention maintain a global network routing model locally at each DPU-based access node, moving routing queries to the local area, thereby avoiding meaningless communication traffic, reducing the pressure on the auxiliary network, and increasing the network's available reconstruction frequency, thereby improving network switching performance.

Description

Technical Field

[0001] The present application relates to the field of circuit switching technology, and in particular to a DPU-based peer-to-peer optical interconnection circuit switching networking method and system thereof. Background Art

[0002] Currently, as data centers put forward further requirements for internal interconnection bandwidth and interconnection scale, circuit switching networks based on reconfigurable optical interconnection have successfully overcome the problems of bandwidth, power consumption and interconnection scale and become the mainstream technology.

[0003] However, circuit-switched networks based on reconfigurable optical interconnects also bring new problems: the working principle of circuit-switched networks is different from that of data packet switching networks. The former is equivalent to a set of dynamically created point-to-point links and does not cache the traffic passing through them, while the latter caches and forwards the traffic passing through them. As a result, the control plane and data plane of the exchange under this interconnection architecture are naturally separated. The access node cannot throw all the switching work to the switch like in traditional data packet switching networks, but needs to handle a considerable amount of related work itself.

[0004] The main problems of the prior art are as follows:

[0005] 1. Circuit-switched networks typically require an auxiliary network to coordinate and synchronize global routing states. This network needs to meet near-real-time full interconnection requirements with extremely low latency, and is therefore typically implemented using a datagram switching network (that is, an existing switch network). The arbitration unit of a circuit-switched network is typically designed within a datagram switch to enable fast and efficient arbitration decisions on conflicting routes. However, independently setting up an arbitration unit within the switch will cause access nodes to generate a large amount of meaningless routing query traffic, placing communication pressure on the auxiliary network and reducing global routing efficiency.

[0006] 2. In the previous network structure, the access node does not care about the global routing status of the network but only cares about its own current routing endpoint. When it needs to change its own routing endpoint, it will ask the arbitration unit on the switch side (usually implemented by a dedicated ASIC chip or FPGA chip, or it can be implemented by a CPU or DPU) whether it can be changed. Once the request is rejected, it means that the request and response are meaningless query traffic. A large amount of meaningless query traffic will cause the auxiliary network to be overloaded, thereby significantly increasing the communication delay of the auxiliary network, and making the current routing status of the optical interconnection network unable to be synchronized to the access node side in time. Once the routing status on the node side is out of sync, it will cause data to be sent to the wrong destination or even data corruption. The previous circuit switching network therefore reserved a longer synchronization time window to avoid accidental communication without synchronization, but accordingly, when switching the routing endpoint, the communication delay of the optical network will increase significantly.

[0007] To address the above two issues, there is an urgent need for a new type of hardware DPU configured at the access node end that will be able to undertake corresponding tasks, reduce meaningless traffic in the auxiliary network, improve the communication efficiency of the auxiliary network, shorten the synchronization time window, and thus improve the global routing efficiency. Method and system. Summary of the Invention

[0008] In order to solve the problem in the prior art that the routing synchronization cost in the circuit-switched network increases significantly as the interconnection scale increases, the present invention proposes a peer-to-peer circuit-switched network networking method based on DPU.

[0009] In a first aspect, an embodiment of the present application provides a DPU-based peer-to-peer optical interconnection circuit switching networking method, the method comprising:

[0010] Collecting networking information of an optical interconnected circuit switching network and establishing a peer-to-peer networking model based on the networking information, wherein the peer-to-peer networking model includes: a primary network and an auxiliary network;

[0011] Based on the peer-to-peer networking model, access nodes equipped with DPU accelerator cards are set up between the primary network and the secondary network for interconnection;

[0012] DPU adopts peer-to-peer traffic agreement to realize a peer-to-peer optical interconnection circuit interactive network.

[0013] In a specific embodiment of the present invention, according to the peer-to-peer networking model, an access node equipped with a DPU accelerator card is provided between the primary network and the secondary network for interconnection and intercommunication, further comprising:

[0014] The DPU is connected to the auxiliary network via the first optical module cable to form a star topology data packet exchange network;

[0015] The DPU is connected to the main network through the second optical module, and the optical fiber on the second optical module is directly connected to the main network port;

[0016] Any two DPUs are directly connected through the second optical module cable.

[0017] In a specific embodiment of the present invention, the DPU adopts a peer-to-peer traffic agreement to implement a peer-to-peer optical interconnection circuit interaction network, further comprising:

[0018] The same routing decision and main network configuration calculation algorithm is used within any DPU;

[0019] Each time a DPU executes a routing reconstruction decision, the decision result is diffused by the auxiliary network to synchronize the routing status on all DPUs.

[0020] In a specific embodiment of the present invention, the DPU adopts a peer-to-peer traffic agreement including:

[0021] The DPU counts the inbound and outbound traffic demands from its own nodes, builds a priority queue, and decides the priority of the current traffic without hindering the communication of other nodes globally.

[0022] In a specific embodiment of the present invention, the DPU adopts a peer-to-peer traffic agreement including:

[0023] The time slice polling agreement divides a period of time into time slices corresponding to the number of DPUs, and stipulates that each DPU node has the highest routing decision-making power within its own time slice.

[0024] In a specific embodiment of the present invention, the DPU adopting the peer-to-peer traffic agreement further includes:

[0025] The DPU sets up a credit lookup table, which records the credit value corresponding to each routing endpoint. After a routing change occurs, the credit value corresponding to the changed routing endpoint is deducted. After a period of time, the credit value is restored. The absolute value of the credit value is used to determine whether the current DPU has the right to directly conduct local routing arbitration without having to synchronize with other nodes for arbitration.

[0026] In a specific embodiment of the present invention, the above-mentioned DPU stores global traffic information, and traffic priority screening is performed locally on the DPU.

[0027] In a second aspect, an embodiment of the present application provides a DPU-based peer-to-peer optical interconnection circuit switching networking system, which adopts the above-mentioned DPU-based peer-to-peer optical interconnection circuit switching networking method, and the system includes:

[0028] Information collection module: used to collect networking information of the optical interconnection circuit switching network and establish a peer-to-peer networking model based on the networking information, wherein the peer-to-peer networking model includes: a primary network and an auxiliary network;

[0029] DPU-based access node module: used to set up access nodes equipped with DPU accelerator cards between the primary network and the secondary network for interconnection based on the peer-to-peer networking model;

[0030] Peer-to-peer network building module: used by DPU to adopt peer-to-peer traffic agreements and realize a peer-to-peer optical interconnection circuit interaction network.

[0031] In a third aspect, an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the above-mentioned DPU-based peer-to-peer optical interconnection circuit switching networking method.

[0032] In a fourth aspect, an embodiment of the present application provides a DPU, comprising a memory, a dedicated acceleration unit, a processor, and a computer program stored in the memory and runnable on the processor. When the processor executes the program, the steps of the above-mentioned DPU-based peer optical interconnection circuit switching networking method are implemented.

[0033] Compared with the related existing technologies, it has the following outstanding beneficial effects:

[0034] 1) The method of the present invention proposes the use of a DPU on the access node side, so that the network no longer relies on a centralized switch arbitration unit, thus avoiding the problem caused by the separation of the control plane and the data plane in the optical interconnection network;

[0035] 2) The method of the present invention proposes a peer-to-peer network so that all access nodes have the perception of the current state of the data plane and consistent routing deduction. A large number of routing judgments can be run locally, which can reduce the communication pressure of the control plane. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0037] Figure 1 Schematic diagram of peer-to-peer optical interconnection circuit switching networking based on DPU of the present invention;

[0038] Figure 2 This is a schematic diagram of a network configuration according to a specific embodiment of the present invention;

[0039] Figure 3 This is a schematic diagram of a DPU accelerator card according to a specific embodiment of the present invention;

[0040] Figure 4 This is a diagram of the networking mode of the DPU accessing the hybrid network of the present invention;

[0041] Figure 5 This is a communication model diagram of a traditional composite network;

[0042] Figure 6 This is a flow chart of a route change request according to the present invention;

[0043] Figure 7 The diagram is a schematic diagram of a DPU-based peer-to-peer optical interconnection circuit switching networking system of the present invention. DETAILED DESCRIPTION

[0044] It should be noted that the processor described in the present invention is the control center of an electronic device and can be a single processor or a collective term for multiple processing elements. For example, it can be one or more central processing units (CPUs), an application-specific integrated circuit (ASIC), or one or more integrated circuits configured to implement embodiments of the present invention, such as one or more digital signal processors (DSPs) or one or more field programmable gate arrays (FPGAs).

[0045] Optionally, the processor can perform various functions of the electronic device by running or executing a software program stored in the memory, and calling data stored in the memory.

[0046] In a specific implementation, as an embodiment, the processor may include one or more CPUs. Each of these processors may be a single-core processor or a multi-core processor. The processor here may refer to one or more devices, circuits, and / or processing cores for processing data (e.g., computer program instructions). Electronic devices may include: servers, desktop computers, laptop computers, smartphones, tablet computers, embedded computers, etc., wherein the embedded computers include vehicles and robots, etc.

[0047] The memory is used to store the software program for executing the solution of the present invention, and the execution is controlled by the processor. The specific implementation method can refer to the above method embodiment and will not be repeated here.

[0048] It should be noted that the structure of the electronic device shown in the drawings of the present invention does not constitute a limitation thereto, and the actual knowledge structure recognition device may include more or fewer components than shown in the drawings, or a combination of certain components, or a different arrangement of components.

[0049] The above embodiments can be implemented in whole or in part through software, hardware (such as circuits), firmware, or any other combination. When implemented using software, the above embodiments can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer program are loaded or executed on a computer, the processes or functions described in accordance with the embodiments of the present invention are generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via a wired method (such as infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or data center that contains a collection of one or more available media. The available medium can be a magnetic medium (such as a floppy disk, hard disk, or magnetic tape), an optical medium (such as a DVD), or a semiconductor medium. The semiconductor medium can be a solid-state drive.

[0050] It should also be understood that the term "and / or" in this document simply describes an association between related objects, indicating that three possible relationships exist. For example, "A and / or B" can represent: A alone, A and B together, or B alone. A and B can be singular or plural. Furthermore, the character " / " in this document generally indicates an "or" relationship between the related objects, but it may also indicate an "and / or" relationship. For specific understanding, please refer to the context.

[0051] In this disclosure, "at least one" means one or more, and "plurality" means two or more. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, "at least one of a, b, or c" can mean: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or plural.

[0052] It should also be understood that in various embodiments of the present invention, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.

[0053] In the several embodiments provided by the present invention, it should be understood that the disclosed devices, apparatuses, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another device, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interface, indirect coupling or communication connection of the device or unit, which can be electrical, mechanical or other forms.

[0054] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0055] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0056] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0057] To illustrate the above-mentioned features and effects of the present invention more clearly and easily, the following embodiments are specifically described below with reference to the accompanying drawings. This specification discloses one or more embodiments incorporating the features of the present invention. The disclosed embodiments are for illustrative purposes only. The scope of protection of the present invention is not limited to the disclosed embodiments; the present invention is defined by the appended claims.

[0058] The following is a system embodiment corresponding to the above method embodiment. This embodiment can be implemented in conjunction with the above embodiment. The relevant technical details mentioned in the above embodiment are still valid in this embodiment and will not be repeated here to reduce repetition. Accordingly, the relevant technical details mentioned in this embodiment can also be applied to the above embodiment.

[0059] The present invention aims to propose a peer-to-peer optical interconnection circuit switching networking method and system based on DPU, so as to reduce the meaningless traffic of the auxiliary network, improve the communication efficiency of the auxiliary network, shorten the synchronization time window, and thus improve the global routing efficiency.

[0060] While conducting research on reconfigurable optical interconnection networks, the present inventors discovered that this deficiency in the prior art is primarily caused by inadequate processing units on the access node side. Existing access node processing units tend not to handle complex routing issues, instead handing them off to the switch side. However, as the scale of communications increases, handing all processing off to the switch side introduces serious communication overhead. Through research, the present inventors discovered that using DPU hardware on the access node side to handle routing issues and form a peer-to-peer network can effectively reduce the communication overhead of the auxiliary network, lower the synchronization cost of routing information, shorten latency, and thus improve the switching performance of the reconfigurable optical interconnection network.

[0061] The following is a detailed description with reference to specific embodiments:

[0062] Example 1

[0063] like Figure 1 As shown, the embodiment of the present application provides a peer-to-peer optical interconnection circuit switching networking method based on DPU. The method of the present invention can be applied to the following methods:

[0064] Step 101: collecting networking information of an optical interconnected circuit switching network and establishing a peer-to-peer networking model based on the networking information, wherein the peer-to-peer networking model includes: a primary network and an auxiliary network;

[0065] Step 102: According to the peer-to-peer networking model, an access node equipped with a DPU accelerator card is set between the primary network and the secondary network for interconnection;

[0066] In step 103, the DPU adopts a peer-to-peer traffic agreement to implement a peer-to-peer optical interconnection circuit interactive network.

[0067] In a specific embodiment of the present invention, the above step 102 further includes: setting an access node equipped with a DPU accelerator card between the primary network and the secondary network for interconnection and intercommunication according to the peer-to-peer networking model;

[0068] The DPU is connected to the auxiliary network through the first optical module cable to form a star topology data packet exchange network; the DPU is connected to the main network through the second optical module, and the optical fiber on the second optical module is directly connected to the main network port; any two DPUs are directly connected through the second optical module cable.

[0069] like Figure 2 As shown, in a specific embodiment of the present invention, a peer-to-peer optical interconnection circuit switching network based on DPU is a feasible implementation example. Figure 2 As shown in Figure 1, the switching network is divided into two independent networks: a primary network and a secondary network. The primary network is a reconfigurable optical interconnection network, such as a crossbar network or Benes network, and includes driver circuits. The secondary network can be Ethernet. Typically, there is a significant bandwidth difference between the primary and secondary networks, with the primary network bandwidth being more than 10 times that of the secondary network. The secondary network is used only to coordinate routing decisions and configuration changes for the primary network and is not used to transmit data traffic.

[0070] In a specific embodiment of the present invention, the driver circuit board corresponding to the primary network configuration is used to adjust the internal network topology. The driver circuit board can integrate a dedicated computational unit to calculate the mapping of a given routing request to the internal network topology, or it can integrate this computational unit on the access node side instead. However, if this is integrated, the same computational unit must be implemented in the DPU on the access node side to ensure consistent behavior.

[0071] like Figure 3 As shown, in a specific embodiment of the present invention, the access node can use an accelerator card equipped with a DPU, which should provide two input and output interfaces, corresponding to the interface requirements of the primary network and the auxiliary network respectively. In a specific embodiment of the present invention, for a 400G optical interconnection network, its primary network interface can use a 400G QSFP56-DD optical module, and the auxiliary network interface can use a 10G SFP+ module, but the present invention is not limited to this, and other types of optical modules can also be used.

[0072] Specifically, if Figure 4 As shown, in a specific embodiment of the present invention, the DPU is connected to the auxiliary network via a 10G SFP+ bidirectional optical module cable, forming a traditional star topology data packet exchange network. The access method of the main network is slightly different. A 400G QSFP56-DD optical module is used on the DPU side, but when accessing the main network side, the optical fiber on the optical module is directly connected to the main network port. In terms of working principle, for any two connected DPU nodes, the main network is equivalent to a section of optical fiber, that is, the two DPU nodes can be regarded as directly connected through a bidirectional 400G QSFP56-DD optical module cable without forwarding through a switch.

[0073] In a specific embodiment of the present invention, in step 103, the DPU adopts a peer-to-peer traffic agreement to implement a peer-to-peer optical interconnection circuit interaction network, further comprising:

[0074] The same routing decision and main network configuration calculation algorithm is used within any DPU;

[0075] Each time a DPU executes a routing reconstruction decision, the decision result is diffused by the auxiliary network to synchronize the routing status on all DPUs.

[0076] like Figure 5 Figure 2 shows the communication model of a traditional composite network. First, the access node initiates a routing request to the arbitration unit via the auxiliary network and awaits the arbitration unit's response. Depending on the result, if the request is allowed, data communication is initiated directly through the primary network. Otherwise, the node waits for a period of time before initiating another routing request to the arbitration unit. It's easy to see that with each request, the access node is unaware of and pays no attention to the current global routing situation, nor is it aware of the arbitration unit's decision-making logic. Therefore, it doesn't know which routes it requests will have the highest success rate, resulting in a large number of disallowed routing requests, or meaningless query traffic.

[0077] The arbitration unit is typically implemented using a dedicated ASIC or FPGA chip, but can also be implemented by a CPU or DPU. Unlike routing queries in the datagram exchange domain, the arbitration unit technology is designed to resolve routing conflicts. For example, if both a→c and b→c request simultaneously, it is necessary (according to certain rules) to determine which one to allow and which one to reject, as both requests cannot be satisfied simultaneously. Routing requests in this domain are satisfied by establishing corresponding point-to-point links. Therefore, only one link can be established at a time for the same output port, not two.

[0078] like Figure 6 The communication model of the technical solution of the present invention is shown in Figure 1. The arbitration unit is no longer a single unit, but is distributed across every participating DPU node. Each DPU card uses the same routing decision and primary network configuration calculation algorithms to ensure identical results when receiving the same input, achieving consistency independent of communication and avoiding the meaningless communication traffic caused by routing queries.

[0079] In a specific embodiment of the present invention, the DPU adopts a peer-to-peer traffic agreement including:

[0080] The DPU counts the inbound and outbound traffic demands from its own nodes, builds a priority queue, and decides the priority of the current traffic without hindering the communication of other nodes globally.

[0081] In a specific embodiment of the present invention, each time a node executes a routing reconstruction decision, the decision result is diffused by means of an auxiliary network to achieve synchronization of routing states.

[0082] To achieve more efficient global routing and avoid conflicts, access nodes in a peer-to-peer network employ conventions tailored to network traffic characteristics. In specific embodiments of the present invention, these conventions are implemented within the DPU. The DPU collects statistics on inbound and outbound traffic demand from its own node, builds priority queues, and determines which traffic should be processed first and least disruptive to other global nodes. Compared to traditional centralized solutions, the DPU at the access node in this solution has access to global traffic information. Therefore, traffic prioritization can be performed locally rather than at the switch, avoiding the additional communication with traditional switches and the resulting unnecessary traffic.

[0083] In a specific embodiment of the present invention, the DPU adopts a peer-to-peer traffic agreement including:

[0084] The time slice polling agreement divides a period of time into time slices corresponding to the number of DPUs, and stipulates that each DPU node has the highest routing decision-making power within its own time slice.

[0085] In a specific embodiment of the present invention, a typical protocol is a time-slice polling protocol, which evenly divides a period of time (typically a few to tens of μs) into N time slices, where N is the number of networked DPUs. Each DPU node is guaranteed the highest decision-making authority within its own time slice, thus avoiding the need for additional queries and waiting for results within that time slice, and also avoiding the corresponding meaningless communication traffic.

[0086] In a specific embodiment of the present invention, the DPU adopting the peer-to-peer traffic agreement further includes:

[0087] The DPU sets up a credit lookup table, which records the credit value corresponding to each routing endpoint. After a routing change occurs, the credit value corresponding to the changed routing endpoint is deducted. After a period of time, the credit value is restored. The absolute value of the credit value is used to determine whether the current DPU has the right to directly conduct local routing arbitration without having to synchronize with other nodes for arbitration.

[0088] Furthermore, a credit lookup table can be deployed on the DPU. A simple implementation would be: the node with the highest credit score has priority for selecting the current route destination. If that node declines, the node is replaced by a lower-ranking node based on credit score. This allows route arbitration to be performed within the DPU. After a route change, the credit score corresponding to the changed route destination is deducted based on the estimated communication time, and the system gradually restores the default after a period of time. The absolute value of the credit score determines whether the node is currently entitled to conduct local arbitration directly, without having to synchronize with other nodes before arbitration. This can avoid some unnecessary communication traffic.

[0089] The credit lookup table can be described as a matrix, with each row corresponding to a starting node and each column corresponding to a routing endpoint. The value obtained by selecting a row or column is the credit value from the corresponding starting point to the destination. The node's own credit value is periodically increased using a specific algorithm, and the credit values ​​of the remaining rows are synchronized through communication on the auxiliary network.

[0090] In a specific embodiment of the present invention, the above-mentioned DPU stores global traffic information, and traffic priority screening is performed locally on the DPU.

[0091] When the switch side chooses to integrate a dedicated hardware unit with the same behavior as the access node side, the communication traffic of the auxiliary network can be further reduced: the information transmission to the driver circuit is simplified from specific network configuration information to route change information. The corresponding network configuration information is calculated by the dedicated hardware unit on the switch side and passed to the driver circuit to complete the main network configuration.

[0092] Example 2

[0093] like Figure 7 As shown, an embodiment of the present application provides a DPU-based peer-to-peer optical interconnection circuit switching networking system, which adopts the above-mentioned DPU-based peer-to-peer optical interconnection circuit switching networking method, and the system includes:

[0094] Information collection module 201: used to collect networking information of the optical interconnection circuit switching network and establish a peer-to-peer networking model based on the networking information, wherein the peer-to-peer networking model includes: a primary network and an auxiliary network;

[0095] DPU-based access node module 202: used to set up access nodes equipped with DPU accelerator cards between the primary network and the secondary network for interconnection according to the peer-to-peer networking model;

[0096] The peer-to-peer network construction module 203 is used for the DPU to adopt peer-to-peer traffic agreement to realize a peer-to-peer optical interconnection circuit interactive network.

[0097] Example 3

[0098] An embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon. When the program is executed by a processor, the steps of the above-mentioned DPU-based peer-to-peer optical interconnection circuit switching networking method are implemented.

[0099] Example 4

[0100] like Figure 3 As shown, an embodiment of the present application provides a DPU, including a memory, a dedicated acceleration unit, a processor, and a computer program stored in the memory and runnable on the processor. When the processor executes the program, the steps of the above-mentioned DPU-based peer optical interconnection circuit switching networking method are implemented.

[0101] In summary, compared with existing technologies, this invention demonstrates that existing circuit-switched networks typically utilize a single centralized control node to make global routing decisions and control network status. When the number of network access nodes is large, the auxiliary network will be burdened with a large amount of meaningless communication traffic caused by node routing queries, which will degrade the performance of the auxiliary network and affect the reconstruction efficiency of the primary network. With this solution, each access node maintains a local global routing model of the network, moving routing queries to the local node. This avoids meaningless communication traffic, reduces pressure on the auxiliary network, increases the available reconstruction frequency of the network, and thus improves network switching performance.

[0102] The technical features of the above-mentioned embodiments can be combined arbitrarily. In order to make the description concise, not all possible combinations of the technical features in the above-mentioned embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0103] The above-described embodiments merely represent several implementation methods of the present application. While the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the present invention. It should be noted that a person skilled in the art could make various modifications and improvements without departing from the spirit of the present application, all of which fall within the scope of protection of the present application. Therefore, the scope of protection of the present patent application shall be determined by the appended claims.

Claims

1. A peer-to-peer optical interconnection circuit switching networking method based on DPU, characterized in that: The method comprises: Collecting networking information of an optical interconnected circuit switching network, and establishing a peer-to-peer networking model based on the networking information, wherein the peer-to-peer networking model includes: a primary network and an auxiliary network; According to the peer-to-peer networking model, an access node equipped with a DPU accelerator card is set between the primary network and the auxiliary network for interconnection; The DPU adopts a peer-to-peer traffic agreement to realize a peer-to-peer optical interconnection circuit interaction network; The DPU adopts a peer-to-peer traffic agreement including: The DPU counts the inbound and outbound traffic demands from its own nodes, builds a priority queue, and decides the priority of the current traffic without hindering the communication of other nodes globally. The time slice polling agreement divides a period of time into time slices corresponding to the number of DPUs, and stipulates that each DPU node has the highest routing decision-making power within its own time slice.

2. The DPU-based peer-to-peer optical interconnection circuit switching networking method according to claim 1, characterized in that: The method further includes: providing an access node equipped with a DPU accelerator card between the primary network and the secondary network for interconnection and intercommunication according to the peer-to-peer networking model; The DPU is connected to the auxiliary network via a first optical module cable to form a star topology data message switching network; The DPU is connected to the primary network through a second optical module, and the optical fiber on the second optical module is directly connected to the primary network port; Any two of the DPUs are directly connected via the second optical module cable.

3. The DPU-based peer-to-peer optical interconnection circuit switching networking method according to claim 1, characterized in that: The DPU adopts a peer-to-peer traffic agreement to implement a peer-to-peer optical interconnection circuit interaction network, further comprising: Any of the DPUs uses the same routing decision and main network configuration calculation algorithm; Each time the DPU executes a routing reconstruction decision, the auxiliary network diffuses the decision result to achieve synchronization of routing states on all the DPUs.

4. The DPU-based peer-to-peer optical interconnection circuit switching networking method according to claim 3, characterized in that: The DPU adopts a peer-to-peer traffic agreement that also includes: The DPU sets up a credit lookup table, which records the credit value corresponding to each route endpoint. After a route change occurs, the credit value corresponding to the changed route endpoint is deducted. After a period of time, the credit value is restored. The absolute value of the credit value is used to determine whether the current DPU has the right to directly conduct local route arbitration without having to synchronize with other nodes for arbitration.

5. The DPU-based peer-to-peer optical interconnection circuit switching networking method according to claim 3, characterized in that: The DPU stores global traffic information, and traffic priority screening is performed locally on the DPU.

6. A DPU-based peer-to-peer optical interconnection circuit switching networking system, using the DPU-based peer-to-peer optical interconnection circuit switching networking method according to any one of claims 1 to 5, characterized in that: The system comprises: An information collection module is configured to collect networking information of an optical interconnected circuit switching network and establish a peer-to-peer networking model based on the networking information, wherein the peer-to-peer networking model includes a primary network and an auxiliary network; DPU-based access node module: used to set up access nodes equipped with DPU accelerator cards between the primary network and the auxiliary network for interconnection according to the peer-to-peer networking model; Peer-to-peer network building module: used for the DPU to adopt peer-to-peer traffic agreement to realize the peer-to-peer optical interconnection circuit interaction network.

7. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the steps of the DPU-based peer-to-peer optical interconnection circuit switching networking method according to any one of claims 1 to 5 are implemented.

8. A DPU comprising a memory, a dedicated acceleration unit, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the steps of the DPU-based peer-to-peer optical interconnection circuit switching networking method are implemented as described in any one of claims 1 to 5.

Images