Routing information processing method and device with asymmetric routing

Abstract

The embodiment of the invention provides an asymmetric routing information processing method and device. The method comprises the following steps: acquiring a target bandwidth and a source bandwidth of a first-stage switching matrix SF1; determining a first weight coefficient according to the target bandwidth and the source bandwidth, and distributing the target bandwidth to a source end switch access SA according to the first weight coefficient; and determining a second weight coefficient according to the duty ratio of the effective link of the source end SA, and allocating the target bandwidth allocated to the source end SA to the effective link of the source end SA according to the second weight coefficient so as to realize a routing information processing process. According to the invention, the problems of local congestion and packet loss when the first-stage switching matrix SF1 in the three-stage switching networking system generates asymmetry are solved, and the effect that the flow distribution of the three-stage switching networking system is smoother and more uniform is achieved.

Description

Technical Field

[0001] The embodiments of the present invention relate to the field of communications, and in particular, to a method and device for processing routing information with asymmetric routing. Background Art

[0002] The three-level switching networking of the packet switching system refers to the networking mode in which the data sent by the source switch access (SA) first passes through the switch fabric (SF) configured in SF1 mode, then is switched by the SF configured in SF2 mode, and finally reaches the destination SA through the SF configured in SF3 mode, where the SF1 mode and SF3 mode are respectively a component of the SF, and together they form a complete SF. With the development of packet switching technology, when the source SA and the destination SA are on the same side of SF1, that is, the destination SA is at the proximal position of SF1, the data sent by the source SA can be directly forwarded to the destination SA through SF1 without passing through the intermediate SF2.

[0003] For the switching SF, the total bandwidth of the source link input must be less than or equal to the physical bandwidth that the destination link can carry, to ensure that the switching SF will not be congested. When the switching SF causes the destination link carrying bandwidth to decrease due to some abnormality or in certain application scenarios, the input bandwidth will be greater than the output bandwidth, which is called asymmetry. Asymmetry can cause congestion inside the switching system, resulting in a decrease in switching performance. For the switching SF, by calculating the bandwidth of the destination link to close the source link routing and reduce the transmission of source traffic, SF congestion can be avoided. For the first-level switching SF1, when the destination is the remote SA, the calculation of the SF1 destination bandwidth is the bandwidth of all shared links at the export, while the calculation of the source bandwidth is the bandwidth of the SA inlet exclusive link. The bandwidth of the SA inlet exclusive link is generally much smaller than the bandwidth of all shared links at the export. The existing asymmetric application of SF1 is very limited, and the traffic distribution on the switching system is also prone to unevenness, resulting in local congestion and packet loss when the first-level switching matrix SF1 in the three-level switching networking system is asymmetric. Summary of the invention

[0004] The embodiment of the present invention provides a method and device for processing routing information with asymmetric routing, so as to at least solve the problem of local congestion and packet loss when the first-level switching matrix SF1 in a three-level switching networking system in the related art generates asymmetry.

[0005] According to one embodiment of the present invention, a method for processing routing information with asymmetric routing is provided, comprising: obtaining a destination bandwidth and a source bandwidth of a first-level switching matrix SF1; determining a first weight coefficient according to the destination bandwidth and the source bandwidth, and allocating the destination bandwidth to a source switching access SA according to the first weight coefficient; determining a second weight coefficient according to a duty cycle of an effective link of the source SA, and allocating the destination bandwidth allocated to the source SA to the effective link of the source SA according to the second weight coefficient, so as to realize routing information processing.

[0006] According to another embodiment of the present invention, there is provided a routing information processing device with asymmetric routing, comprising: a bandwidth acquisition module, used to acquire the destination bandwidth and source bandwidth of a first-level switching matrix SF1; a first allocation module, used to determine a first weight coefficient according to the destination bandwidth and the source bandwidth, and allocate the destination bandwidth to a source-end switching access SA according to the first weight coefficient; a second allocation module, used to determine a second weight coefficient according to a duty cycle of an effective link of the source-end SA, and allocate the destination bandwidth allocated to the source-end SA to the effective link of the source-end SA according to the second weight coefficient, so as to realize routing information processing.

[0007] According to yet another embodiment of the present invention, a computer-readable storage medium is provided, in which a computer program is stored, wherein the computer program is configured to execute the steps of any one of the above method embodiments when run.

[0008] According to yet another embodiment of the present invention, there is provided an electronic device, including a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.

[0009] Through the present invention, a method for processing routing information with asymmetric routing is provided, by obtaining the destination bandwidth and source bandwidth of the first-level switching matrix SF1; determining a first weight coefficient according to the destination bandwidth and the source bandwidth, and allocating the destination bandwidth to the source-end switching access SA according to the first weight coefficient; determining a second weight coefficient according to the duty cycle of the effective link of the source-end SA, and allocating the destination bandwidth allocated to the source-end SA to the effective link of the source-end SA according to the second weight coefficient, so as to realize the routing information processing process. The problem of local congestion and packet loss when the first-level switching matrix SF1 in the three-level switching networking system in the related art is solved, and the flow distribution of the three-level switching networking system is smoother and more uniform. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] Figure 1 It is a schematic diagram of a three-level switching network structure in the related technology;

[0011] Figure 2 It is a hardware structure block diagram of a computer terminal of a method for processing routing information with asymmetric routing according to an embodiment of the present invention;

[0012] Figure 3 is a flow chart of a method for processing routing information with asymmetric routing according to an embodiment of the present invention;

[0013] Figure 4 Schematic diagram of the far / near end of the three-level switching network structure SF1 according to an embodiment of the present invention;

[0014] Figure 5 is a structural block diagram of a routing information processing device for asymmetric routing according to an embodiment of the present invention;

[0015] Figure 6 It is a flowchart of a method for processing routing information with asymmetric routing according to a scenario embodiment of the present invention. DETAILED DESCRIPTION

[0016] Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings and in combination with the embodiments.

[0017] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.

[0018] Figure 1 This is a schematic diagram of the three-level switching network structure in the related technology, such as Figure 1 As shown, the three-level switching networking structure of the packet switching system in the related art, the three-level switching networking means that the data sent by the source SA passes through the SF three times before reaching the destination SA, that is, the data sent by the source SA first passes through the SF configured in SF1 mode, then is exchanged by the SF configured in SF2 mode, and finally reaches the destination SA through the SF configured in SF13 mode. When the destination SA is at the proximal position of SF1, the data sent by the source SA can also be directly forwarded to the destination SA through SF1 without passing through the intermediate level SF2.

[0019] For the first-level switching SF1, when the destination is a remote SA, the calculation of the SF1 destination bandwidth is the bandwidth of all shared links at the export, while the calculation of the source bandwidth is the bandwidth of the SA inlet exclusive link. The bandwidth of the SA inlet exclusive link is generally much smaller than the bandwidth of all shared links at the export. Therefore, it is difficult for the existing SF1 asymmetry to achieve the expected effect, and when calculating the SF1 asymmetry, it does not distinguish whether the destination SA is a remote SA or a near-end SA. The existing SF1 asymmetric application has great limitations.

[0020] At the same time, when the existing asymmetric solution closes the source route, it adopts a random or source SA link order allocation method in link selection, and directly closes the corresponding link route, that is, the link is either on or off, so the traffic distribution on the switching system may also be uneven.

[0021] The method embodiments provided in the embodiments of the present application can be executed in a mobile terminal, a computer terminal or a similar computing device. Taking running on a computer terminal as an example, Figure 2 FIG. 1 is a hardware structure block diagram of a computer terminal of a method for processing routing information with asymmetric routing according to an embodiment of the present invention. Figure 2 As shown, the computer terminal may include one or more ( Figure 2 Only one is shown in the figure) a processor 202 (the processor 202 may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 204 for storing data, wherein the above-mentioned computer terminal may also include a transmission device 206 and an input and output device 208 for communication functions. It can be understood by those skilled in the art that Figure 2 The structure shown is only for illustration and does not limit the structure of the above-mentioned computer terminal. Figure 2 More or fewer components as shown, or with Figure 1 Different configurations are shown.

[0022] The memory 204 can be used to store computer programs, for example, software programs and modules of application software, such as the computer program corresponding to the routing information processing method with asymmetric routing in the embodiment of the present invention. The processor 202 executes various functional applications and data processing by running the computer program stored in the memory 204, that is, to implement the above method. The memory 204 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 204 may further include a memory remotely arranged relative to the processor 202, and these remote memories may be connected to the computer terminal via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0023] The transmission device 206 is used to receive or send data via a network. The specific example of the above network may include a wireless network provided by a communication provider of the mobile terminal. In one example, the transmission device 206 includes a network adapter (Network Interface Controller, NIC), which can be connected to other network devices through a base station so as to communicate with the Internet. In one example, the transmission device 206 can be a radio frequency (RF) module, which is used to communicate with the Internet wirelessly.

[0024] In this embodiment, a method for processing routing information with asymmetric routing running on the above-mentioned computer terminal is provided. Figure 3 is a flow chart of a method for processing routing information with asymmetric routing according to an embodiment of the present invention. Figure 3 As shown, the process includes the following steps:

[0025] Step S302, obtaining the destination bandwidth and source bandwidth of the first-level switching matrix SF1;

[0026] In an exemplary embodiment, before obtaining the destination bandwidth and source bandwidth of the first-level switching matrix SF1, the method further includes: setting a first marking signal and a second marking signal for the SA and the switching link of the first-level switching matrix SF1, respectively, wherein the first marking signal is used to indicate that the SA is a near-end SA or a far-end SA, and the second marking signal is used to indicate that the switching link is a near-end link or a far-end link.

[0027] In actual implementation, the near-end and far-end situations can be distinguished by marking signals. Figure 4 Schematic diagram of the far / near end of the three-stage switching network structure SF1 according to an embodiment of the present invention. Figure 4 As shown, for SF1, the two SAs on the left are proximal SAs, and the two SAs on the right are distal SAs. The number of the above SAs is only for example and is not a specific limitation.

[0028] In an exemplary embodiment, obtaining the destination bandwidth and source bandwidth of the first switching matrix SF1 includes: obtaining a destination bitmap of the destination SA and a source bitmap of the source SA according to the second marking signal; and obtaining the destination bandwidth and the source bandwidth according to the destination bitmap and the source bitmap, respectively.

[0029] In actual implementation, bitmap is usually used to represent the path connection relationship between the current chip and the target SA chip. The specific method of obtaining the bandwidth according to the bitmap can be implemented using conventional technologies in the field, which will not be repeated here.

[0030] In actual implementation, depending on whether the destination SA is a remote SA or a local SA, the specific bandwidth (including the destination bandwidth and the source bandwidth) is calculated differently.

[0031] In an exemplary embodiment, the destination bandwidth and the source bandwidth are obtained according to the destination bitmap and the source bitmap, respectively, including: when the destination SA is a remote SA, the destination bandwidth is the effective link bandwidth of the effective link connected to the remote exit of SF1, and the source bandwidth is the sum of the effective link bandwidths of all near-end SAs connected to SF1. In an exemplary embodiment, the destination bandwidth and the source bandwidth are obtained according to the destination bitmap and the source bitmap, respectively, and also including: when the destination SA is a near-end SA, the destination bandwidth is the sum of the effective link bandwidths of the near-end SAs connected to SF1, and the source bandwidth is the effective link bandwidth of each near-end SA connected to SF1.

[0032] Step S304, determining a first weight coefficient according to the destination bandwidth and the source bandwidth, and allocating the destination bandwidth to the source switching access SA according to the first weight coefficient;

[0033] In an exemplary embodiment, the first weight coefficient is determined based on the destination bandwidth and the source bandwidth, including: when the destination SA is a remote SA, the first weight coefficient is the ratio of the effective link bandwidth of each source SA to the destination bandwidth; when the destination SA is a near-end SA, each destination SA corresponds to a source SA, and the first weight coefficient is 1.

[0034] In the actual implementation process, the first weight coefficient is for different SAs, and as mentioned above, the first weight coefficient has different values ​​depending on whether the destination SA is a remote SA or a proximal SA. In addition, in the actual implementation process, the initial value of the effective link bandwidth weight coefficient of each source SA is configured according to the topology structure and link weight of the switching network, and the effective link bandwidth of the source SA is calculated in the process of sending routing information from each destination SA to the source end in SF1 to update the weight coefficient.

[0035] Step S306, determining a second weight coefficient according to the duty cycle of the effective link of the source SA, and allocating the destination bandwidth allocated to the source SA to the effective link of the source SA according to the second weight coefficient to implement routing information processing.

[0036] In the actual implementation process, the second weight coefficient is for different valid links of the same SA, and the specific value is related to the bandwidth ratio that the valid link can carry. The source SA determines the amount of traffic that can be sent by the link according to the duty cycle of the received routing information RI. The relationship between the specific duty cycle and the amount of traffic that can be sent by the link will be described in detail in the subsequent scenario embodiments, and will not be repeated here.

[0037] In an exemplary embodiment, the method further includes: SF1 sending routing information to the source end SA, wherein the routing information is used to indicate the first weight coefficient and the second weight coefficient.

[0038] Through the above steps, a method for processing routing information with asymmetric routing is provided, by obtaining the destination bandwidth and source bandwidth of the first-level switching matrix SF1; determining a first weight coefficient according to the destination bandwidth and the source bandwidth, and allocating the destination bandwidth to the source-end switching access SA according to the first weight coefficient; determining a second weight coefficient according to the duty cycle of the effective link of the source-end SA, and allocating the destination bandwidth allocated to the source-end SA to the effective link of the source-end SA according to the second weight coefficient, so as to realize routing information processing. Through the present invention, the problem of local congestion and packet loss when the first-level switching matrix SF1 in the three-level switching networking system in the related art is solved, and the flow distribution of the three-level switching networking system is smoother and more uniform.

[0039] Through the description of the above implementation methods, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course can also be implemented by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present invention, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, a magnetic disk, or an optical disk), and includes a number of instructions for enabling a terminal device (which can be a mobile phone, a computer, a server, or a network device, etc.) to execute the methods described in each embodiment of the present invention.

[0040] In this embodiment, a routing information processing device with asymmetric routing is also provided, which is used to implement the above-mentioned embodiments and preferred implementation modes, and the descriptions that have been made will not be repeated. As used below, the term "module" can implement a combination of software and / or hardware of a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.

[0041] Figure 5 is a structural block diagram of a routing information processing device for asymmetric routing according to an embodiment of the present invention. Figure 5As shown, the routing information processing device 50 includes: a bandwidth acquisition module 510, used to obtain the destination bandwidth and source bandwidth of the first-level switching matrix SF1; a first allocation module 520, used to determine a first weight coefficient according to the destination bandwidth and the source bandwidth, and allocate the destination bandwidth to the source-end switching access SA according to the first weight coefficient; a second allocation module 530, used to determine a second weight coefficient according to the duty cycle of the effective link of the source-end SA, and allocate the destination bandwidth allocated to the source-end SA to the effective link of the source-end SA according to the second weight coefficient, so as to realize routing information processing.

[0042] In an exemplary embodiment, the routing information processing device 50 may further include: a marking module, used to set a first marking signal and a second marking signal for the SA and the switching link of the first-level switching matrix SF1, respectively, wherein the first marking signal is used to indicate that the SA is a proximal SA or a distal SA, and the second marking signal is used to indicate that the switching link is a proximal link or a distal link.

[0043] In an exemplary embodiment, the bandwidth acquisition module 510 may include: a bitmap acquisition unit, used to acquire a destination bitmap of the destination SA and a source bitmap of the source SA according to the second marking signal; a bandwidth acquisition unit, used to acquire a destination bandwidth and a source bandwidth according to the destination bitmap and the source bitmap, respectively.

[0044] In an exemplary embodiment, the bandwidth acquisition unit acquires bandwidth differently depending on the specific situation that the target SA is a remote SA or a near-end SA. In the case that the target SA is a remote SA, the target bandwidth is the effective link bandwidth of the effective link connected to the remote exit of SF1, and the source bandwidth is the sum of the effective link bandwidths of all near-end SAs connected to SF1. In the case that the target SA is a near-end SA, the target bandwidth is the sum of the effective link bandwidths of the near-end SAs connected to SF1, and the source bandwidth is the effective link bandwidth of each near-end SA connected to SF1.

[0045] In an exemplary embodiment, the first allocation module 520 determines the first weight coefficient according to the destination bandwidth and the source bandwidth in the following specific manner: when the destination SA is a remote SA, the first weight coefficient is the ratio of the effective link bandwidth of each source SA to the destination bandwidth; when the destination SA is a near-end SA, each destination SA corresponds to a source SA, and the first weight coefficient is 1.

[0046] In an exemplary embodiment, the routing information processing device 50 may further include: a routing sending module, which is used to send routing information to the source end SA, wherein the routing information is used to indicate the first weight coefficient and the second weight coefficient. In the actual implementation process, the routing sending module may be set in SF1.

[0047] It should be noted that the above modules can be implemented by software or hardware. For the latter, it can be implemented in the following ways, but not limited to: the above modules are all located in the same processor; or the above modules are located in different processors in any combination.

[0048] An embodiment of the present invention further provides a computer-readable storage medium, in which a computer program is stored, wherein the computer program is configured to execute the steps of any of the above method embodiments when running.

[0049] In an exemplary embodiment, the computer-readable storage medium may include, but is not limited to, various media that can store computer programs, such as a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk.

[0050] An embodiment of the present invention further provides an electronic device, including a memory and a processor, wherein a computer program is stored in the memory, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.

[0051] In an exemplary embodiment, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor, and the input / output device is connected to the processor.

[0052] For specific examples in this embodiment, reference may be made to the examples described in the above embodiments and exemplary implementation modes, and this embodiment will not be described in detail herein.

[0053] Obviously, those skilled in the art should understand that the above modules or steps of the present invention can be implemented by a general computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, they can be implemented by a program code executable by a computing device, so that they can be stored in a storage device and executed by the computing device, and in some cases, the steps shown or described can be executed in a different order than here, or they can be made into individual integrated circuit modules, or multiple modules or steps therein can be made into a single integrated circuit module for implementation. Thus, the present invention is not limited to any specific combination of hardware and software.

[0054] In order to enable those skilled in the art to better understand the technical solution of the present invention, it is described below in conjunction with specific scenario embodiments.

[0055] Scenario Example 1

[0056] Figure 6 : is a schematic diagram of a method for processing routing information with asymmetric routing according to an embodiment of the present invention, such as Figure 6 As shown, firstly, the destination bandwidth calculation and source bandwidth calculation are performed and effective link statistics are performed, and then the destination bandwidth is allocated, which can be implemented by constructing a destination bandwidth allocation device in SF1, wherein the destination bandwidth allocation device can be a chip product. Finally, link bandwidth allocation and routing information (RI) are sent to implement routing information processing.

[0057] In this scenario embodiment, the sending of routing information RI from SF1 to the source SA is determined by calculating the physical bandwidth of all links at the source end and the destination end of SF1 respectively. The source end routing is closed to reduce the traffic that can be sent by the source end, thereby avoiding congestion in SF1.

[0058] Step 1: Configure a group of near / far SA marking signals sa_id_mode and a group of link marking signals link tag in SF1. The sa_id_mode signal corresponds one-to-one to the destination SA of SF1. sa_id_mode equals to 0, indicating that the destination SA corresponding to SF1 is the near-end SA. sa_id_mode equals to 1, indicating that the destination SA corresponding to SF1 is the far-end SA. The link tag signal corresponds one-to-one to the link of SF1. Link tag equals to 0, indicating that the destination corresponding to the link is the near-end SA and is the near-end link of SF1. Link tag equals to 1, indicating that the destination corresponding to the link is the far-end SA and is the far-end link of SF1.

[0059] Step 2: Determine whether the destination SA is a remote SA or a local SA according to the sa_id_mode signal, and calculate the destination link bandwidth (ie, destination bandwidth) and the source link bandwidth (ie, source bandwidth) according to the link tag signal.

[0060] If the destination of SF1 is a remote SA, the destination bitmap corresponding to the remote link is distinguished through the link tag (the bitmap represents the path connection relationship between the chip and the destination SA chip) to calculate the destination bandwidth, where the destination bandwidth is the effective link bandwidth of the effective link connected to the remote exit of SF1. Then, the source bitmap corresponding to the proximal link is distinguished through the link tag and the number of effective links and its bandwidth of each source SA are calculated, where the sum of the effective link bandwidths of all proximal SAs is the source bandwidth.

[0061] If the destination of SF1 is the proximal SA, the destination bitmap corresponding to the proximal link is distinguished by the link tag and the destination bandwidth is calculated, where the destination bandwidth is the sum of the effective link bandwidths of the proximal SAs connected to SF1. The source bitmap corresponding to the proximal link is distinguished by the link tag and the number of effective links and bandwidth of each source SA are calculated, where the source bandwidth is the effective link bandwidth of each proximal SA connected to SF1.

[0062] Step 3: A destination bandwidth allocation device is set in SF1. In the asymmetric calculation process of SF1, the effective link bandwidth of each source SA is counted for each destination SA, and the destination bandwidth is allocated to each source SA according to the weight ratio according to the effective link bandwidth of the source SA. The initial value of the effective link bandwidth weight coefficient of each source SA is configured according to the topological structure and link weight of the switching network, and the effective link bandwidth of the source SA is calculated in the process of sending routing information from each destination SA to the source end in SF1. Update weight coefficient.

[0063] For SF1, the destination is the remote SA, and the source considered in the asymmetric calculation is all the near-end SAs. The bandwidth weight of each SA is the effective link bandwidth of a single source SA / destination bandwidth, that is, the first weight coefficient is the ratio of the effective link bandwidth of each source SA to the destination bandwidth.

[0064] For SF1, the destination is the near-end SA, and the source considered in the asymmetric calculation is each individual SA, that is, each destination SA corresponds to a source SA, so their bandwidth weight coefficients are all 1.

[0065] Step 4: Allocate the bandwidth allocated to each source SA according to the weight of each link of the source SA. The link bandwidth weight is configured according to the ratio of the actual physical link bandwidth.

[0066] Step 5: When sending routing information RI to the source SA link, according to the traffic allocated to each link, in this scenario embodiment, a 5-bit routing information RI is designed to indicate the bandwidth ratio that the link can carry. For example, if the routing information RI of a link is 5`b11111, it means that the link can send traffic with full physical bandwidth; if the routing information RI is 5`b10000, it means that the link can only send traffic with 20% of the physical bandwidth. The source SA determines the amount of traffic that the link can send based on the duty cycle of the received routing information RI.

[0067] In summary, the embodiment of the present invention provides a method and device for processing routing information with asymmetric routing, which can solve the asymmetric congestion situation in the three-level switching network SF1 of the packet switching system. When the destination of the first-level switching SF1 is the remote SA, its destination bandwidth is calculated according to the bandwidth of the effective link of the remote export of SF1, and the source bandwidth is the sum of the effective link bandwidths of all near-end SAs connected to SF1, and the routing information is sent to the source link according to the destination bandwidth. When the destination of SF1 is the near-end SA, its destination bandwidth is the sum of the link bandwidth between SF1 and the near-end SA, and its source bandwidth is the link bandwidth of each near-end independent SA connected to SF1, and the routing information is also sent to the source link according to the destination bandwidth. SF1 can be provided with a destination bandwidth allocation device, which counts the effective link bandwidth of each source SA for each destination SA during the asymmetric calculation process of SF1, and allocates the destination bandwidth to each source SA according to the weight ratio according to the effective link bandwidth of the source SA. When sending routing information to the source SA link, it is allocated to the effective link of the SA according to the link weight according to the bandwidth allocated to each source SA. A 5-bit routing information RI can be used to represent the bandwidth ratio that a link can carry. The source SA determines the amount of traffic that can be sent by the link based on the duty cycle of the received routing information RI.

[0068] Compared with the SF1 asymmetry of the prior art, which directly closes a source link when the source bandwidth is greater than the destination bandwidth, the routing information processing method and device provided by the embodiment of the present invention with asymmetric routing distinguishes whether the destination of SF1 is a remote SA or a near-end SA, calculates the destination SA bandwidth and the source SA bandwidth respectively, and distributes the destination bandwidth to the source SA according to the weight. The asymmetric routing sending processing method provided by the present invention reasonably allocates the link bandwidth, and at the same time, when reducing the source link bandwidth, avoids the non-on and off state of the link routing, making the system traffic distribution smoother and more uniform.

[0069] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for processing routing information with asymmetric routing, characterized in that: include: Obtain the destination bandwidth and source bandwidth of the first-level switching matrix SF1; Determine a first weight coefficient according to the destination bandwidth and the source bandwidth, and allocate the destination bandwidth to the source switching access SA according to the first weight coefficient; A second weight coefficient is determined according to the duty cycle of the effective link of the source SA, and the destination bandwidth allocated to the source SA is allocated to the effective link of the source SA according to the second weight coefficient to realize routing information processing.

2. The method according to claim 1, characterized in that Before obtaining the destination bandwidth and source bandwidth of the first-level switching matrix SF1, the method further includes: A first marking signal and a second marking signal are respectively set for the SA and the switching link of the first-level switching matrix SF1, wherein the first marking signal is used to indicate that the SA is a near-end SA or a far-end SA, and the second marking signal is used to indicate that the switching link is a near-end link or a far-end link.

3. The method according to claim 2, characterized in that The obtaining of the destination bandwidth and the source bandwidth of the first switching matrix SF1 includes: Acquire a destination bitmap of the destination SA and a source bitmap of the source SA according to the second marking signal; The destination bandwidth and the source bandwidth are obtained according to the destination bitmap and the source bitmap respectively.

4. The method according to claim 3, characterized in that Acquiring the destination bandwidth and the source bandwidth according to the destination bitmap and the source bitmap respectively, including: In the case where the destination SA is a remote SA, the destination bandwidth is the effective link bandwidth of the effective link connected to the remote egress of the SF1, and the source bandwidth is the sum of the effective link bandwidths of all the near-end SAs connected to the SF1.

5. The method according to claim 3, characterized in that: The method further comprises: obtaining the destination bandwidth and the source bandwidth according to the destination bitmap and the source bitmap respectively. In the case that the destination SA is a proximal SA, the destination bandwidth is the sum of the effective link bandwidths of the proximal SAs connected to the SF1, and the source bandwidth is the effective link bandwidth of each proximal SA connected to the SF1.

6. The method according to claim 1, characterized in that Determining a first weight coefficient according to the destination bandwidth and the source bandwidth includes: In the case where the destination SA is a remote SA, the first weight coefficient is a ratio of the effective link bandwidth of each source SA to the destination bandwidth; In the case that the destination SA is a proximal SA, each destination SA corresponds to one source SA, and the first weight coefficient is 1.

7. The method according to claim 1, characterized in that Also includes: The routing information sent by the SF1 to the source end SA, wherein the routing information is used to indicate the first weight coefficient and the second weight coefficient.

8. A routing information processing device with asymmetric routing, characterized in that: include: A bandwidth acquisition module, used to acquire the destination bandwidth and source bandwidth of the first-level switching matrix SF1; A first allocation module, configured to determine a first weight coefficient according to the destination bandwidth and the source bandwidth, and allocate the destination bandwidth to the source switching access SA according to the first weight coefficient; The second allocation module is used to determine a second weight coefficient according to the duty cycle of the effective link of the source SA, and allocate the destination bandwidth allocated to the source SA to the effective link of the source SA according to the second weight coefficient to realize routing information processing.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, wherein the computer program implements the method described in any one of claims 1 to 7 when executed by a processor.

10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the method described in any one of claims 1 to 7 is implemented.

Images