CN112968845A - Bandwidth management method, device, equipment and machine-readable storage medium - Google Patents
Bandwidth management method, device, equipment and machine-readable storage medium Download PDFInfo
- Publication number
- CN112968845A CN112968845A CN202110128744.1A CN202110128744A CN112968845A CN 112968845 A CN112968845 A CN 112968845A CN 202110128744 A CN202110128744 A CN 202110128744A CN 112968845 A CN112968845 A CN 112968845A
- Authority
- CN
- China
- Prior art keywords
- priority queue
- guaranteed bandwidth
- bandwidth
- queue
- allocated
- 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.)
- Granted
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/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
-
- 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/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/245—Traffic characterised by specific attributes, e.g. priority or QoS using preemption
Abstract
The present disclosure provides a bandwidth management method, apparatus, device and machine-readable storage medium, the method comprising: acquiring current flow loads of a first priority queue and a second priority queue; wherein the first priority queue is allocated with a corresponding guaranteed bandwidth, and the second priority queue is allocated with a corresponding guaranteed bandwidth; judging whether a guaranteed bandwidth corresponding to a first priority queue is idle or not at present, and judging whether a traffic load corresponding to a second priority queue exceeds the guaranteed bandwidth or not; and if so, preferentially allocating the free guaranteed bandwidth of the first priority queue to the second priority queue. According to the technical scheme, between two high-priority queues distributed with guaranteed bandwidth, when the guaranteed bandwidth of one high-priority queue is idle and the bandwidth of the other high-priority queue is insufficient, the idle guaranteed bandwidth is preferentially distributed to the other high-priority bandwidth, and therefore the probability of packet loss of the high-priority queues is reduced.
Description
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a bandwidth management method, apparatus, device, and machine-readable storage medium.
Background
CBQ (Class-Based Queuing) is a Qos (Quality of Service) scheme for traffic management. The method can classify the flow according to the characteristics of the flow (such as IP address, DSCP value and the like of the message, and defined by a user) and enable the flow to enter a corresponding queue, and performs differential management on the flow when the network is congested so as to ensure that the real-time service message is preferentially sent under the congestion condition, and the rest flow is weighted and fairly scheduled based on the class.
When configuring CBQ, guaranteed bandwidth needs to be configured for an EF (Expedited Forwarding) queue and an AF (Assured Forwarding) queue, traffic outside the guaranteed bandwidth is degraded traffic, the degraded traffic is allowed to use excess bandwidth when the bandwidth is sufficient, and when the traffic is congested, the remaining bandwidth needs to be allocated according to weight with a WFQ (Weighted Fair Queuing) queue.
The EF queue requires that the network can guarantee its peak rate at which the flow packets of the EF queue are not discarded. AF convection requires that the network can guarantee certain resources, but when the network is congested, part of the traffic messages may be discarded.
And the flow may have the condition that the flow of a certain high-priority queue is very small, and the flow of another high-priority queue and the WFQ queue is relatively large, and for the high-priority queue with the relatively large flow, except the flow in the guaranteed bandwidth, the rest flows need to preempt the bandwidth with the WFQ queue.
Disclosure of Invention
In view of the above, the present disclosure provides a bandwidth management method, apparatus, electronic device, and machine-readable storage medium to solve the problem that the high-priority queue needs to preempt bandwidth with the low-priority queue when the traffic load is large.
The specific technical scheme is as follows:
the present disclosure provides a bandwidth management method, applied to a traffic management device, the method including: acquiring current flow loads of a first priority queue and a second priority queue; wherein the first priority queue is allocated with a corresponding guaranteed bandwidth, and the second priority queue is allocated with a corresponding guaranteed bandwidth; judging whether a guaranteed bandwidth corresponding to a first priority queue is idle or not at present, and judging whether a traffic load corresponding to a second priority queue exceeds the guaranteed bandwidth or not; and if so, preferentially allocating the free guaranteed bandwidth of the first priority queue to the second priority queue.
As a technical solution, the obtaining of the current traffic loads of the first priority queue and the second priority queue includes: sampling the first priority queue and the second priority queue by using a sampler, and acquiring the current flow loads of the first priority queue and the second priority queue in real time; when the traffic load of the first priority queue changes, if the idle guaranteed bandwidth of the first priority queue is preferentially allocated to the second priority queue, the guaranteed bandwidth related to the first priority queue allocated to the second priority queue is adjusted according to the traffic load of the first priority queue changing.
As a technical scheme, judging whether a guaranteed bandwidth corresponding to a first priority queue and/or a second priority queue is idle at present, and traffic loads corresponding to the first priority queue and the second priority queue do not exceed the guaranteed bandwidth; if yes, distributing the idle guaranteed bandwidth corresponding to the first priority queue and/or the second priority queue to the non-guaranteed bandwidth; the non-guaranteed bandwidth is used for traffic that is not allocated guaranteed bandwidth.
As a technical solution, when the minimum guaranteed bandwidth set in the first priority queue is preferentially allocated to the second priority queue, the remaining guaranteed bandwidth of the first priority queue is greater than or equal to the minimum guaranteed bandwidth.
The present disclosure also provides a bandwidth management device, which is applied to a traffic management device, and the device includes: the acquisition module is used for acquiring the current flow loads of the first priority queue and the second priority queue; wherein the first priority queue is allocated with a corresponding guaranteed bandwidth, and the second priority queue is allocated with a corresponding guaranteed bandwidth; the judging module is used for judging whether the guaranteed bandwidth corresponding to the first priority queue is idle or not at present and the flow load corresponding to the second priority queue exceeds the guaranteed bandwidth; and the allocation module is used for preferentially allocating the idle guaranteed bandwidth of the first priority queue to the second priority queue when the judgment module judges that the second priority queue exists.
As a technical solution, the obtaining of the current traffic loads of the first priority queue and the second priority queue includes: sampling the first priority queue and the second priority queue by using a sampler, and acquiring the current flow loads of the first priority queue and the second priority queue in real time; when the traffic load of the first priority queue changes, if the idle guaranteed bandwidth of the first priority queue is preferentially allocated to the second priority queue, the guaranteed bandwidth related to the first priority queue allocated to the second priority queue is adjusted according to the traffic load of the first priority queue changing.
As a technical solution, the determining module is further configured to determine whether there is a free guaranteed bandwidth corresponding to the first priority queue and/or the second priority queue at present, and traffic loads corresponding to the first priority queue and the second priority queue do not exceed the guaranteed bandwidth; if yes, distributing the idle guaranteed bandwidth corresponding to the first priority queue and/or the second priority queue to the non-guaranteed bandwidth; the non-guaranteed bandwidth is used for traffic that is not allocated guaranteed bandwidth.
As a technical solution, when the minimum guaranteed bandwidth set in the first priority queue is preferentially allocated to the second priority queue, the remaining guaranteed bandwidth of the first priority queue is greater than or equal to the minimum guaranteed bandwidth.
The present disclosure also provides an electronic device including a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor, the processor executing the machine-executable instructions to implement the foregoing bandwidth management method.
The present disclosure also provides a machine-readable storage medium having stored thereon machine-executable instructions that, when invoked and executed by a processor, cause the processor to implement the aforementioned bandwidth management method.
The technical scheme provided by the disclosure at least brings the following beneficial effects:
between two high-priority queues distributed with guaranteed bandwidth, when the guaranteed bandwidth of one high-priority queue is idle and the bandwidth of the other high-priority queue is insufficient, the idle guaranteed bandwidth is preferentially distributed to the other high-priority bandwidth instead of being added into a bandwidth pool, and the high-priority queue and the low-priority queue occupy the residual bandwidth, so that the probability of packet loss of the high-priority queue is reduced.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments of the present disclosure or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present disclosure, and other drawings can be obtained by those skilled in the art according to the drawings of the embodiments of the present disclosure.
FIG. 1 is a flow diagram of a bandwidth management method in one embodiment of the present disclosure;
FIG. 2 is a block diagram of a bandwidth management device in one embodiment of the present disclosure;
fig. 3 is a hardware configuration diagram of an electronic device in an embodiment of the present disclosure.
Detailed Description
The terminology used in the embodiments of the present disclosure is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used in this disclosure and the claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein is meant to encompass any and all possible combinations of one or more of the associated listed items.
It is to be understood that although the terms first, second, third, etc. may be used herein to describe various information in the embodiments of the present disclosure, such information should not be limited by these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of the present disclosure. Depending on the context, moreover, the word "if" as used may be interpreted as "at … …" or "when … …" or "in response to a determination".
The present disclosure provides a bandwidth management method and apparatus, an electronic device, and a machine-readable storage medium to solve the above problems.
The specific technical scheme is as follows.
The present disclosure provides a bandwidth management method, applied to a traffic management device, the method including: acquiring current flow loads of a first priority queue and a second priority queue; wherein the first priority queue is allocated with a corresponding guaranteed bandwidth, and the second priority queue is allocated with a corresponding guaranteed bandwidth; judging whether a guaranteed bandwidth corresponding to a first priority queue is idle or not at present, and judging whether a traffic load corresponding to a second priority queue exceeds the guaranteed bandwidth or not; and if so, preferentially allocating the free guaranteed bandwidth of the first priority queue to the second priority queue.
Specifically, as shown in fig. 1, the method comprises the following steps:
step S11, obtaining current traffic loads of the first priority queue and the second priority queue.
Step S12, determine whether there is a free guaranteed bandwidth corresponding to the first priority queue and the traffic load corresponding to the second priority queue exceeds the guaranteed bandwidth.
In step S13, the free guaranteed bandwidth of the first priority queue is preferentially allocated to the second priority queue.
Wherein the first priority queue is assigned a corresponding guaranteed bandwidth and the second priority queue is assigned a corresponding guaranteed bandwidth.
In the embodiment of the present disclosure, the first priority queue and the second priority queue are an EF queue and an AF queue, respectively, or the first priority queue and the second priority queue are an AF queue and an EF queue, respectively, and the two queues are switched between idle and high load states corresponding to two different actual situations, respectively, without affecting the implementation of the embodiment of the present disclosure.
Between two high-priority queues distributed with guaranteed bandwidth, when the guaranteed bandwidth of one high-priority queue is idle and the bandwidth of the other high-priority queue is insufficient, the idle guaranteed bandwidth is preferentially distributed to the other high-priority bandwidth instead of being added into a bandwidth pool, and the high-priority queue and the low-priority queue occupy the residual bandwidth, so that the probability of packet loss of the high-priority queue is reduced.
In one embodiment, the obtaining the current traffic loads of the first priority queue and the second priority queue includes: sampling the first priority queue and the second priority queue by using a sampler, and acquiring the current flow loads of the first priority queue and the second priority queue in real time; when the traffic load of the first priority queue changes, if the idle guaranteed bandwidth of the first priority queue is preferentially allocated to the second priority queue, the guaranteed bandwidth related to the first priority queue allocated to the second priority queue is adjusted according to the traffic load of the first priority queue changing.
In one implementation, whether guaranteed bandwidths corresponding to a first priority queue and/or a second priority queue are idle or not is judged, and traffic loads corresponding to the first priority queue and the second priority queue do not exceed the guaranteed bandwidths; if yes, distributing the idle guaranteed bandwidth corresponding to the first priority queue and/or the second priority queue to the non-guaranteed bandwidth; the non-guaranteed bandwidth is used for traffic that is not allocated guaranteed bandwidth.
In one embodiment, the first priority queue is set with a minimum guaranteed bandwidth, and when the free guaranteed bandwidth of the first priority queue is preferentially allocated to the second priority queue, the remaining guaranteed bandwidth of the first priority queue is greater than or equal to the minimum guaranteed bandwidth.
In an implementation mode, samplers are used in an EF queue and an AF queue to monitor the size of queue traffic in real time, taking the fact that the EF queue is idle and the AF queue is high in load as an example, when the EF queue traffic is found to be small and smaller than a guaranteed bandwidth within a sampling period, redundant guaranteed bandwidth is adaptively allocated to the AF queue, so that the high-priority traffic of the AF queue is guaranteed to be forwarded as preferentially as possible, and the low-priority traffic of the WFQ queue does not have bandwidth completely.
More specifically, the EF queue guarantees 500MB of bandwidth, the AF queue guarantees 300MB of bandwidth, and the remaining 200MB of bandwidth is allocated for WFQ demotion traffic by weight. And dynamically allocating CBQ bandwidth, configuring 800MB bandwidth for sharing by an EF queue and an AF queue, wherein the minimum guaranteed bandwidth of the AF queue is 300MB, when various flows are congested, allocating the bandwidth according to the weights of 500MB, 300MB and 200MB, and when the sampler finds that the flow of the EF queue or the AF queue is less, allocating the idle bandwidth in 800MB to the needed EF queue or AF queue.
The flow scheduling and bandwidth allocation are carried out on the flow of the queue according to the priority strictly, and the low-priority flow can be scheduled only when the residual bandwidth exists after the high-priority flow is transmitted.
The present disclosure also provides a bandwidth management apparatus, as shown in fig. 2, applied to a traffic management device, the apparatus includes: an obtaining module 21, configured to obtain current traffic loads of the first priority queue and the second priority queue; wherein the first priority queue is allocated with a corresponding guaranteed bandwidth, and the second priority queue is allocated with a corresponding guaranteed bandwidth; the judging module 22 is configured to judge whether there is an idle guaranteed bandwidth corresponding to the first priority queue and a traffic load corresponding to the second priority queue exceeds the guaranteed bandwidth; and the allocating module 23 is configured to preferentially allocate the idle guaranteed bandwidth of the first priority queue to the second priority queue when the determining module determines that the second priority queue exists.
In one embodiment, the obtaining the current traffic loads of the first priority queue and the second priority queue includes: sampling the first priority queue and the second priority queue by using a sampler, and acquiring the current flow loads of the first priority queue and the second priority queue in real time; when the traffic load of the first priority queue changes, if the idle guaranteed bandwidth of the first priority queue is preferentially allocated to the second priority queue, the guaranteed bandwidth related to the first priority queue allocated to the second priority queue is adjusted according to the traffic load of the first priority queue changing.
In one embodiment, the determining module is further configured to determine whether there is a free guaranteed bandwidth corresponding to the first priority queue and/or the second priority queue at present, and traffic loads corresponding to the first priority queue and the second priority queue do not exceed the guaranteed bandwidth; if yes, distributing the idle guaranteed bandwidth corresponding to the first priority queue and/or the second priority queue to the non-guaranteed bandwidth; the non-guaranteed bandwidth is used for traffic that is not allocated guaranteed bandwidth.
In one embodiment, the first priority queue is set with a minimum guaranteed bandwidth, and when the free guaranteed bandwidth of the first priority queue is preferentially allocated to the second priority queue, the remaining guaranteed bandwidth of the first priority queue is greater than or equal to the minimum guaranteed bandwidth.
The device embodiments are the same or similar to the corresponding method embodiments and are not described herein again.
In one embodiment, the present disclosure provides an electronic device, including a processor and a machine-readable storage medium, where the machine-readable storage medium stores machine-executable instructions executable by the processor, and the processor executes the machine-executable instructions to implement the foregoing bandwidth management method, and from a hardware level, a hardware architecture diagram may be as shown in fig. 3.
In one embodiment, the present disclosure provides a machine-readable storage medium having stored thereon machine-executable instructions that, when invoked and executed by a processor, cause the processor to implement the aforementioned bandwidth management method.
Here, a machine-readable storage medium may be any electronic, magnetic, optical, or other physical storage device that can contain or store information such as executable instructions, data, and so forth. For example, the machine-readable storage medium may be: a RAM (random Access Memory), a volatile Memory, a non-volatile Memory, a flash Memory, a storage drive (e.g., a hard drive), a solid state drive, any type of storage disk (e.g., an optical disk, a dvd, etc.), or similar storage medium, or a combination thereof.
The systems, devices, modules or units described in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. A typical implementation device is a computer, which may take the form of a personal computer, laptop computer, cellular telephone, camera phone, smart phone, personal digital assistant, media player, navigation device, email messaging device, game console, tablet computer, wearable device, or a combination of any of these devices.
For convenience of description, the above devices are described as being divided into various units by function, and are described separately. Of course, the functionality of the various elements may be implemented in the same one or more software and/or hardware implementations in practicing the disclosure.
As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present disclosure may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Furthermore, these computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable storage media (which may include, but is not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The above description is only an embodiment of the present disclosure, and is not intended to limit the present disclosure. Various modifications and variations of this disclosure will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present disclosure should be included in the scope of the claims of the present disclosure.
Claims (10)
1. A bandwidth management method is applied to a flow management device, and the method comprises the following steps:
acquiring current flow loads of a first priority queue and a second priority queue;
wherein the first priority queue is allocated with a corresponding guaranteed bandwidth, and the second priority queue is allocated with a corresponding guaranteed bandwidth;
judging whether a guaranteed bandwidth corresponding to a first priority queue is idle or not at present, and judging whether a traffic load corresponding to a second priority queue exceeds the guaranteed bandwidth or not;
and if so, preferentially allocating the free guaranteed bandwidth of the first priority queue to the second priority queue.
2. The method of claim 1,
the obtaining of the current traffic loads of the first priority queue and the second priority queue includes:
sampling the first priority queue and the second priority queue by using a sampler, and acquiring the current flow loads of the first priority queue and the second priority queue in real time;
when the traffic load of the first priority queue changes, if the idle guaranteed bandwidth of the first priority queue is preferentially allocated to the second priority queue, the guaranteed bandwidth related to the first priority queue allocated to the second priority queue is adjusted according to the traffic load of the first priority queue changing.
3. The method of claim 1,
judging whether the guaranteed bandwidths corresponding to the first priority queue and/or the second priority queue are idle or not at present, wherein the traffic loads corresponding to the first priority queue and the second priority queue do not exceed the guaranteed bandwidths;
if yes, distributing the idle guaranteed bandwidth corresponding to the first priority queue and/or the second priority queue to the non-guaranteed bandwidth;
the non-guaranteed bandwidth is used for traffic that is not allocated guaranteed bandwidth.
4. The method of claim 1, wherein the first priority queue is configured with a minimum guaranteed bandwidth, and when the free guaranteed bandwidth of the first priority queue is preferentially allocated to the second priority queue, the remaining guaranteed bandwidth of the first priority queue is greater than or equal to the minimum guaranteed bandwidth.
5. A bandwidth management device, applied to a traffic management device, the device comprising:
the acquisition module is used for acquiring the current flow loads of the first priority queue and the second priority queue;
wherein the first priority queue is allocated with a corresponding guaranteed bandwidth, and the second priority queue is allocated with a corresponding guaranteed bandwidth;
the judging module is used for judging whether the guaranteed bandwidth corresponding to the first priority queue is idle or not at present and the flow load corresponding to the second priority queue exceeds the guaranteed bandwidth;
and the allocation module is used for preferentially allocating the idle guaranteed bandwidth of the first priority queue to the second priority queue when the judgment module judges that the second priority queue exists.
6. The apparatus of claim 5,
the obtaining of the current traffic loads of the first priority queue and the second priority queue includes:
sampling the first priority queue and the second priority queue by using a sampler, and acquiring the current flow loads of the first priority queue and the second priority queue in real time;
when the traffic load of the first priority queue changes, if the idle guaranteed bandwidth of the first priority queue is preferentially allocated to the second priority queue, the guaranteed bandwidth related to the first priority queue allocated to the second priority queue is adjusted according to the traffic load of the first priority queue changing.
7. The apparatus of claim 5,
the judging module is also used for judging whether the guaranteed bandwidth corresponding to the first priority queue and/or the second priority queue is idle or not at present, and the traffic loads corresponding to the first priority queue and the second priority queue do not exceed the guaranteed bandwidth;
if yes, distributing the idle guaranteed bandwidth corresponding to the first priority queue and/or the second priority queue to the non-guaranteed bandwidth;
the non-guaranteed bandwidth is used for traffic that is not allocated guaranteed bandwidth.
8. The apparatus of claim 5, wherein the first priority queue is configured with a minimum guaranteed bandwidth, and when the free guaranteed bandwidth of the first priority queue is preferentially allocated to the second priority queue, the remaining guaranteed bandwidth of the first priority queue is greater than or equal to the minimum guaranteed bandwidth.
9. An electronic device, comprising: a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor to perform the method of any one of claims 1 to 4.
10. A machine-readable storage medium having stored thereon machine-executable instructions which, when invoked and executed by a processor, cause the processor to implement the method of any of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110128744.1A CN112968845B (en) | 2021-01-29 | 2021-01-29 | Bandwidth management method, device, equipment and machine-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110128744.1A CN112968845B (en) | 2021-01-29 | 2021-01-29 | Bandwidth management method, device, equipment and machine-readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112968845A true CN112968845A (en) | 2021-06-15 |
| CN112968845B CN112968845B (en) | 2022-05-27 |
Family
ID=76272610
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110128744.1A Active CN112968845B (en) | 2021-01-29 | 2021-01-29 | Bandwidth management method, device, equipment and machine-readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112968845B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113296957A (en) * | 2021-06-18 | 2021-08-24 | 中国科学院计算技术研究所 | Method and device for dynamically allocating network-on-chip bandwidth |
| CN115314323A (en) * | 2022-10-10 | 2022-11-08 | 深圳市华云中盛科技股份有限公司 | Information transmission method and system |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020095684A1 (en) * | 2001-01-12 | 2002-07-18 | St. John James T. | Methods, systems and computer program products for bandwidth allocation based on throughput guarantees |
| US20050175014A1 (en) * | 2000-09-25 | 2005-08-11 | Patrick Michael W. | Hierarchical prioritized round robin (HPRR) scheduling |
| US6967921B1 (en) * | 2000-11-27 | 2005-11-22 | At&T Corp. | Method and device for efficient bandwidth management |
| CN101964758A (en) * | 2010-11-05 | 2011-02-02 | 南京邮电大学 | Differentiated service-based queue scheduling method |
| CN102664803A (en) * | 2012-04-23 | 2012-09-12 | 杭州华三通信技术有限公司 | EF (Expedited Forwarding) queue implementing method and equipment |
| CN104219169A (en) * | 2014-09-30 | 2014-12-17 | 杭州华三通信技术有限公司 | CBQ (Class Based Queuing) scheduling method and device |
| CN105933064A (en) * | 2016-07-05 | 2016-09-07 | 北京邮电大学 | Dynamic bandwidth allocation method and apparatus |
-
2021
- 2021-01-29 CN CN202110128744.1A patent/CN112968845B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050175014A1 (en) * | 2000-09-25 | 2005-08-11 | Patrick Michael W. | Hierarchical prioritized round robin (HPRR) scheduling |
| US6967921B1 (en) * | 2000-11-27 | 2005-11-22 | At&T Corp. | Method and device for efficient bandwidth management |
| US20020095684A1 (en) * | 2001-01-12 | 2002-07-18 | St. John James T. | Methods, systems and computer program products for bandwidth allocation based on throughput guarantees |
| CN101964758A (en) * | 2010-11-05 | 2011-02-02 | 南京邮电大学 | Differentiated service-based queue scheduling method |
| CN102664803A (en) * | 2012-04-23 | 2012-09-12 | 杭州华三通信技术有限公司 | EF (Expedited Forwarding) queue implementing method and equipment |
| CN104219169A (en) * | 2014-09-30 | 2014-12-17 | 杭州华三通信技术有限公司 | CBQ (Class Based Queuing) scheduling method and device |
| CN105933064A (en) * | 2016-07-05 | 2016-09-07 | 北京邮电大学 | Dynamic bandwidth allocation method and apparatus |
Non-Patent Citations (2)
| Title |
|---|
| 周义军等: "VPN带宽的动态分配队列技术", 《计算机工程与应用》 * |
| 李金库等: "一种基于网络处理器的动态带宽分配算法", 《西安交通大学学报》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113296957A (en) * | 2021-06-18 | 2021-08-24 | 中国科学院计算技术研究所 | Method and device for dynamically allocating network-on-chip bandwidth |
| CN113296957B (en) * | 2021-06-18 | 2024-03-05 | 中国科学院计算技术研究所 | Method and device for dynamically distributing network bandwidth on chip |
| CN115314323A (en) * | 2022-10-10 | 2022-11-08 | 深圳市华云中盛科技股份有限公司 | Information transmission method and system |
| CN115314323B (en) * | 2022-10-10 | 2023-02-10 | 深圳市华云中盛科技股份有限公司 | Information transmission method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112968845B (en) | 2022-05-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8311049B2 (en) | Method and device for scheduling packets for routing in a network with implicit determination of packets to be treated as priority | |
| CN102035732B (en) | Service scheduling method and device | |
| US6810426B2 (en) | Methods and systems providing fair queuing and priority scheduling to enhance quality of service in a network | |
| US9699092B2 (en) | Systems and methods for dynamically adjusting QoS parameters | |
| US20230142539A1 (en) | Methods and apparatus to schedule service requests in a network computing system using hardware queue managers | |
| CN107431667B (en) | Network device, method and storage medium for transmitting data packet | |
| CN112968845B (en) | Bandwidth management method, device, equipment and machine-readable storage medium | |
| US11922213B2 (en) | Techniques for behavioral pairing in a task assignment system | |
| KR20130136558A (en) | Hierarchical profiled scheduling and shaping | |
| EP3588880B1 (en) | Method, device, and computer program for predicting packet lifetime in a computing device | |
| US20130235880A1 (en) | Applying backpressure to a subset of nodes in a deficit weighted round robin scheduler | |
| EP2910051B1 (en) | Method and arrangement for admission control based on priority level based differentiation | |
| JP2013507089A (en) | Method and apparatus for policing and prioritizing data services | |
| CN113315720A (en) | Data flow control method, system and equipment | |
| US8660001B2 (en) | Method and apparatus for providing per-subscriber-aware-flow QoS | |
| CN107682282B (en) | Service quality method and network equipment for guaranteeing service bandwidth | |
| CN114124829A (en) | Service forwarding control method and device and electronic equipment | |
| EA008956B1 (en) | Method for the dynamic management of resources in telecommunication systems, based on quality of service and type of service | |
| CN110636013A (en) | Dynamic scheduling method and device for message queue | |
| EP4282144A1 (en) | Method and system for buffer management based on predictive analytics | |
| Ferreira et al. | Adaptive admission control in a NGN service platform | |
| CN117793583A (en) | Message forwarding method and device, electronic equipment and computer readable storage medium |
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 |