CN1798090A - Method for scheduling data packets in packet service - Google Patents
Method for scheduling data packets in packet service Download PDFInfo
- Publication number
- CN1798090A CN1798090A CNA2004100919192A CN200410091919A CN1798090A CN 1798090 A CN1798090 A CN 1798090A CN A2004100919192 A CNA2004100919192 A CN A2004100919192A CN 200410091919 A CN200410091919 A CN 200410091919A CN 1798090 A CN1798090 A CN 1798090A
- Authority
- CN
- China
- Prior art keywords
- packet
- priority
- users
- formation
- general data
- 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/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/621—Individual queue per connection or flow, e.g. per VC
-
- 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/11—Identifying 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
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
-
- 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/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
-
- 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/30—Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes
-
- 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/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
-
- 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/52—Queue scheduling by attributing bandwidth to queues
- H04L47/525—Queue scheduling by attributing bandwidth to queues by redistribution of residual bandwidth
-
- 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/52—Queue scheduling by attributing bandwidth to queues
- H04L47/527—Quantum based scheduling, e.g. credit or deficit based scheduling or token bank
Abstract
The method includes following steps: classifies the users into the high priority user and the normal user; determines the minimum bandwidth used by the high priority user, and sets up its flow measurement rate; makes classification for data packets, namely makes the flow measurement for the packets used by high priority users, and sorts the packets not exceeding the flow measurement rate into the high priority packets, and sorts the packets used by normal users into the normal packets; the high priority packets is putted into the sending queue at the output to send out; for the normal packet, first checks the congestion state at the output; if there is a congestion, then discards the exceeding normal packet; otherwise, sends out the normal packets.
Description
Technical field
The present invention relates to dispatching method, particularly can be applicable to a kind of dispatching method in UBR+ in the Packet Service system (strengthen UBR, wherein UBR is i.e. " Unspecified Bit Rate " abbreviation of the Unspecified Bit Rate) business.
Background technology
In grouping (packet) operation system, professional quality assurance (QoS, Quality of Service) parameter comprises packet delay (delay), delay variation (delay jitter), Loss Rate (loss rate), throughput (throughput) etc., different business need networks provide different qos parameters, and different qos parameters needs corresponding dispatching method to guarantee.So-called scheduling (scheduling) claims Flow Control (flow control) again, exactly the service order that connects is controlled, and to reach following several objects: 1) bandwidth of its reservation is enjoyed in every connection of assurance; 2) have under the situation of remaining bandwidth in system, distribute remaining bandwidth according to the qos requirement of each connection; 3) guarantee to satisfy the delay requirement that each bar connects.
And the required service goal that reaches of the qos requirement of existing UBR+ business is: 1) guarantee to have the connection bandwidth of minimum bandwidth requirement, all the other no requirement (NR)s connect does one's best; 2) for system's remaining bandwidth, then all connections are shared, and include the connection of minimum bandwidth requirement; 3) do one's best in the time delay aspect.
At present, mainly contain following two kinds at this business dispatching algorithm relatively more commonly used: first kind is that wheel gives in to and fair scheduling algorithm second kind of dispatching algorithm that adds absolute priority (Strict-Priority Queue is abbreviated as PQ) for traffic policing.Before these two kinds of methods are elaborated, do earlier: be called high priority for the connection that has minimum bandwidth to guarantee and connect, be referred to as common connection for the connection that does not have bandwidth requirement to give a definition; Corresponding user is called high-priority users and domestic consumer.
Wheel give in to equity dispatching be dispatching algorithm the most commonly used, mainly include repeating query algorithm (RR), the weighting wheel gives in to (Weighted Round Robin is abbreviated as WRR), DRR (abbreviation of Deficit Round-Robin) etc.Though these algorithms can guarantee bandwidth distributional equity between each user well, can guarantee that perhaps each user shares outlet bandwidth in proportion; But exist following defective: when being difficult to accomplish to guarantee the minimum bandwidth of certain or some high-priority users, the business need that remaining bandwidth is shared by all users.For under the situation that guarantees the high-priority users bandwidth, allow all users share remaining bandwidth, just must on-the-fly modify each user's dispatch weight according to user's linking number.For example, suppose that outlet bandwidth is N, when a high-priority users, in order to reach the bandwidth requirement of UBR+, the minimum bandwidth that promptly guarantees this user's requirement is M, accomplish that simultaneously this user and other L domestic consumer (supposing that weight is 1) can share remaining bandwidth (N-M), then this user's weight need be set to M* (L+1)/(N-M).Yet under practical situations, high-priority users number and domestic consumer's number may be issued at random, thereby it is more loaded down with trivial details to calculate and be provided with each user's weight.The more important thing is that because under the actual conditions, user's linking number is variable at any time, this will make the weighted value that accurately sets out each user become quite difficult, or even can not realize.
Another kind of scheduling way comparatively commonly used is by use traffic supervision and PQ scheduling, and the bandwidth that realizes the UBR+ business guarantees and be shared.So-called traffic policing (Commit Access Rate is abbreviated as CAR) promptly is provided with one and allows through-rate, and the flow in this speed range can pass through, and does discard processing for the flow that exceeds this speed.And, can obtain desired minimum bandwidth in order to guarantee each high-priority users, all high-priority users require the minimum bandwidth sum can not surpass the outlet total bandwidth when use traffic is supervised.In this dispatching method, use the PQ scheduling simultaneously, thereby guarantee that all high-priority users flows by traffic policing always have precedence over domestic consumer's flow and pass through.Its operation principle as shown in Figure 1, in Fig. 1, the packet of high-priority users 1 is by traffic policing 2, allow in speed range flow by and enter into high-priority traffic formation 3; The packet 4 of domestic consumer then enters into common discharge formation 5; By PQ scheduling 6, guarantee that the high-priority users flow has precedence over domestic consumer's flow and passes through then.As we can see from the figure, though the minimum bandwidth of high-priority users flow is to be guaranteed, but have only domestic consumer to share remaining bandwidth, the part that exceeds minimum bandwidth in those high-priority users flows is directly to be dropped, and does not have and the shared remaining bandwidth of domestic consumer's flow.Therefore, such scheme does not reach the bandwidth requirement of UBR+ business yet.
In sum, no matter wheel gives in to and fair scheduling algorithm, still traffic policing adds the dispatching algorithm of absolute priority, all be merely able to guarantee the minimum bandwidth requirement of high-priority users, and the very difficult high-priority users that maybe can't realize is shared remaining bandwidth with domestic consumer, can't satisfy the bandwidth requirement of UBR+ business.
Summary of the invention
The technical problem to be solved in the present invention is, a kind of simple dispatching method is provided, can be in the minimum bandwidth of solution certain or some high-priority users, the problem that remaining bandwidth is shared by all users that comprise higher-priority subscriber can also be accomplished, thereby the bandwidth requirement of UBR+ business can be satisfied fully.
The technical solution adopted for the present invention to solve the technical problems is: the data packet dispatching method in a kind of Packet Service is provided, may further comprise the steps:
S1: user's classification is divided into high-priority users and domestic consumer with all users;
S2: determine the minimum bandwidth of each high-priority users, its flow tolerance speed is set;
S3: packet is classified, promptly the packet to high-priority users carries out flow tolerance, the packet that will not exceed the flow tolerance speed that step S2 is provided with is divided into high priority packets, and the packet that will exceed described flow tolerance speed is divided into the general data bag; The packet of domestic consumer is divided into the general data bag;
S4: outlet is handled the packet through step S3 classification: high priority packets is put in the transmit queue of outlet and sends; The general data bag is then checked the congestion condition of outlet,, send if export unimpeded then the general data bag is put in the transmit queue of outlet if export congested then abandon the general data bag that exceeds the quata.
Transmit queue comprises high-priority traffic formation and common discharge formation described in the described step S4 of data packet dispatching method in the above-mentioned Packet Service, described high priority packets is put in the described high-priority traffic formation, and all described general data bags are put in the common discharge formation.Also adopt the absolute priority scheduling among the described step S4, make the high-priority traffic formation always have precedence over the common discharge formation.
Perhaps, the transmit queue described in the described step S4 of the data packet dispatching method in the above-mentioned Packet Service uses fifo queue to realize that described fifo queue is provided with high threshold and low threshold; Described high priority packets is judged according to the high threshold threshold value and is joined the team, and makes discard processing in the time of can not joining the team; Described general data bag is judged according to the low threshold threshold value and is joined the team, and makes discard processing in the time of can not joining the team.The difference of the threshold value of described high threshold and low threshold is not less than the burstiness sum of described all high-priority users.
Perhaps, transmit queue comprises high-priority traffic formation and common discharge formation described in the described step S4 of data packet dispatching method in the above-mentioned Packet Service; Described high priority packets is put in the described high-priority traffic formation; Described common discharge formation is provided with and abandons thresholding; Detection abandons the threshold value of thresholding, if reach described threshold value, then abandon the described general data bag that high-priority users marks off, if do not reach described threshold value, then the described general data bag that described high-priority users is marked off is put in the common discharge formation.Also adopt the absolute priority scheduling among the described step S4, comprise the step that makes the high-priority traffic formation always have precedence over the common discharge formation.
Implement the data packet dispatching method in the Packet Service of the present invention, packet to high-priority users carries out flow tolerance, to not have the packet of excess flow tolerance speed to be divided into high priority packets, and the packet that excess flow is measured speed will be divided into the general data bag; And the normal user data bag is divided into the general data bag; To the high priority packets transmission of joining the team, and when outlet is blocked the joining the team of control general data bag, thereby the minimum bandwidth that has guaranteed the high-priority users flow guarantees that all users share remaining bandwidth simultaneously, can satisfy the bandwidth requirement of UBR+ business fully.
Description of drawings
Fig. 1 is the fundamental diagram that existing use traffic supervision and PQ dispatch.
Fig. 2 is the flow chart of the data packet dispatching method in the Packet Service of the present invention.
Fig. 3 is the fundamental diagram of the data packet dispatching method in the Packet Service of the present invention.
Fig. 4 is the schematic diagram of first embodiment of the data packet dispatching method in the Packet Service of the present invention.
Fig. 5 is the schematic diagram of second embodiment of the data packet dispatching method in the Packet Service of the present invention.
Fig. 6 is the schematic diagram of the 3rd embodiment of the data packet dispatching method in the Packet Service of the present invention.
Embodiment
Below in conjunction with accompanying drawing, the data packet dispatching method in a kind of Packet Service of the present invention is described in further detail.
As shown in Figures 2 and 3, the data packet dispatching method in the Packet Service of the present invention at first carries out user's classification at step S1, is about to all users and is divided into high-priority users and domestic consumer's two classes; Then, step S2 determine each high-priority users minimum bandwidth, thereby flow tolerance speed is set; Then, at step S3, the packet that user side sends is classified, promptly the flow that is provided with according to step S2 is measured speed, packet 10 to high-priority users carries out flow tolerance, can adopt token bucket algorithm or token bucket algorithm inspection whether to belong to excess traffic, will not have the packet of excess flow tolerance speed to be divided into high priority packets 101, the packet of excess flow being measured speed is divided into general data bag 102; And normal user data bag 20 is divided into general data bag 202.At last, packet is handled, high priority packets 101 is put in the transmit queue of outlet, send in step S4 outlet; 102,202 of general data bags are checked the congestion conditions of outlet,,, send if export unimpeded then general data bag 102,202 is put in the transmit queue of outlet if export congested then abandon the general data bag 102,202 that exceeds the quata.Thereby the minimum bandwidth that has guaranteed the high-priority users flow guarantees, has realized that simultaneously all users can share remaining bandwidth fully.
Referring to Fig. 4, among first embodiment of the data packet dispatching method in Packet Service of the present invention, at first all users are divided into high-priority users and domestic consumer; Determine the minimum bandwidth of each high-priority users then, thereby flow tolerance speed is set; Carry out flow tolerance then, packet classification.In the present embodiment, flow tolerance is only done the tolerance of speed, and does not abandon, and promptly the packet 10 of high-priority users is classified, and the packet in the rate requirement scope is divided into high priority packets 101, enters into the high-priority traffic formation; The packet that original hypervelocity rate is required is divided into general data bag 102, adopts the identical control of joining the team with the general data bag 20 of other domestic consumers simultaneously, enters the common discharge formation.And adopt the PQ scheduler module to dispatch in the exit, guarantee that all high priority packets always have precedence over the general data bag.
Referring to Fig. 5, among second embodiment of the data packet dispatching method in Packet Service of the present invention, at first all users are divided into high-priority users and domestic consumer; Determine the minimum bandwidth of each high-priority users then, thereby flow tolerance speed is set; Carry out flow tolerance then, packet classification, the packet in speed range 10 of high-priority users is divided into high priority packets 101, exceeds the packet 10 of speed range and the packet 20 of domestic consumer and be divided into general data bag 102,202 jointly.Use FIFO (first-in first-out) formation to realize the processing of packet then in the exit.Described fifo queue is provided with high threshold and low threshold; Described high priority packets 101 is judged according to the high threshold threshold value and is joined the team, and makes discard processing in the time of can not joining the team; Described general data bag 102,202 is judged according to the low threshold threshold value and is joined the team, and makes discard processing in the time of can not joining the team.Because the threshold value of high threshold makes high priority packets have precedence over general data and wraps into team greater than the threshold value of low threshold, guaranteed the minimum bandwidth of high-priority users; And,, make high-priority users and domestic consumer can share remaining bandwidth owing to exceed the packet of speed range and the packet of domestic consumer is formed the general data bag jointly.When the outlet generation is congested, for the bandwidth requirement that guarantees all high-priority users can be guaranteed, the difference of the threshold value of described high threshold and low threshold is not less than the burstiness sum of described all high-priority users, promptly the bursty data of all high-priority users can enter in the formation, thereby has guaranteed the bandwidth requirement of high-priority users.
Referring to Fig. 6, among the 3rd embodiment of the data packet dispatching method in Packet Service of the present invention, at first all users are divided into high-priority users and domestic consumer; Determine the minimum bandwidth of each high-priority users then, thereby flow tolerance speed is set; Carry out flow tolerance then, packet classification is divided into high priority packets 101 with the packet in speed range 10 of high-priority users, and the packet 10 that exceeds speed range is divided into general data bag 102.Be provided with high-priority traffic formation and common discharge formation in the exit.High priority packets 101 is put in the high-priority traffic formation, and the packet of domestic consumer then is put in the common discharge formation.Described common discharge formation also is provided with and abandons thresholding, the general data bag 102 of high-priority users then determines whether entering the common discharge formation according to the described threshold value that abandons thresholding, if promptly reach described threshold value, then abandon the described general data bag 102 that high-priority users marks off, if do not reach described threshold value, then the described general data bag that described high-priority users is marked off is put in the common discharge formation.And adopt the PQ scheduler module to dispatch in the exit, guarantee that all high priority packets always have precedence over the general data bag.Thereby the minimum bandwidth that has guaranteed the high-priority users flow guarantees that all users share remaining bandwidth simultaneously, can satisfy the bandwidth requirement of UBR+ business fully.
Claims (7)
1, the data packet dispatching method in a kind of Packet Service may further comprise the steps:
S1: user's classification is divided into high-priority users and domestic consumer with all users;
S2: determine the minimum bandwidth of each high-priority users, its flow tolerance speed is set;
It is characterized in that, further comprising the steps of:
S3: packet is classified, promptly the packet to high-priority users carries out flow tolerance, the packet that will not exceed the flow tolerance speed that step S2 is provided with is divided into high priority packets, and the packet that will exceed described flow tolerance speed is divided into the general data bag; The packet of domestic consumer is divided into the general data bag;
S4: outlet is handled the packet through step S3 classification: high priority packets is put in the transmit queue of outlet and sends; The general data bag is then checked the congestion condition of outlet,,, send if export unimpeded then the general data bag is put in the transmit queue of outlet if export congested then abandon the general data bag that exceeds the quata.
2, the data packet dispatching method in the Packet Service according to claim 1, it is characterized in that, transmit queue described in the step S4 comprises high-priority traffic formation and common discharge formation, described high priority packets is put in the described high-priority traffic formation, and all described general data bags are put in the common discharge formation.
3, the data packet dispatching method in the Packet Service according to claim 2 is characterized in that, adopts the absolute priority scheduling among the described step S4, makes the high-priority traffic formation always have precedence over the common discharge formation.
4, the data packet dispatching method in the Packet Service according to claim 1 is characterized in that, the transmit queue described in the described step S4 uses fifo queue to realize that described fifo queue is provided with high threshold and low threshold; Described high priority packets is judged according to the high threshold threshold value and is joined the team, and makes discard processing in the time of can not joining the team; Described general data bag is judged according to the low threshold threshold value and is joined the team, and makes discard processing in the time of can not joining the team.
5, the data packet dispatching method in the Packet Service according to claim 4 is characterized in that, the difference of the threshold value of described high threshold and low threshold is not less than the burstiness sum of described all high-priority users.
6, the data packet dispatching method in the Packet Service according to claim 1 is characterized in that, transmit queue described in the step S4 comprises high-priority traffic formation and common discharge formation; Described high priority packets is put in the described high-priority traffic formation; Described common discharge formation is provided with and abandons thresholding; Detection abandons the threshold value of thresholding, if reach described threshold value, then abandon the described general data bag that high-priority users marks off, if do not reach described threshold value, then the described general data bag that described high-priority users is marked off is put in the common discharge formation.
7, the data packet dispatching method in the Packet Service according to claim 6 is characterized in that, adopts the absolute priority scheduling among the described step S4, comprises the step that makes the high-priority traffic formation always have precedence over the common discharge formation.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100919192A CN100370787C (en) | 2004-12-29 | 2004-12-29 | Method for scheduling data packets in packet service |
| PCT/CN2005/002312 WO2006069528A1 (en) | 2004-12-29 | 2005-12-26 | A packet scheduling method in the packet service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100919192A CN100370787C (en) | 2004-12-29 | 2004-12-29 | Method for scheduling data packets in packet service |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1798090A true CN1798090A (en) | 2006-07-05 |
| CN100370787C CN100370787C (en) | 2008-02-20 |
Family
ID=36614495
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100919192A Active CN100370787C (en) | 2004-12-29 | 2004-12-29 | Method for scheduling data packets in packet service |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN100370787C (en) |
| WO (1) | WO2006069528A1 (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008125027A1 (en) * | 2007-04-17 | 2008-10-23 | Huawei Technologies Co., Ltd. | Business dispatching method and network concourse device thereof |
| CN101827033A (en) * | 2010-04-30 | 2010-09-08 | 北京搜狗科技发展有限公司 | Method and device for controlling network traffic and local area network system |
| CN101159903B (en) * | 2007-10-23 | 2011-01-05 | 华为技术有限公司 | Method and device of preventing and processing transmission carrying congestion |
| CN101360052B (en) * | 2008-09-28 | 2011-02-09 | 成都市华为赛门铁克科技有限公司 | Method and device for flow scheduling |
| CN101296185B (en) * | 2008-06-05 | 2011-12-14 | 杭州华三通信技术有限公司 | Flow control method and device of equalization group |
| CN101692648B (en) * | 2009-08-14 | 2012-05-23 | 中兴通讯股份有限公司 | Method and system for queue scheduling |
| CN101202701B (en) * | 2006-12-12 | 2012-09-05 | 中兴通讯股份有限公司 | Method for distributing band width of assemblage useable bit rate transaction in grouping network |
| CN101843056B (en) * | 2007-07-27 | 2013-01-16 | 晶像股份有限公司 | Packet level prioritization in interconnection networks |
| CN101616096B (en) * | 2009-07-31 | 2013-01-16 | 中兴通讯股份有限公司 | Method and device for scheduling queue |
| CN108369531A (en) * | 2016-07-12 | 2018-08-03 | 华为技术有限公司 | It controls I/O bandwidth and handles the method, apparatus and system of I O access request |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6647424B1 (en) * | 1998-05-20 | 2003-11-11 | Nortel Networks Limited | Method and apparatus for discarding data packets |
| US6801501B1 (en) * | 1999-09-14 | 2004-10-05 | Nokia Corporation | Method and apparatus for performing measurement-based admission control using peak rate envelopes |
| JP4484317B2 (en) * | 2000-05-17 | 2010-06-16 | 株式会社日立製作所 | Shaping device |
| US6847629B2 (en) * | 2000-11-30 | 2005-01-25 | Qualcomm Incorporated | Method and apparatus for scheduling packet data transmissions in a wireless communication system |
| US6657980B2 (en) * | 2001-04-12 | 2003-12-02 | Qualcomm Incorporated | Method and apparatus for scheduling packet data transmissions in a wireless communication system |
| US20040125815A1 (en) * | 2002-06-24 | 2004-07-01 | Mikio Shimazu | Packet transmission apparatus and method thereof, traffic conditioner, priority control mechanism and packet shaper |
| FI112421B (en) * | 2002-10-29 | 2003-11-28 | Tellabs Oy | Method and device for time allocation of transmission connection capacity between packet switched data communication flows |
| FR2854296A1 (en) * | 2003-04-24 | 2004-10-29 | France Telecom | Flow packet processing device for use in network link, has scheduling module to schedule packet in queue based on analyzing incoming bit rate of flow relative to fair bit rate and fair queuing with priority algorithm |
-
2004
- 2004-12-29 CN CNB2004100919192A patent/CN100370787C/en active Active
-
2005
- 2005-12-26 WO PCT/CN2005/002312 patent/WO2006069528A1/en active Application Filing
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101202701B (en) * | 2006-12-12 | 2012-09-05 | 中兴通讯股份有限公司 | Method for distributing band width of assemblage useable bit rate transaction in grouping network |
| WO2008125027A1 (en) * | 2007-04-17 | 2008-10-23 | Huawei Technologies Co., Ltd. | Business dispatching method and network concourse device thereof |
| CN101843056B (en) * | 2007-07-27 | 2013-01-16 | 晶像股份有限公司 | Packet level prioritization in interconnection networks |
| CN101159903B (en) * | 2007-10-23 | 2011-01-05 | 华为技术有限公司 | Method and device of preventing and processing transmission carrying congestion |
| CN101296185B (en) * | 2008-06-05 | 2011-12-14 | 杭州华三通信技术有限公司 | Flow control method and device of equalization group |
| CN101360052B (en) * | 2008-09-28 | 2011-02-09 | 成都市华为赛门铁克科技有限公司 | Method and device for flow scheduling |
| CN101616096B (en) * | 2009-07-31 | 2013-01-16 | 中兴通讯股份有限公司 | Method and device for scheduling queue |
| CN101692648B (en) * | 2009-08-14 | 2012-05-23 | 中兴通讯股份有限公司 | Method and system for queue scheduling |
| CN101827033A (en) * | 2010-04-30 | 2010-09-08 | 北京搜狗科技发展有限公司 | Method and device for controlling network traffic and local area network system |
| CN101827033B (en) * | 2010-04-30 | 2013-06-19 | 北京搜狗科技发展有限公司 | Method and device for controlling network traffic and local area network system |
| CN108369531A (en) * | 2016-07-12 | 2018-08-03 | 华为技术有限公司 | It controls I/O bandwidth and handles the method, apparatus and system of I O access request |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2006069528A1 (en) | 2006-07-06 |
| CN100370787C (en) | 2008-02-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1310485C (en) | Method and system for open-loop congestion control in a system fabric | |
| EP0275678B1 (en) | Packet switching system arranged for congestion control through bandwidth management | |
| Bonomi et al. | The rate-based flow control framework for the available bit rate ATM service | |
| Bernet et al. | An informal management model for diffserv routers | |
| CA2227244C (en) | A method for supporting per-connection queuing for feedback-controlled traffic | |
| US8130649B2 (en) | Ingress traffic flow control in a data communications system | |
| US6512743B1 (en) | Bandwidth allocation for ATM available bit rate service | |
| WO1999066676A1 (en) | Admission control method and switching node for integrated services packet-switched networks | |
| CN1520113A (en) | Method and appts. for scheduling available link bandwidth between packet-switched data flows | |
| US20100195492A1 (en) | Controlling Traffic in a Packet Switched Communications Network | |
| US7369489B1 (en) | Unbiased token bucket | |
| CN101834787A (en) | Method and system for dispatching data | |
| US7362749B2 (en) | Queuing closed loop congestion mechanism | |
| CN1798090A (en) | Method for scheduling data packets in packet service | |
| Andrikopoulos et al. | A fair traffic conditioner for the assured service in a differentiated services internet | |
| US7522624B2 (en) | Scalable and QoS aware flow control | |
| Kwon et al. | Scheduling algorithm for real-time burst traffic using dynamic weighted round robin | |
| US7218608B1 (en) | Random early detection algorithm using an indicator bit to detect congestion in a computer network | |
| EP1455488A1 (en) | System and method for providing differentiated services | |
| CN1134136C (en) | Method for implementing hierarchical direction to randomly and early discard queue management mechanism and circuit | |
| Aboul-Magd | Voice over differentiated services | |
| Francini et al. | Providing QoS guarantees to unicast and multicast flows in multistage packet switches | |
| Cisco | Policing and Shaping Overview | |
| CN1668026A (en) | Network quality service system and method | |
| Seckin et al. | Real-time transmission of multilayer video over ATM networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |