CN112825511A - Switching network congestion management method, device, equipment and storage medium - Google Patents
Switching network congestion management method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN112825511A CN112825511A CN201911143444.XA CN201911143444A CN112825511A CN 112825511 A CN112825511 A CN 112825511A CN 201911143444 A CN201911143444 A CN 201911143444A CN 112825511 A CN112825511 A CN 112825511A
- Authority
- CN
- China
- Prior art keywords
- token bucket
- congestion
- queue
- bucket
- type
- 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.)
- Pending
Links
Images
Classifications
-
- 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
-
- 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
-
- 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/21—Flow control; Congestion control using leaky-bucket
-
- 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/215—Flow control; Congestion control using token-bucket
-
- 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/29—Flow control; Congestion control using a combination of thresholds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/622—Queue service order
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6245—Modifications to standard FIFO or LIFO
Abstract
The application provides a method, a device, equipment and a storage medium for managing congestion of a switching network. The method comprises the following steps: acquiring the current congestion condition of a switching network; adjusting the token quantity of the first type token bucket according to the current congestion condition; and under the condition that the flow request instruction is detected, adjusting the token quantity of the second type token bucket corresponding to the queue where the flow request instruction is positioned.
Description
Technical Field
The present application relates to communications, and in particular, to a method, an apparatus, a device, and a storage medium for managing congestion of a switching network.
Background
The switching system is an integral part of the packet switching equipment. Fig. 1 is a block diagram of a switching system under a single-stage switching network provided in the prior art. As shown in fig. 1, the switching system includes two service units (service unit a and service unit C, respectively) and a switching unit B, and cells sent from a source switch access unit on the service unit a reach each destination switch access unit on the service unit C through the switching unit B.
The asymmetric switching network refers to the situation that bandwidth inconsistency exists between a source switching access and a switching unit and between the switching unit and a destination switching access, namely, the bandwidth of a link entering the switching unit is inconsistent with that of a link exiting the switching unit. Fig. 2 is a block diagram of a switching system under an asymmetric switching network provided in the prior art. As shown in fig. 2, a failure phenomenon occurs in a link between the 0# switching access unit in the switching unit B and the service unit C, thereby causing a situation where bandwidths are inconsistent between the service unit a to the switching unit B and between the switching unit B to the service unit C.
In design, the 0#, 1#, 2# switching access units in the service unit a and the switching access units 0#, 1#, 2# switching access units in the service unit C are symmetrical structures, but in the practical product application process, there is a possibility of link failure, and once the link fails, a congestion state with more or less taps appears in the switching unit system.
To avoid more or less congested states in the switching system, a bucket may be used to control the grant distribution for all queues at the device level (i.e., where the overall grant issue is controlled). However, as the demand of products increases, the authorization management control not only needs to control the unicast authorization of the remote and local, but also needs to control the multicast authorization of the local. Under the condition that the unicast in the switching system is congested, authorization is applied at the original port level, and a bucket is still adopted to control the application of all unicast queues, so that under the condition of congestion, the real port level authorization proportion is inaccurate.
Disclosure of Invention
In view of this, embodiments of the present application provide a method, an apparatus, a device, and a storage medium for managing congestion of a switching network, so as to meet user requirements and improve service quality performance of a system on the premise of ensuring that a user configures a port-level weight correctly.
An embodiment of the present application provides a method for managing congestion of a switching network, including:
acquiring the current congestion condition of a switching network;
adjusting the token quantity of a first type token bucket according to the current congestion condition;
and under the condition that the flow request instruction is detected, adjusting the token quantity of a second type token bucket corresponding to the queue where the flow request instruction is located.
An embodiment of the present application provides a device for managing congestion of a switching network, including:
the acquisition module is set to acquire the current congestion condition of the switching network;
a first adjusting module, configured to adjust the token amount of the first type token bucket according to the current congestion condition;
and the second adjusting module is set to adjust the token quantity of the second type token bucket corresponding to the queue where the flow request instruction is positioned under the condition that the flow request instruction is detected.
An embodiment of the present application provides an apparatus, including: a memory, and one or more processors; device for cleaning the skin
A memory arranged to store one or more programs;
when executed by the one or more processors, cause the one or more processors to implement the method of any of the embodiments described above.
The embodiment of the application provides a storage medium, wherein a computer program is stored in the storage medium, and when being executed by a processor, the computer program realizes the method of any one of the above embodiments.
Drawings
Fig. 1 is a block diagram of a switching system under a single-stage switching network provided in the prior art;
fig. 2 is a diagram of a switching system under an asymmetric switching network provided in the prior art;
fig. 3 is a flowchart of a method for managing congestion of a switching network according to an embodiment of the present application;
FIG. 4 is a schematic diagram of a prior art upper level application state;
FIG. 5 is a schematic diagram of an application state to an upper level according to an embodiment of the present application;
fig. 6 is a block diagram illustrating a structure of a congestion management apparatus of a switching network according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of an apparatus provided in an embodiment of the present application.
Detailed Description
Hereinafter, embodiments of the present application will be described with reference to the drawings. In the present application, the embodiments and features of the embodiments may be arbitrarily combined with each other without conflict.
Fig. 3 is a flowchart of a method for managing congestion of a switching network according to an embodiment of the present application. The present embodiment is applied to a case where congestion occurs in a switching network such as a switch or a router. The present embodiment may be performed by a device, which may be, for example, a switching access device.
As shown in fig. 3, the method in this embodiment includes S110-S130.
S110, acquiring the current congestion condition of the switching network.
In the embodiment, the switching network may be a single-stage switching network or a multi-stage switching network, which is not limited herein. In the embodiment, a switching system under a single-stage switching networking as shown in fig. 2 is taken as an example to describe a method for managing congestion of a switching network. In the switching system comprising three source switching access units, three switching units and three destination switching access units, the link between the 0# switching access unit in the service unit C and the three switching units in the switching unit B is failed, so that the switching units may be in a congestion state.
In the embodiment, the current congestion condition of the switching network refers to the congestion condition of links between a plurality of switching units and the switching access unit in the switching system, that is, the congestion condition of other links except for the failed link in the switching system, that is, the 0# switching unit is respectively connected with the 1# switching access unit and the 2# switching access unit, the 1# switching unit is respectively connected with the 1# switching access unit and the 2# switching access unit, and the 2# switching unit is respectively connected with the 1# switching access unit and the 2# switching access unit, and the congestion conditions of the six links are obtained.
And S120, adjusting the token quantity of the first type token bucket according to the current congestion condition.
In an embodiment, a token bucket refers to an internal storage pool of a network device, and a token refers to a virtual packet that fills the token bucket at a given rate. In an embodiment, a first type token bucket refers to the total internal storage pool of the entire switching system; the token amount refers to the total amount of virtual packets that the first type token bucket can fill. In an embodiment, the first type token bucket has a smaller token amount in case the current congestion situation of the switching network is more congested. It can be understood that, in the case of congestion of the switching network, the amount of tokens in the first type token bucket is reduced in order to ensure normal transmission and reception of messages in the switching network.
And S130, under the condition that the flow request instruction is detected, adjusting the token quantity of the second type token bucket corresponding to the queue where the flow request instruction is located.
In an embodiment, a second type token bucket refers to an internal pool of tokens for each port level. In an embodiment, the second type token bucket is smaller than the internal storage pool of the first type token bucket. In a switching system, the number of token buckets of the second type is related to the number of port levels, which are identical and in one-to-one correspondence. It will be appreciated that each second type token bucket controls one port level.
The flow request instruction refers to message information sent by a user to a switching network through a port. Illustratively, the traffic request command may be a request command for a fixed period of required traffic, for example, 20 million bandwidth per second.
In an embodiment, a first type token bucket is used to control a second type token bucket for all port level numbers, and a second type token bucket is used to apply for authorization to an upper level. It can be understood that, under the condition that the queue where the flow request instruction is located is consumed, the token quantity of the second-type token bucket corresponding to the queue where the flow request instruction is located is adjusted, and the token quantities of other second-type token buckets in the switching system are kept unchanged, so that the second-type token bucket corresponding to the port level applies for authorization to the upper level, thereby satisfying the user requirement and improving the Quality of Service (QoS) performance of the switching system.
In one embodiment, adjusting the token amount for a first type of token bucket based on a current congestion condition comprises: calculating to obtain a corresponding total congestion value according to the congestion state of each channel in the switching unit received in advance; determining a corresponding congestion level according to a preset congestion threshold value and a total congestion value; determining a corresponding authorization issuing interval according to the congestion level; and adjusting the token quantity of the first type token bucket according to the authorized issuing interval.
In an embodiment, each channel refers to each link between each switching unit and the switching access unit. In a switching system, the total congestion value is the sum of the congestion values corresponding to each channel in the switching network. After the corresponding total congestion value is obtained according to the congestion state of each channel, the total congestion value is compared and analyzed with a preset congestion threshold value which is configured in advance, and if the total congestion value reaches the preset congestion threshold value, a congestion level is obtained. It is to be understood that the preset congestion threshold includes a plurality of thresholds, and different preset congestion thresholds are thresholds of different congestion levels. Exemplarily, assuming that the preset congestion threshold values are a1, b1 and c1 respectively, in case that the total congestion value reaches a1, the corresponding congestion level is a level; in the case that the total congestion value reaches B1, the corresponding congestion level is a level B; in the case where the total congestion value reaches C1, the corresponding congestion level is a C level. Wherein, a1 is more than B1 is more than C1, correspondingly, the congestion conditions corresponding to different congestion levels are A more than B more than C, namely the congestion condition corresponding to the level A is the most serious, and the congestion condition corresponding to the level C is the least serious; that is, the level corresponding to the a-level is the highest, and the level corresponding to the C-level is the lowest.
In the embodiment, under the condition of higher congestion level, in order to ensure the processing capability of the message, the authorized issuing interval of the queue can be correspondingly increased, so as to reduce the authorized distribution of the queue. That is, when the congestion level is a level a, the corresponding authorization issue interval is the largest; and under the condition that the congestion level is the C level, the corresponding authorization issuing interval is minimum. That is, different grant issue intervals are configured for different congestion levels. In the embodiment, after the authorized issuing interval of the queue in the switching network is determined according to the congestion level, the tokens of the first type token bucket are increased or decreased according to the authorized issuing interval, namely, the token quantity of the first type token bucket is adjusted.
In an embodiment, in the case that a traffic request instruction is detected, before adjusting the token amount of the second-type token bucket corresponding to the queue where the traffic request instruction is located, the method further includes: determining a first threshold value, a current bucket depth and a weight coefficient corresponding to the second type token bucket according to the queue serial number of the flow request instruction; and determining the in-out condition of a First Input First Output (FIFO) corresponding to the second type token bucket according to the comparison result of the current bucket depth of the second type token bucket and the First threshold value.
In an embodiment, when the traffic request instruction is detected, the token queue is authorized to be effectively distributed or scanned to the queue, and the first threshold corresponding to the second type token bucket may be selected according to the sequence number of the queue in which the traffic request instruction is located. The first threshold refers to a lowest threshold of the second-type token bucket, that is, when the current bucket depth of the second-type token bucket is smaller than the lowest threshold, the second-type token bucket needs to enter a queuing FIFO to wait for being serviced, that is, a queue authorized to be effectively distributed or a scanned queue is placed in the second-type token bucket.
In one embodiment, adjusting the token amount of the second type token bucket corresponding to the queue where the flow request instruction is located includes: the token amount of the second type token bucket is adjusted in the event that the queue in which the traffic request instruction is located authorizes the dispatch to be valid or to be scanned into the queue.
In the embodiment, when the queue corresponding to the second-type token bucket authorizes the distribution to be valid or scans the queue, information needs to be applied to the upper level through the second-type token bucket where the queue is located, that is, when the second-type token bucket processes the queue, a subtraction operation is performed on the current bucket depth of the second-type token bucket.
In an embodiment, in a case where the queuing FIFO is not empty and a queue number is obtained, the method for managing congestion of a switching network further includes: determining a second threshold value, the current bucket depth and a weight coefficient of a second type token bucket where the queue is located according to the queue serial number; the token quantity of the first type token bucket is adjusted according to the weight coefficient.
In an embodiment, in the case that the queuing FIFO is not empty and the queue number can be read out, the queue number read out from the queuing FIFO is used to select the second threshold value of the second type token bucket, and the current bucket depth and weight coefficient of the second type token bucket are read out, and the reduced token amount required by the first type token bucket is adjusted according to the weight coefficient. In an embodiment, the weight coefficients of the second type token bucket are used to characterize the reduced amount of tokens required for the first type token bucket. For example, the amount of tokens required to be reduced by the first type token bucket may be equal to or proportional to the weight coefficient of the second type token bucket, which is not limited herein. For example, if the amount of tokens to be reduced by the first-type token bucket is equal to the weight coefficient of the second-type token bucket, the amount of tokens in the first-type token bucket can be calculated after determining the weight coefficient of the second-type token bucket.
In one embodiment, adjusting the token amount of the second type token bucket corresponding to the queue where the flow request instruction is located includes: and adjusting the token quantity of a second type token bucket corresponding to the queue according to the token quantity of the first type token bucket.
In an embodiment, the amount of tokens that needs to be increased for the second type of token bucket is the same as the amount of tokens that needs to be decreased for the first type of token bucket. After determining the token amount for the first type of token bucket, the token amount for the first type of token bucket is taken as the token amount for the second type of token bucket.
In an embodiment, after adjusting the token amount of the second type token bucket corresponding to the queue where the flow request instruction is located, the method further includes: determining the corresponding queuing FIFO in and out situation according to the current bucket depth of the second type token bucket; and updating the current bucket depth and the report information of the second type token bucket.
In an embodiment, the second threshold value refers to a highest threshold value of the second type of token bucket. In an embodiment, in case the current bucket depth of the second type token bucket is higher than the second threshold value, the second type token bucket needs to be dequeued from the FIFO, i.e. no queue for which the grant distribution is valid or scanned needs to be added to the second type token bucket. Meanwhile, the current bucket depth of the second type token bucket and the information applied to the upper level are updated so as to re-execute the operation of adjusting the token quantity of the first type token bucket and the token quantity of the second type token bucket.
Fig. 4 is a schematic diagram of a state of the art upper-level application. As shown in fig. 4, all unicast queue applications are controlled by one bucket, resulting in inaccurate real port level grant ratios in case of congestion.
Fig. 5 is a schematic diagram of an application state to an upper stage according to an embodiment of the present application. As shown in fig. 5, one first-type token bucket is used to control the second-type token buckets with all port level numbers, and authorization is applied to the upper level through the second-type token bucket, so that on the premise of ensuring that the user configures the port level weights correctly, the user requirements are met, and the QoS performance of the switching system is improved.
In the embodiment, the process of applying for the state of the upper level is described by taking the first type token bucket as a big bucket and the second type token bucket as a small bucket as an example. In an embodiment, when a queue corresponding to a keg authorizes distribution to be effective or scans the queue, information of the keg to be operated at this time is obtained, a normal threshold (i.e., a first threshold) of the corresponding keg is selected through a corresponding queue serial number, and information such as a depth of the keg corresponding to the queue, a weight coefficient and the like is read out at the same time to confirm whether the keg needs to enter a queuing FIFO to be served or not, and the depth of the keg is updated, i.e., the operation is reduced. And the queue number which is not empty in the queuing FIFO and is obtained after being read out is used for judging the off threshold (namely a second threshold value) of the corresponding bucket selected by the small bucket, and simultaneously reading out the latest information such as the bucket depth, the weight coefficient and the like of the small bucket, and knowing the token quantity which needs to be reduced by the large bucket at the moment according to the weight coefficient and the token quantity which should be added by the small bucket at the moment. Then, whether the keg needs to be queued again or queued out is determined based on the current keg depth of the keg. The keg depth and information applied to the upper level are then updated.
In an embodiment, the operation of adding a bucket may be determined based on the current congestion condition of the switching network. The congestion condition of the switching network is determined by calculating a total congestion value from congestion states received by different channels in the switching unit, then obtaining different congestion levels according to a preset congestion threshold value (namely a preset congestion threshold value), and configuring different authorization issuing intervals for the different congestion levels so as to adjust the token amount of the first type token bucket.
Fig. 6 is a block diagram of a switched network congestion management apparatus according to an embodiment of the present application. The present embodiment is applied to a case where congestion occurs in a switching network such as a switch or a router. As shown in fig. 6, the apparatus in the present embodiment includes: an acquisition module 210, a first adjustment module 220, and a second adjustment module 230.
The obtaining module 210 is configured to obtain a current congestion condition of the switching network;
a first adjusting module 220 configured to adjust a token amount of a first type token bucket according to the current congestion condition;
the second adjusting module 230 is configured to, when the traffic request instruction is detected, adjust the token amount of the second type token bucket corresponding to the queue where the traffic request instruction is located.
The switching network congestion management apparatus provided in this embodiment is configured to implement the switching network congestion management method in the embodiment shown in fig. 3, and the implementation principle and the technical effect of the switching network congestion management apparatus provided in this embodiment are similar, and are not described herein again.
In one embodiment, the first adjusting module includes:
the calculating unit is set to calculate and obtain a corresponding total congestion value according to the congestion state of each channel in the switching unit received in advance;
the first determining unit is set to determine the corresponding congestion level according to a preset congestion threshold value and the total congestion value;
the second determining unit is set to determine the corresponding authorization issuing interval according to the congestion level;
and the first adjusting unit is set to adjust the token quantity of the first type token bucket according to the authorization issuing interval.
In an embodiment, the apparatus for managing congestion in a switching network further includes:
the first determining module is configured to determine a first threshold value, a current bucket depth and a weight coefficient corresponding to a second type token bucket according to a sequence number of a queue in which a flow request instruction is located before adjusting the token quantity of the second type token bucket corresponding to the queue in which the flow request instruction is located under the condition that the flow request instruction is detected;
and the second determining module is set to determine the queue FIFO in and out condition corresponding to the second type token bucket according to the comparison result of the current bucket depth of the second type token bucket and the first threshold value.
In an embodiment, the second adjusting module is configured to adjust the token amount of the second type token bucket when the queue where the traffic request instruction is located authorizes the distribution to be valid or scans the queue.
In an embodiment, the apparatus for managing congestion in a switching network further includes:
the third determining module is configured to determine a second threshold value, a current bucket depth and a weight coefficient of a second type token bucket where the queue is located according to the queue serial number under the condition that the queue FIFO is not empty and the queue serial number is obtained;
and the third adjusting module is arranged for adjusting the token quantity of the first type token bucket according to the weight coefficient.
In an embodiment, the second adjusting module is further configured to adjust the token amount of the second type token bucket corresponding to the queue according to the token amount of the first type token bucket.
In an embodiment, the apparatus for managing congestion in a switching network further includes:
a fourth determining module, configured to determine a corresponding queuing FIFO entry and exit condition according to a current bucket depth of a second type token bucket after the adjustment of the token amount of the second type token bucket corresponding to the queue where the flow request instruction is located;
and the updating module is set to update the current bucket depth and the report information of the second type token bucket.
Fig. 7 is a schematic structural diagram of an apparatus provided in an embodiment of the present application. As shown in fig. 7, the present application provides an apparatus comprising: a processor 310 and a memory 320. The number of the processors 310 in the device may be one or more, and one processor 310 is taken as an example in fig. 7. The number of the memories 320 in the device may be one or more, and one memory 320 is taken as an example in fig. 7. The processor 310 and the memory 320 of the device are connected by a bus or other means, as exemplified by the bus connection in fig. 7. In this embodiment, the device is a switched access device.
The memory 320 may be configured to store a software program, a computer executable program, and modules, such as program instructions/modules corresponding to the apparatuses of any embodiment of the present application (for example, the obtaining module 610, the first adjusting module 620, and the second adjusting module 630 in the switching network congestion management apparatus), as a computer readable storage medium. The memory 320 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 use of the device, and the like. Further, the memory 320 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 examples, the memory 320 may further include memory located remotely from the processor 310, which may be connected to the device over 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 device provided above may be configured to execute the method for managing congestion of a switching network provided in any of the embodiments above, and has corresponding functions and effects.
Embodiments of the present application also provide a storage medium containing computer-executable instructions, which when executed by a computer processor, perform a method for switched network congestion management, the method comprising: acquiring the current congestion condition of a switching network; adjusting the token quantity of a first type token bucket according to the current congestion condition; and under the condition that the flow request instruction is detected, adjusting the token quantity of a second type token bucket corresponding to the queue where the flow request instruction is located.
It will be clear to a person skilled in the art that the term user equipment covers any suitable type of wireless user equipment, such as mobile phones, portable data processing devices, portable web browsers or vehicle-mounted mobile stations.
In general, the various embodiments of the application may be implemented in hardware or special purpose circuits, software, logic or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device, although the application is not limited thereto.
Embodiments of the application may be implemented by a data processor of a mobile device executing computer program instructions, for example in a processor entity, or by hardware, or by a combination of software and hardware. The computer program instructions may be assembly instructions, Instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages.
Any logic flow block diagrams in the figures of this application may represent program steps, or may represent interconnected logic circuits, modules, and functions, or may represent a combination of program steps and logic circuits, modules, and functions. The computer program may be stored on a memory. The Memory may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, Read-Only Memory (ROM), Random Access Memory (RAM), optical storage devices and systems (Digital Video Disc (DVD) or Compact Disc (CD)), etc. The computer readable medium may include a non-transitory storage medium. The data processor may be of any type suitable to the local technical environment, such as but not limited to general purpose computers, special purpose computers, microprocessors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Programmable logic devices (FGPAs), and processors based on a multi-core processor architecture.
Claims (10)
1. A method for switched network congestion management, comprising:
acquiring the current congestion condition of a switching network;
adjusting the token quantity of a first type token bucket according to the current congestion condition;
and under the condition that the flow request instruction is detected, adjusting the token quantity of a second type token bucket corresponding to the queue where the flow request instruction is located.
2. The method of claim 1, wherein adjusting the amount of tokens for a first type token bucket based on the current congestion condition comprises:
calculating to obtain a corresponding total congestion value according to the congestion state of each channel in the switching unit received in advance;
determining a corresponding congestion level according to a preset congestion threshold value and the total congestion value;
determining a corresponding authorization issuing interval according to the congestion level;
and adjusting the token quantity of the first type token bucket according to the authorization issuing interval.
3. The method according to claim 1, wherein, when a traffic request instruction is detected, before the adjusting the token amount of the second type token bucket corresponding to the queue in which the traffic request instruction is located, the method further comprises:
determining a first threshold value, a current bucket depth and a weight coefficient corresponding to the second type token bucket according to the queue serial number of the flow request instruction;
and determining the queuing first-in first-out (FIFO) in and out situation corresponding to the second type token bucket according to the comparison result of the current bucket depth of the second type token bucket and the first threshold value.
4. The method of claim 3, wherein the adjusting the token amount of the second type token bucket corresponding to the queue in which the traffic request instruction is located comprises:
and under the condition that the queue where the flow request instruction is positioned authorizes the distribution to be effective or scans the queue, adjusting the token quantity of the second type token bucket.
5. The method according to claim 3, wherein in case the queuing FIFO is not empty and a queue number is obtained, the method further comprises:
determining a second threshold value, the current bucket depth and a weight coefficient of a second type token bucket where the queue is located according to the queue serial number;
and adjusting the token quantity of the first type token bucket according to the weight coefficient.
6. The method of claim 5, wherein the adjusting the token amount of the second type token bucket corresponding to the queue in which the traffic request instruction is located comprises:
and adjusting the token quantity of a second type token bucket corresponding to the queue according to the token quantity of the first type token bucket.
7. The method according to claim 1, further comprising, after the adjusting the token amount of the second type token bucket corresponding to the queue in which the traffic request instruction is located:
determining the corresponding queuing FIFO in and out situation according to the current bucket depth of the second type token bucket;
and updating the current bucket depth and the report information of the second type token bucket.
8. An apparatus for managing congestion in a switching network, comprising:
the acquisition module is set to acquire the current congestion condition of the switching network;
a first adjusting module, configured to adjust the token amount of the first type token bucket according to the current congestion condition;
and the second adjusting module is set to adjust the token quantity of the second type token bucket corresponding to the queue where the flow request instruction is positioned under the condition that the flow request instruction is detected.
9. An apparatus, comprising: a memory, and one or more processors;
a memory arranged to store one or more programs;
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
10. A storage medium, characterized in that the storage medium stores a computer program which, when executed by a processor, implements the method of any one of claims 1-7.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911143444.XA CN112825511A (en) | 2019-11-20 | 2019-11-20 | Switching network congestion management method, device, equipment and storage medium |
| PCT/CN2020/129822 WO2021098730A1 (en) | 2019-11-20 | 2020-11-18 | Switching network congestion management method and apparatus, device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911143444.XA CN112825511A (en) | 2019-11-20 | 2019-11-20 | Switching network congestion management method, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112825511A true CN112825511A (en) | 2021-05-21 |
Family
ID=75907166
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911143444.XA Pending CN112825511A (en) | 2019-11-20 | 2019-11-20 | Switching network congestion management method, device, equipment and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN112825511A (en) |
| WO (1) | WO2021098730A1 (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116055407A (en) * | 2021-10-28 | 2023-05-02 | 华为技术有限公司 | Message scheduling method and device |
| CN114745682B (en) * | 2022-02-28 | 2023-08-18 | 联想(北京)有限公司 | Processing method and control plane network element |
| CN114793216B (en) * | 2022-06-22 | 2022-09-23 | 北京轻网科技有限公司 | Token management and information sending method and device, electronic equipment and storage medium |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101110753A (en) * | 2006-07-20 | 2008-01-23 | 华为技术有限公司 | End-to-end quality assurance method and system based on congestion alarm |
| CN101159699B (en) * | 2007-11-27 | 2010-04-21 | 杭州华三通信技术有限公司 | Distributed equipment switch network bandwidth dynamic assignment method and apparatus |
| CN101272348B (en) * | 2008-04-30 | 2012-07-04 | 杭州华三通信技术有限公司 | Bandwidth control method and system |
| CN101924687B (en) * | 2009-06-12 | 2012-11-28 | 中兴通讯股份有限公司 | Method and device for controlling switching communicated network flow |
| US9450881B2 (en) * | 2013-07-09 | 2016-09-20 | Intel Corporation | Method and system for traffic metering to limit a received packet rate |
| CN104660521B (en) * | 2013-11-20 | 2019-03-05 | 华为技术有限公司 | A kind of method and apparatus of flux of multicast control |
-
2019
- 2019-11-20 CN CN201911143444.XA patent/CN112825511A/en active Pending
-
2020
- 2020-11-18 WO PCT/CN2020/129822 patent/WO2021098730A1/en active Application Filing
Also Published As
| Publication number | Publication date |
|---|---|
| WO2021098730A1 (en) | 2021-05-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10069701B2 (en) | Flexible allocation of packet buffers | |
| US10757157B2 (en) | Allocating limit to allowable end-to-end latency variation based on destination capability | |
| US7161907B2 (en) | System and method for dynamic rate flow control | |
| WO2021098730A1 (en) | Switching network congestion management method and apparatus, device, and storage medium | |
| US9030935B2 (en) | Device and method for adjusting rate limits for transmission rates of data flows having a certain priority in a transmitter | |
| EP2466824B1 (en) | Service scheduling method and device | |
| US6950396B2 (en) | Traffic control method and system | |
| CN107404443B (en) | Queue cache resource control method and device, server and storage medium | |
| JP3042267B2 (en) | Adaptive call connection regulation control apparatus and method | |
| CN111343097B (en) | Link load balancing method and device, electronic equipment and storage medium | |
| US9210095B2 (en) | Arbitration of multiple-thousands of flows for convergence enhanced ethernet | |
| EP3340548B1 (en) | Scheduling method and customer premises equipment | |
| US20150131446A1 (en) | Enabling virtual queues with qos and pfc support and strict priority scheduling | |
| US5878026A (en) | Resource sharing for book-ahead and instantaneous-request calls | |
| US20030072260A1 (en) | Multi-dimensional buffer management hierarchy | |
| EP3376719B1 (en) | Arbitrating data packets | |
| Lozhkovskyi et al. | Estimating the service waiting probability in a single-channel system with self-similar traffic | |
| RU2272362C1 (en) | Method for controlling data burst streams in the course of their transmission | |
| Zukerman et al. | The effect of eliminating the standby state on DQDB performance under overload | |
| US20230318976A1 (en) | Rate Limited Scheduler For Solicited Data Transfers | |
| RU2802911C1 (en) | Method for traffic balancing in switching node of transport communication network | |
| Večeřa et al. | The finding of the queuing theory models for evaluation throughput of the IRS radio network in the Czech Republic | |
| US10742710B2 (en) | Hierarchal maximum information rate enforcement | |
| JP3601426B2 (en) | CONGESTION CONTROL SYSTEM, CONGESTION CONTROL METHOD, AND RECORDING MEDIUM RECORDING PROCESSING PROGRAM THEREOF | |
| Gunther et al. | Characterization of the burst stabilization protocol for the RR/RR CICQ switch |
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 |