CN111010330B - Method, device and medium for detecting and recovering congested link - Google Patents
Method, device and medium for detecting and recovering congested link Download PDFInfo
- Publication number
- CN111010330B CN111010330B CN201911241276.8A CN201911241276A CN111010330B CN 111010330 B CN111010330 B CN 111010330B CN 201911241276 A CN201911241276 A CN 201911241276A CN 111010330 B CN111010330 B CN 111010330B
- Authority
- CN
- China
- Prior art keywords
- response
- detection
- probability value
- messages
- threshold value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 238000001514 detection method Methods 0.000 claims abstract description 89
- 230000004044 response Effects 0.000 claims abstract description 80
- 238000004590 computer program Methods 0.000 claims description 9
- 230000003247 decreasing effect Effects 0.000 claims description 4
- 238000011084 recovery Methods 0.000 abstract description 3
- 230000006870 function Effects 0.000 description 8
- 239000000523 sample Substances 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 230000001360 synchronised effect Effects 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000000844 transformation Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/46—Interconnection of networks
- H04L12/4633—Interconnection of networks using encapsulation techniques, e.g. tunneling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/46—Interconnection of networks
- H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/38—Flow based routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method, equipment and readable medium for detecting and recovering a congested link, wherein the method comprises the following steps: sending a plurality of detection messages and receiving corresponding response messages, and judging whether the times of the first time length from the sending of the detection messages to the receiving of the corresponding response messages exceeding a detection time threshold value in a preset time is greater than a first threshold value; in response to the fact that the number of times that a first time length from the sending of the detection message to the receiving of the corresponding response message exceeds a detection time threshold value within a preset time is larger than a first threshold value, determining that the current link is in a congestion state, and transferring the flow of the current link based on a preset routing probability value; in response to entering the next detection period, judging whether the current link is congested again based on the previous steps; in response to current link congestion, a routing probability value is increased. The scheme of the invention quickly judges whether the congestion exists by detecting the detection time and calculates the routing probability value by combining the dichotomy, thereby realizing the recovery of the congested link.
Description
Technical Field
The present invention relates to the field of data transmission, and more particularly, to a method, device and readable medium for detecting and recovering a congested link.
Background
An EVPN (Ethernet Virtual Private Network) may include multiple data centers, and the data centers are connected by VTEP (Virtual Tunnel end Point). Link load sharing and link backup can be realized among the VTEPs through a plurality of Vxlan (Virtual external Local Area Network) tunnels, and when link congestion occurs in the Vxlan tunnels, the Vxlan tunnels cannot be recovered in the prior art.
Disclosure of Invention
In view of this, an object of the embodiments of the present invention is to provide a method, a device, and a medium for detecting and recovering a congested link, where link congestion parameters between Vxlan tunnels are detected through an ICMP (Internet Control Message Protocol) Message, and whether a Vxlan tunnel link is congested is quickly determined; part of traffic is forwarded to other Vxlan tunnels through the VTEP routing probability value parameters, so that the traffic burden of the congested tunnels is relieved; and calculating a routing probability value parameter by combining a dichotomy, and realizing the optimal switching of the flow of the congested link, thereby realizing the recovery of the congested link.
Based on the above object, an aspect of the embodiments of the present invention provides a method for detecting and recovering a congested link, including the following steps: sending a plurality of detection messages and receiving corresponding response messages, and judging whether the times of the first time length from the sending of the detection messages to the receiving of the corresponding response messages exceeding a detection time threshold value in a preset time is greater than a first threshold value; in response to the fact that the number of times that a first time length from the sending of the detection message to the receiving of the corresponding response message exceeds a detection time threshold value within a preset time is larger than a first threshold value, determining that the current link is in a congestion state, and transferring the flow of the current link based on a preset routing probability value; in response to entering the next detection period, judging whether the current link is congested again based on the previous steps; and responding to the congestion of the current link, increasing the routing probability value and transferring the flow of the current link based on the increased routing probability value.
In some embodiments, increasing the routing probability value comprises: increasing the routing probability value based on:
Xn＝(Xn-1+100％)/2(n≥2)
wherein, XnIndicating a routing probability value, X, for the nth probing cyclen-1Indicating the routing probability value of the (n-1) th probing cycle.
In some embodiments, further comprising: in response to the current link not being congested, decreasing the routing probability value.
In some embodiments, the reducing the routing probability value comprises: and modifying the routing probability value into the average value of the routing probability value of the current detection period and the routing probability value of the last detection period.
In some embodiments, further comprising: and in response to the fact that the number of times that the first time length from the detection message sending to the corresponding response message receiving exceeds the detection time threshold value in the preset time is not more than a first threshold value, judging whether the number of times that the difference value between the first time lengths corresponding to every two detection messages exceeds the link stability parameter threshold value is more than a second threshold value.
In some embodiments, further comprising: and judging whether the ratio of the number of the response messages to the number of the detection messages is greater than a response parameter threshold value or not in response to the fact that the number of times that the difference value between the first time lengths corresponding to every two detection messages exceeds the link stability parameter threshold value is not greater than a second threshold value.
In some embodiments, further comprising: and judging whether the ratio of the number of the response messages to the number of the detection messages is zero or not in response to the fact that the ratio of the number of the response messages to the number of the detection messages is not larger than the response parameter threshold.
In some embodiments, further comprising: and modifying the routing probability value to be 100% in response to the condition that the ratio of the number of the response messages to the number of the detection messages is zero.
In another aspect of the embodiments of the present invention, there is also provided a computer device, including: at least one processor; and a memory storing computer instructions executable on the processor, the instructions when executed by the processor implementing the steps of the method as above.
In a further aspect of the embodiments of the present invention, a computer-readable storage medium is also provided, in which a computer program for implementing the above method steps is stored when the computer program is executed by a processor.
The invention has the following beneficial technical effects: link congestion parameters between Vxlan tunnels are detected through ICMP messages, and whether congestion occurs in Vxlan tunnel links or not is quickly judged; part of traffic is forwarded to other Vxlan tunnels through the VTEP routing probability value parameters, so that the traffic burden of the congested tunnels is relieved; and calculating a routing probability value parameter by combining a dichotomy, and realizing the optimal switching of the flow of the congested link, thereby realizing the recovery of the congested link.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other embodiments can be obtained by using the drawings without creative efforts.
Fig. 1 is a schematic diagram of an embodiment of a method for detecting and recovering a congested link according to the present invention;
fig. 2 is a schematic hardware structure diagram of an embodiment of the method for detecting and recovering a congested link according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the following embodiments of the present invention are described in further detail with reference to the accompanying drawings.
It should be noted that all expressions using "first" and "second" in the embodiments of the present invention are used for distinguishing two entities with the same name but different names or different parameters, and it should be noted that "first" and "second" are merely for convenience of description and should not be construed as limitations of the embodiments of the present invention, and they are not described in any more detail in the following embodiments.
In view of the above object, a first aspect of the embodiments of the present invention proposes an embodiment of a method for detecting and recovering a congested link. Fig. 1 is a schematic diagram illustrating an embodiment of a method for detecting and recovering a congested link according to the present invention. As shown in fig. 1, the embodiment of the present invention includes the following steps:
s1, sending a plurality of detection messages and receiving corresponding response messages, and judging whether the times of the first time length from the sending of the detection messages to the receiving of the corresponding response messages exceeding the detection time threshold value in a preset time is larger than a first threshold value;
s2, responding to the fact that the number of times that the first time length from the sending of the detection message to the receiving of the corresponding response message exceeds the detection time threshold value in the preset time is larger than a first threshold value, determining that the current link is in a congestion state, and transferring the flow of the current link based on the preset routing probability value;
s3, responding to the entering of the next detection period, and judging whether the current link is congested again based on the steps; and
and S4, responding to the congestion of the current link, increasing the routing probability value and transferring the flow of the current link based on the increased routing probability value.
In this embodiment, port 1 of VTEP1 to port 1 of VTEP2 is a Vxlan tunnel 1, port 2 of VTEP1 to port 2 of VTEP2 is a Vxlan tunnel 2, multiple (assumed to be N) user flows exist between VTEP1 and VTEP2, the N user flows correspond to N routes, the N user flows share load on Vxlan tunnel 1 and Vxlan tunnel 2, Vxlan tunnel 1 and Vxlan tunnel 2 respectively walk N/2 flows, Vxlan tunnel 1 starts a congestion detection mechanism, link congestion of Vxlan tunnel 1 is detected through an ICMP message, link congestion of Vxlan tunnel is detected through congestion detection time, link stability parameter and detection message response parameter value after the congestion detection function is started, and probability value parameter is reduced through congestion route priority after the congestion detection, route priority of Vxlan tunnel is reduced probabilistically, and thus traffic is switched to Vxlan tunnel sharing with other loads.
The method comprises the following specific steps:
and sending a plurality of detection messages and receiving corresponding response messages, and judging whether the times of the first time length from the sending of the detection messages to the receiving of the corresponding response messages exceeding a detection time threshold value in a preset time is greater than a first threshold value. Recording a time T1 when port 1 of VTEP1 sends a probe packet, recording a time T2 when a response packet of port 1 of VTEP2 is received, where the first time duration is T2-T1, the first time duration is recorded once every time the probe packet is sent, the first threshold may be 2, and when the predetermined time duration, for example, the number of times that the first time duration exceeds the probe time threshold within 30 seconds of one probe period is greater than 2, it is considered that the packet is congested.
In some embodiments, further comprising: and in response to the fact that the number of times that the first time length from the detection message sending to the corresponding response message receiving exceeds the detection time threshold value in the preset time is not more than a first threshold value, judging whether the number of times that the difference value between the first time lengths corresponding to every two detection messages exceeds the link stability parameter threshold value is more than a second threshold value. The first time length of the first detection message is Ta, the first time length of the second detection message is Tb, the link stability parameter is the absolute value of Ta-Tb, and so on, the second link stability parameter value is Tb-Tc, the value reflects the stability condition of the link and reflects the phenomenon of high time and low time when the congestion detection time parameter is high, the second threshold value can also be 2, and the congestion is considered when the second threshold value is 2 times greater than the link stability parameter threshold value set by the user within 30 seconds of the detection period.
In some embodiments, further comprising: and judging whether the ratio of the number of the response messages to the number of the detection messages is greater than a response parameter threshold value or not in response to the fact that the number of times that the difference value between the first time lengths corresponding to every two detection messages exceeds the link stability parameter threshold value is not greater than a second threshold value. A detection messages are sent from port 1 of VTEP1, B response messages are responded from port 2 of VTEP1, the response parameter of the detection messages is B/A, and the congestion is considered when the response parameter value is greater than the response parameter value of the detection messages set by the user within 30 seconds of the detection period for 3 times.
In some embodiments, further comprising: and judging whether the ratio of the number of the response messages to the number of the detection messages is zero or not in response to the fact that the ratio of the number of the response messages to the number of the detection messages is not larger than the response parameter threshold. In some embodiments, further comprising: and modifying the routing probability value to be 100% in response to the condition that the ratio of the number of the response messages to the number of the detection messages is zero. If the B/A value is 0, the link is considered to be in failure, and the routing probability value parameter is set to be 100%.
And responding to the congestion of the current link, and transferring the flow of the current link based on a preset routing probability value. The predetermined routing probability value may be defined by the user himself, with the range defined between 1 and 100%.
And entering the next detection period, and judging whether the current link is congested again. The above operation may be performed again to determine whether the current link is congested.
In response to current link congestion, a routing probability value is increased.
In some embodiments, increasing the routing probability value comprises: increasing the routing probability value based on:
Xn＝(Xn-1+100％)/2(n≥2)
wherein, XnIndicating a routing probability value, X, for the nth probing cyclen-1Indicating the routing probability value of the (n-1) th probing cycle.
The following examples are specifically illustrated:
assuming that the preset routing probability value is 60%, the routing probability value X1 of the first probe cycle is 80% (X0+ 100%)/2, and the routing probability value X2 of the second probe cycle is 90% (X1+ 100%)/2. And so on until the current link is not congested.
In some embodiments, further comprising: in response to the current link not being congested, decreasing the routing probability value.
In some embodiments, the reducing the routing probability value comprises: and modifying the routing probability value into the average value of the routing probability value of the current detection period and the routing probability value of the last detection period.
The following examples are specifically illustrated:
assuming that the preset routing probability value is 60%, the routing probability value of the first probing period is 80%, and the routing probability value of the second probing period is 90%, when the second probing period finds that the current link is not congested, the routing probability value is modified to (90% + 80%)/2 ═ 85%, then whether congestion is detected, if not, the routing probability value is modified to (85% + 80%)/2 ═ 82.5%, then whether congestion is detected, and if not, the routing probability value is modified to (82.5% + 80%)/2 ═ 81.25%. In order to avoid the calculation of the routing probability value without limitation, the routing probability value is detected for only 3 times, and the final routing probability value is the minimum value of no congestion detected in the 3 times of detection, for example, if the congestion is 81.25%, the routing probability value is 82.5%.
It should be particularly noted that, the steps in the embodiments of the method for detecting and recovering a congested link may be mutually intersected, replaced, added, and deleted, so that these reasonable permutation and combination transformations of the method for detecting and recovering a congested link also belong to the scope of the present invention, and the scope of the present invention should not be limited to the embodiments.
In view of the above object, a second aspect of the embodiments of the present invention provides a computer device, including: at least one processor; and a memory storing computer instructions executable on the processor, the instructions being executable by the processor to perform the steps of: s1, sending a plurality of detection messages and receiving corresponding response messages, and judging whether the times of the first time length from the sending of the detection messages to the receiving of the corresponding response messages exceeding the detection time threshold value in a preset time is larger than a first threshold value; s2, responding to the fact that the number of times that the first time length from the sending of the detection message to the receiving of the corresponding response message exceeds the detection time threshold value in the preset time is larger than a first threshold value, determining that the current link is in a congestion state, and transferring the flow of the current link based on the preset routing probability value; s3, responding to the entering of the next detection period, and judging whether the current link is congested again based on the steps; and S4, responding to the congestion of the current link, increasing the route probability value and transferring the flow of the current link based on the increased route probability value.
In some embodiments, increasing the routing probability value comprises: increasing the routing probability value based on:
Xn＝(Xn-1+100％)/2(n≥2)
wherein, XnIndicating a routing probability value, X, for the nth probing cyclen-1Indicating the routing probability value of the (n-1) th probing cycle.
In some embodiments, further comprising: in response to the current link not being congested, decreasing the routing probability value.
In some embodiments, the reducing the routing probability value comprises: and modifying the routing probability value into the average value of the routing probability value of the current detection period and the routing probability value of the last detection period.
In some embodiments, further comprising: and in response to the fact that the number of times that the first time length from the detection message sending to the corresponding response message receiving exceeds the detection time threshold value in the preset time is not more than a first threshold value, judging whether the number of times that the difference value between the first time lengths corresponding to every two detection messages exceeds the link stability parameter threshold value is more than a second threshold value.
In some embodiments, further comprising: and judging whether the ratio of the number of the response messages to the number of the detection messages is greater than a response parameter threshold value or not in response to the fact that the number of times that the difference value between the first time lengths corresponding to every two detection messages exceeds the link stability parameter threshold value is not greater than a second threshold value.
In some embodiments, further comprising: and judging whether the ratio of the number of the response messages to the number of the detection messages is zero or not in response to the fact that the ratio of the number of the response messages to the number of the detection messages is not larger than the response parameter threshold.
In some embodiments, further comprising: and modifying the routing probability value to be 100% in response to the condition that the ratio of the number of the response messages to the number of the detection messages is zero.
Fig. 2 is a schematic hardware structure diagram of an embodiment of the method for detecting and recovering a congested link according to the present invention.
Taking the apparatus shown in fig. 2 as an example, the apparatus includes a processor 301 and a memory 302, and may further include: an input device 303 and an output device 304.
The processor 301, the memory 302, the input device 303 and the output device 304 may be connected by a bus or other means, and fig. 2 illustrates the connection by a bus as an example.
The memory 302, which is a non-volatile computer-readable storage medium, may be used to store non-volatile software programs, non-volatile computer-executable programs, and modules, such as program instructions/modules corresponding to the method for detecting and recovering a congested link in the embodiments of the present application. The processor 301 executes various functional applications of the server and data processing, i.e. implements the method of detecting and recovering a congested link of the above-described method embodiment, by running non-volatile software programs, instructions and modules stored in the memory 302.
The memory 302 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the method of detecting and recovering a congested link, and the like. Further, the memory 302 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some embodiments, memory 302 optionally includes memory located remotely from processor 301, which may be connected to a local module via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The input device 303 may receive information such as a user name and a password that are input. The output means 304 may comprise a display device such as a display screen.
Program instructions/modules corresponding to one or more methods of detecting and recovering a congested link are stored in the memory 302 and, when executed by the processor 301, perform the method of detecting and recovering a congested link in any of the above-described method embodiments.
Any embodiment of a computer device performing the above method of detecting and recovering a congested link may achieve the same or similar effects as any of the above method embodiments corresponding thereto.
The invention also provides a computer readable storage medium storing a computer program which, when executed by a processor, performs the method as above.
Finally, it should be noted that, as one of ordinary skill in the art can appreciate that all or part of the processes of the methods of the above embodiments can be implemented by a computer program to instruct related hardware, and the program of the method for detecting and recovering a congested link can be stored in a computer readable storage medium, and when executed, the program can include the processes of the embodiments of the methods described above. The storage medium of the program may be a magnetic disk, an optical disk, a Read Only Memory (ROM), a Random Access Memory (RAM), or the like. The embodiments of the computer program may achieve the same or similar effects as any of the above-described method embodiments.
Furthermore, the methods disclosed according to embodiments of the present invention may also be implemented as a computer program executed by a processor, which may be stored in a computer-readable storage medium. Which when executed by a processor performs the above-described functions defined in the methods disclosed in embodiments of the invention.
Further, the above method steps and system elements may also be implemented using a controller and a computer readable storage medium for storing a computer program for causing the controller to implement the functions of the above steps or elements.
Further, it should be appreciated that the computer-readable storage media (e.g., memory) herein can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. By way of example, and not limitation, nonvolatile memory can include Read Only Memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM), which can act as external cache memory. By way of example and not limitation, RAM is available in a variety of forms such as synchronous RAM (DRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), and Direct Rambus RAM (DRRAM). The storage devices of the disclosed aspects are intended to comprise, without being limited to, these and other suitable types of memory.
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the disclosure herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as software or hardware depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the disclosed embodiments of the present invention.
The various illustrative logical blocks, modules, and circuits described in connection with the disclosure herein may be implemented or performed with the following components designed to perform the functions herein: a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination of these components. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP, and/or any other such configuration.
The steps of a method or algorithm described in connection with the disclosure herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. In the alternative, the processor and the storage medium may reside as discrete components in a user terminal.
In one or more exemplary designs, the functions may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a general-purpose or special-purpose computer, or a general-purpose or special-purpose processor. Also, any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, Digital Subscriber Line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. Disk and disc, as used herein, includes Compact Disc (CD), laser disc, optical disc, Digital Versatile Disc (DVD), floppy disk, blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
The foregoing is an exemplary embodiment of the present disclosure, but it should be noted that various changes and modifications could be made herein without departing from the scope of the present disclosure as defined by the appended claims. The functions, steps and/or actions of the method claims in accordance with the disclosed embodiments described herein need not be performed in any particular order. Furthermore, although elements of the disclosed embodiments of the invention may be described or claimed in the singular, the plural is contemplated unless limitation to the singular is explicitly stated.
It should be understood that, as used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly supports the exception. It should also be understood that "and/or" as used herein is meant to include any and all possible combinations of one or more of the associated listed items.
The numbers of the embodiments disclosed in the embodiments of the present invention are merely for description, and do not represent the merits of the embodiments.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, and the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, of embodiments of the invention is limited to these examples; within the idea of an embodiment of the invention, also technical features in the above embodiment or in different embodiments may be combined and there are many other variations of the different aspects of the embodiments of the invention as described above, which are not provided in detail for the sake of brevity. Therefore, any omissions, modifications, substitutions, improvements, and the like that may be made without departing from the spirit and principles of the embodiments of the present invention are intended to be included within the scope of the embodiments of the present invention.
Claims (9)
1. A method of detecting and recovering a congested link comprising the steps of:
sending a plurality of detection messages and receiving corresponding response messages, and judging whether the times of the first time length from the sending of the detection messages to the receiving of the corresponding response messages exceeding a detection time threshold value in a preset time is greater than a first threshold value;
in response to the fact that the number of times that a first time length from the sending of the detection message to the receiving of the corresponding response message exceeds a detection time threshold value within a preset time is larger than a first threshold value, determining that the current link is in a congestion state, and transferring the flow of the current link based on a preset routing probability value;
in response to entering the next detection period, judging whether the current link is congested again based on the previous steps;
in response to current link congestion, increasing the routing probability value and diverting traffic of the current link based on the increased routing probability value,
wherein increasing the routing probability value comprises: increasing the routing probability value based on:
Xn＝(Xn-1+100％)/2(n≥2)
wherein, XnIndicating a routing probability value, X, for the nth probing cyclen-1Indicating the routing probability value of the (n-1) th probing cycle.
2. The method of claim 1, further comprising:
in response to the current link not being congested, decreasing the routing probability value.
3. The method of claim 2, wherein the reducing the routing probability value comprises:
and modifying the routing probability value into the average value of the routing probability value of the current detection period and the routing probability value of the last detection period.
4. The method of claim 1, further comprising:
and in response to the fact that the number of times that the first time length from the detection message sending to the corresponding response message receiving exceeds the detection time threshold value in the preset time is not more than a first threshold value, judging whether the number of times that the difference value between the first time lengths corresponding to every two detection messages exceeds the link stability parameter threshold value is more than a second threshold value.
5. The method of claim 4, further comprising:
and judging whether the ratio of the number of the response messages to the number of the detection messages is greater than a response parameter threshold value or not in response to the fact that the number of times that the difference value between the first time lengths corresponding to every two detection messages exceeds the link stability parameter threshold value is not greater than a second threshold value.
6. The method of claim 5, further comprising:
and judging whether the ratio of the number of the response messages to the number of the detection messages is zero or not in response to the fact that the ratio of the number of the response messages to the number of the detection messages is not larger than the response parameter threshold.
7. The method of claim 6, further comprising:
and modifying the routing probability value to be 100% in response to the condition that the ratio of the number of the response messages to the number of the detection messages is zero.
8. A computer device, comprising:
at least one processor; and
a memory storing computer instructions executable on the processor, the instructions when executed by the processor implementing the steps of the method of any one of claims 1 to 7.
9. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911241276.8A CN111010330B (en) | 2019-12-06 | 2019-12-06 | Method, device and medium for detecting and recovering congested link |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911241276.8A CN111010330B (en) | 2019-12-06 | 2019-12-06 | Method, device and medium for detecting and recovering congested link |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111010330A CN111010330A (en) | 2020-04-14 |
| CN111010330B true CN111010330B (en) | 2021-11-23 |
Family
ID=70115035
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911241276.8A Active CN111010330B (en) | 2019-12-06 | 2019-12-06 | Method, device and medium for detecting and recovering congested link |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111010330B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112260903B (en) * | 2020-10-29 | 2022-03-25 | 杭州迪普科技股份有限公司 | Link monitoring method and device |
| CN113342405B (en) * | 2021-06-25 | 2022-04-29 | 支付宝(杭州)信息技术有限公司 | Service recovery method, device and equipment |
| CN116961951A (en) * | 2022-04-20 | 2023-10-27 | 中兴通讯股份有限公司 | Method, device, equipment and storage medium for processing link flooding attack |
| CN115914038B (en) * | 2022-11-11 | 2024-04-09 | 中国联合网络通信集团有限公司 | Degradation forwarding device detection method, device, equipment and storage medium |
| CN116192757A (en) * | 2022-12-27 | 2023-05-30 | 天翼云科技有限公司 | Load balancing method and device, electronic equipment and readable storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101416453A (en) * | 2006-03-31 | 2009-04-22 | 卢森特技术有限公司 | Network load balancing and overload control |
| CN101521912A (en) * | 2008-02-29 | 2009-09-02 | 大唐移动通信设备有限公司 | Congestion of mobile communication system and treatment method and device for recovering from congestion |
| CN102025558A (en) * | 2009-09-11 | 2011-04-20 | 鸿富锦精密工业（深圳）有限公司 | Network detection equipment and method for actively detecting network quality by same |
| CN106130895A (en) * | 2016-08-18 | 2016-11-16 | 中国联合网络通信集团有限公司 | The heavy route method of SDN fault and device |
| CN106230634A (en) * | 2016-08-01 | 2016-12-14 | 青岛海信宽带多媒体技术有限公司 | The diagnostic method of a kind of link failure, device and Set Top Box |
| CN106470116A (en) * | 2015-08-20 | 2017-03-01 | 中国移动通信集团公司 | A kind of Network Fault Detection and restoration methods and device |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20140062649A (en) * | 2012-11-14 | 2014-05-26 | 한국전자통신연구원 | Router and the operating method |
| CN103391253B (en) * | 2013-08-05 | 2017-03-15 | 四川启程科技发展有限公司 | The control method of network congestion, apparatus and system |
| CN106230722B (en) * | 2016-08-05 | 2019-07-09 | 山东省计算中心（国家超级计算济南中心） | SDN network congestion link method of adjustment based on transfer value |
-
2019
- 2019-12-06 CN CN201911241276.8A patent/CN111010330B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101416453A (en) * | 2006-03-31 | 2009-04-22 | 卢森特技术有限公司 | Network load balancing and overload control |
| CN101521912A (en) * | 2008-02-29 | 2009-09-02 | 大唐移动通信设备有限公司 | Congestion of mobile communication system and treatment method and device for recovering from congestion |
| CN102025558A (en) * | 2009-09-11 | 2011-04-20 | 鸿富锦精密工业（深圳）有限公司 | Network detection equipment and method for actively detecting network quality by same |
| CN106470116A (en) * | 2015-08-20 | 2017-03-01 | 中国移动通信集团公司 | A kind of Network Fault Detection and restoration methods and device |
| CN106230634A (en) * | 2016-08-01 | 2016-12-14 | 青岛海信宽带多媒体技术有限公司 | The diagnostic method of a kind of link failure, device and Set Top Box |
| CN106130895A (en) * | 2016-08-18 | 2016-11-16 | 中国联合网络通信集团有限公司 | The heavy route method of SDN fault and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111010330A (en) | 2020-04-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111010330B (en) | Method, device and medium for detecting and recovering congested link | |
| CN111585845B (en) | Method, device and equipment for detecting network card node performance and readable medium | |
| CN104521192A (en) | Techniques for flooding optimization for link state protocols in a network topology | |
| US20180241663A1 (en) | Rerouting tunnel traffic in communication networks | |
| CN110995591A (en) | Method, device and medium for selecting optimal path based on link layer discovery protocol | |
| US11082358B2 (en) | Network path measurement method, apparatus, and system | |
| CN107294856B (en) | Method, equipment and system for determining topology change | |
| CN108476170A (en) | Two-way constrained path search | |
| US20130250753A1 (en) | Method for protection switching in ethernet ring network | |
| CN107181689B (en) | Message interaction method and device between routers | |
| US10397095B2 (en) | Detecting and mitigating loops | |
| CN107276908B (en) | Routing information processing method and packet switching equipment | |
| CN111092962A (en) | Method, device and medium for preventing packet loss in data transmission | |
| CN104901829A (en) | Method and device for verifying consistency of router data forwarding behaviors based on action codes | |
| US10250506B2 (en) | Link control method and apparatus | |
| CN108337181B (en) | Method and device for managing congestion of switching network | |
| CN109361658B (en) | Industrial control industry-based abnormal flow information storage method and device and electronic equipment | |
| CN110115005B (en) | Transmission device and route adding method | |
| JP2012015837A (en) | Path calculation device, data transfer device, path calculation method, data transfer method and program | |
| JP2007215142A (en) | Frame buffer monitoring method and apparatus | |
| JP3431310B2 (en) | Ring state reception method and transmission apparatus for ring network | |
| RU2713616C1 (en) | Device for structural adaptation of a communication system | |
| JP6206105B2 (en) | Communication system, communication method, and communication program | |
| US11133995B2 (en) | Detection method, device, and system | |
| RU2713329C1 (en) | Method for structural adaptation of a communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |