CN1913483A - Deficit polling method of low delay boume small burst - Google Patents
Deficit polling method of low delay boume small burst Download PDFInfo
- Publication number
- CN1913483A CN1913483A CNA2005100899009A CN200510089900A CN1913483A CN 1913483 A CN1913483 A CN 1913483A CN A2005100899009 A CNA2005100899009 A CN A2005100899009A CN 200510089900 A CN200510089900 A CN 200510089900A CN 1913483 A CN1913483 A CN 1913483A
- Authority
- CN
- China
- Prior art keywords
- transmit queue
- token number
- packet
- chained list
- current service
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
This invention discloses a small burst red poll method of low time delay dithering including: initializing a system to present a smallest token number to each transmission queue and setting current service chain list and a next time service chain list, operating on the data packets to be transmitted for enrolling operation, judging if the token number of the transmission queue corresponding to the serial number of the current service chain list head is not smaller than the smallest token number, if so, the head data packet of said queue is transmitted and the length of which is deducted by the token number, judging if the deducted token number is not less than the smallest number, if so, its serial number is added to the tail of the current service chain list, otherwise, it is added to the end of the next time service list, repeating the above mentioned step till the current service chain list is empty, exchanging the current and the next time service chain lists to repeat the above step till both of them are empty.
Description
Technical field
The present invention relates to be used for the dispatching method based on poll of data switching networks, especially relate to a kind of polling method in debt of low delay variation small burst.
Background technology
Poll in debt (Deficit Round Robin, DRR) method is that it is relatively good for the support of elongated packet at the online a kind of dispatching method based on poll that often adopts of exchanges data, complexity is low.This method comprises following specific implementation step: the operation of joining the team will have the sequence number of transmit queue to be sent such as packet to put into a chained list; Go out team when operating in the pairing transmit queue of sequence number on this linked list head of each visit, earlier the service token number of this transmit queue is added the reservation token number (each poll allows the byte number of transmission) of a reserved bandwidth, the each transmission before the packet, judge that whether the remaining service token number of this transmit queue is greater than data packet length on the queue heads, if, send this packet, and the service token number of this transmit queue is deducted the data packet length of transmission, take out the next packet of this formation then, repeat above-mentioned same operation up to the service token number of this transmit queue less than the data packet length that will send, be added to chained list afterbody with this transmit queue sequence number this moment, then visit next transmit queue, if when certain transmit queue is empty, then the sequence number of this transmit queue is shifted out chained list.
Aforesaid DRR method, obviously as can be known: the realization of DRR method, thus need know before sending packet whether the length of data package decision sends, and so operation can increase the expense of system resource in realization; Adopt the DRR method simultaneously, continue the serving of the corresponding transmit queue of the institute of sequence number on the linked list head that satisfies condition, until the service token number that has it all, do like this can cause packet sudden greatly, also can bring very big data delay jitter simultaneously.
Summary of the invention
The technical issues that need to address of the present invention provide a kind of polling method in debt of low delay variation small burst, adopt the present invention can reduce data burst and delay jitter, and can reduce system resource overhead in realization.
In order to solve the problems of the technologies described above, the invention provides a kind of polling method in debt of low delay variation small burst, this method comprises the steps: by the transmission of data exchange system execution to packet in each transmit queue
(a1) system initialization is respectively each transmit queue and gives minimum token number, the packet that needs the are sent operation of joining the team, and setting can be stored the current service chained list of some transmit queue sequence numbers and be served chained list next time;
(a2) judge that whether the token number of the pairing transmit queue of sequence number that is positioned at linked list head in the current service chained list is more than or equal to minimum token number, if, send a packet of this transmit queue, and make the token number of this transmit queue deduct a length of data package, otherwise execution in step (a4);
(a3) behind the delivery header packet, judge whether this transmit queue is empty, if the pairing sequence number of this transmit queue is removed execution in step (a5) from the current service chained list; Otherwise whether further judge the token number that subtracts each other the back transmit queue more than or equal to minimum token number, if the sequence number of this transmit queue is added to the afterbody of current service chained list, execution in step (a5), otherwise execution in step (a4);
(a4) sequence number with this transmit queue is added to the afterbody of next time serving chained list, and makes the token number of this transmit queue increase corresponding reservation token number;
(a5) repeating step (a2) is empty to (a5) until the current service chained list;
(a6) the current service chained list of sky is set to serve chained list next time, serves chained list simultaneously next time and is set to the current service chained list, and repeating step (a2) is to (a6), until the current service chained list with serve chained list and be sky next time.
Further, the present invention also has following characteristics, and the operation of joining the team in the step (a1) comprises the steps:
(b1) packet that will need to send is put into the described transmit queue of packet separately;
(b2) will have the sequence number that need send the transmit queue of packet respectively and be added to the current service chained list, and give corresponding reservation token number respectively to this transmit queue, the token number that makes this transmit queue is minimum token number and reservation token number sum.
Further, the present invention also has following characteristics, also comprises the steps:
Behind the system initialization, each transmit queue is being carried out operating period, if there is new packets need to send, then this packet is put into the described transmit queue of its packet, and judge this transmit queue whether by sky to non-NULL, if, the sequence number of this transmit queue is added to serves chained list next time, make the token number of this transmit queue increase corresponding reservation token number simultaneously.
Further, the present invention also has following characteristics: described reservation token number is set according to the type of service of packet in the transmit queue, when big as if the packet that needs to send, bigger reservation token number can be set.
Further, the present invention also has following characteristics: the length of data package characteristic that described minimum token number can send is as required set, and its numerical value is less than the reservation token number.
Further, the present invention also has following characteristics: the type of service of packet can be divided into 4 kinds in the described transmit queue, corresponding reservation token number value respectively is 6400 bytes, 4800 bytes, 3200 bytes and 1600 bytes, and minimum token number value is 100 bytes.
Compared with prior art, the present invention has the following advantages:
A, because system when current transmit queue is operated in this method, the directly token number of more current transmit queue and minimum token number, so operation makes that not needing to visit the length of the descriptor sense data bag of the packet that is arranged in external memory storage before the scheduling carries out token number and calculate, thereby reduce the consumption of network processing unit, improve the efficient of scheduling greatly;
B, owing to be provided with the current service chained list and serve chained list in this method next time, the transmit queue sequence number of depositing the transmit queue sequence number of current service respectively and serving next time, two chained lists can be changed mutually and operate, when system operates current transmit queue, each operation only sends its packet, and through relatively judging accordingly, this transmit queue put into the current service chained list or serve the afterbody of chained list next time, then next transmit queue is carried out same treatment, so operation has shortened the timeslice of each service transmit queue, make that the service of transmit queue is more level and smooth, guaranteed the fairness of formation service, and reduced the delay jitter of the sudden and packet of Business Stream greatly, improved the discharge characteristic of data flow.
Description of drawings
Fig. 1 is the schematic flow sheet according to the polling method in debt of low delay variation small burst of the present invention;
Fig. 2 is the schematic diagram of the service fairness of existing polling method in debt;
Fig. 3 is the schematic diagram according to the service fairness of the polling method in debt of low delay variation small burst of the present invention;
Fig. 4 is between existing polling method in debt and the present invention, separately the comparison diagram of packet delay variation.
Embodiment
In order to understand the present invention in depth, the present invention is described in detail below in conjunction with drawings and the specific embodiments.
In the present embodiment, polling method in debt according to the present invention is applied to the crosspoint of base station controller in the 3G communication system (BSC), and this crosspoint adopts the network processing unit of Intel (Intel.Inc.).
As shown in Figure 1, the polling method in debt according to a kind of low delay variation small burst of the present invention comprises the steps:
Step 101, system initialization, be respectively each transmit queue and give a minimum token number token_min, be provided with and two services of initialization chained list, these two service chained lists are respectively the current service chained list (LinkListNow) of the current transmit queue sequence number that needs service of storage and store the chained list of service next time (LinkListNext) that next time needs the transmit queue sequence number of serving, and to the packet that needs the send operation of joining the team, the operation of joining the team comprises puts into the described transmit queue of packet separately with the packet of needs transmission, and the sequence number that will have the transmit queue that needs the transmission packet respectively is added to LinkListNow, give corresponding reservation token number token_preengage[i respectively to this transmit queue simultaneously], the token number that makes this transmit queue is minimum token number and reservation token number sum, be token_current[i]=token_min+token_preengage[i], i represents the sequence number of this transmit queue;
Step 102, the pairing transmit queue Q[i of the sequence number i that is positioned at linked list head among the LinkListNow judges in system] token number token_current[i] whether more than or equal to minimum token number token_min, if token_current[i] 〉=token_min, send this transmit queue Q[i] a packet, and make transmit queue Q[i] current token number deduct a length of data package, be token_current[i]=token_current[i]-Ltransmit (length of data package), otherwise execution in step 104;
Step 103, behind the delivery header packet, transmit queue Q[i judges in system] whether be empty, if empty, pairing sequence number i removes from LinkListNow with this transmit queue, execution in step 105; Otherwise further judge transmit queue Q[i] token number token_current[i] whether more than or equal to minimum token number token_min, if token_current[i] 〉=token_min, with this transmit queue Q[i] sequence number i be added to the afterbody of LinkListNow, execution in step 105, otherwise execution in step 104;
Step 104 is added to the afterbody of LinkListNext with the sequence number i of this transmit queue, and makes transmit queue Q[i] token number increase corresponding reservation token number, i.e. token_current[i]=token_current[i]+token_preengage[i];
Step 105, repeating step 102 are empty to step 105 until LinkListNow;
Step 106, system is to the current service chained list and serve chained list next time and change, promptly Kong LinkListNow is set to LinkListNext, LinkListNext is set to LinkListNow simultaneously, repeating step 102 is to step 106, be sky until LinkListNow and LinkListNext, thereby finish the transmission of all packets that need send.
Behind the system initialization, each transmit queue is being carried out operating period, if there is new packets need to send, this packet is put into the described transmit queue of its packet, and judge this transmit queue whether by sky to non-NULL, if the sequence number i of this transmit queue is added to serves chained list next time, make the token number of this transmit queue increase corresponding reservation token number, i.e. token_current[i simultaneously]=token_current[i]+token_preengage[i].
The length of data package characteristic that minimum token number token_min can send as required in this method is set, in the time of can avoiding like this carrying out poll at every turn, and the chance that the transmit queue of narrow bandwidth all once sends, thereby the fairness of assurance service transmit queue; Described reservation token number can be set according to the type of service of packet in the transmit queue, when big as if the packet that needs to send, bigger reservation token number can be set.
Below in conjunction with concrete actual conditions, this method and existing polling method in debt are compared, crosspoint is classified to the type of service of packet in the present embodiment, being divided into is 4 kinds of types of service, be respectively 6400 bytes, 4800 bytes, 3200 bytes and 1600 bytes with the reservation token number of the corresponding transmit queue of each type of service, minimum token number is 100 bytes; The length exponentially of each class business data packet distributes, and average data Bao Changwei 512 bytes, packet rate are 0.2Mp/s, and link rate is 1Gbps.
At this moment, the service fairness of the existing polling method in debt of employing as shown in Figure 2, the horizontal solid line of each bar is represented the timeslice length to each class business service among the figure, according to existing polling method in debt, when certain transmit queue of system service, all token numbers that need exhaust this transmit queue are just served next transmit queue, and so operation can cause service time too concentrated, packet sudden very big.Yet, according to the service fairness of polling method in debt of the present invention as shown in Figure 3, the horizontal solid line of each bar is represented the timeslice length to each class business service among the figure, from figure obviously as can be known, after adopting this method, system is more level and smooth to the service of each transmit queue, and reduces the sudden of Business Stream greatly.
Fig. 4 is between existing polling method in debt and the present invention, the comparison diagram of packet delay variation separately, solid line is the packet time-delay statistical property that adopts existing polling method in debt to be produced, dotted line is the packet time-delay statistical property that adopts according to polling method in debt of the present invention produced, obviously as can be known, this method has had very big improvement for the delay jitter of packet from figure.
Therefore, the present invention has improved the polling mechanism of existing polling method in debt and has compared the sequencing of transmit queue packet, not only reduced the consumption of system resource, and in the fairness of Business Processing and reduce aspects such as packet delay variation and all be greatly improved.In addition, the method after the improvement realizes simple, and complexity is low.
Claims (6)
1, a kind of polling method in debt of low delay variation small burst, this method comprises the steps: by the transmission of data exchange system execution to packet in each transmit queue
(a1) system initialization is respectively each transmit queue and gives minimum token number, the packet that needs the are sent operation of joining the team, and setting can be stored the current service chained list of some transmit queue sequence numbers and be served chained list next time;
(a2) judge that whether the token number of the pairing transmit queue of sequence number that is positioned at linked list head in the current service chained list is more than or equal to minimum token number, if, send a packet of this transmit queue, and make the token number of this transmit queue deduct a length of data package, otherwise execution in step (a4);
(a3) behind the delivery header packet, judge whether this transmit queue is empty, if the pairing sequence number of this transmit queue is removed execution in step (a5) from the current service chained list; Otherwise whether further judge the token number that subtracts each other the back transmit queue more than or equal to minimum token number, if the sequence number of this transmit queue is added to the afterbody of current service chained list, execution in step (a5), otherwise execution in step (a4);
(a4) sequence number with this transmit queue is added to the afterbody of next time serving chained list, and makes the token number of this transmit queue increase corresponding reservation token number;
(a5) repeating step (a2) is empty to (a5) until the current service chained list;
(a6) the current service chained list of sky is set to serve chained list next time, serves chained list simultaneously next time and is set to the current service chained list, and repeating step (a2) is to (a6), until the current service chained list with serve chained list and be sky next time.
2, the polling method in debt of a kind of low delay variation small burst according to claim 1 is characterized in that, the operation of joining the team in the step (a1) comprises the steps:
(b1) packet that will need to send is put into the described transmit queue of packet separately;
(b2) will have the sequence number that need send the transmit queue of packet respectively and be added to the current service chained list, and give corresponding reservation token number respectively to this transmit queue, the token number that makes this transmit queue is minimum token number and reservation token number sum.
3, the polling method in debt of a kind of low delay variation small burst according to claim 2 is characterized in that, this method also comprises the steps:
Behind the system initialization, each transmit queue is being carried out operating period, if there is new packets need to send, then this packet is put into the described transmit queue of its packet, and judge this transmit queue whether by sky to non-NULL, if, the sequence number of this transmit queue is added to serves chained list next time, make the token number of this transmit queue increase corresponding reservation token number simultaneously.
4, the polling method in debt of a kind of low delay variation small burst according to claim 3, it is characterized in that: described reservation token number is set according to the type of service of packet in the transmit queue, if when needing the packet of transmission big, bigger reservation token number can be set.
5, the polling method in debt of a kind of low delay variation small burst according to claim 4 is characterized in that: the length of data package characteristic that described minimum token number can send is as required set, and its numerical value is less than the reservation token number.
6, the polling method in debt of a kind of low delay variation small burst according to claim 5, it is characterized in that: the type of service of packet can be divided into 4 kinds in the described transmit queue, corresponding reservation token number value respectively is 6400 bytes, 4800 bytes, 3200 bytes and 1600 bytes, and minimum token number value is 100 bytes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100899009A CN100499580C (en) | 2005-08-10 | 2005-08-10 | Deficit polling method of low delay dithering small burst |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100899009A CN100499580C (en) | 2005-08-10 | 2005-08-10 | Deficit polling method of low delay dithering small burst |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1913483A true CN1913483A (en) | 2007-02-14 |
| CN100499580C CN100499580C (en) | 2009-06-10 |
Family
ID=37722258
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100899009A Expired - Fee Related CN100499580C (en) | 2005-08-10 | 2005-08-10 | Deficit polling method of low delay dithering small burst |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100499580C (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102316009A (en) * | 2010-07-08 | 2012-01-11 | 创锐讯通讯科技(上海)有限公司 | Improved deficit weighted round robin (DWRR) scheduling method |
| CN102420758A (en) * | 2011-11-30 | 2012-04-18 | 华为技术有限公司 | Method and device for scheduling queue |
| CN102694715A (en) * | 2011-03-22 | 2012-09-26 | 中兴通讯股份有限公司 | Method and system for controlling authorization request state information |
| CN105429897A (en) * | 2014-09-19 | 2016-03-23 | 深圳市中兴微电子技术有限公司 | Service quality scheduling method and device |
| CN106254272A (en) * | 2016-09-05 | 2016-12-21 | 盛科网络（苏州）有限公司 | Weighted-fair dispatching method based on hard-wired elasticity and dispatching patcher |
| CN108460731A (en) * | 2017-03-16 | 2018-08-28 | 中国人民解放军海军航空工程学院青岛校区 | A method of it eliminating scenery picture in networking flight simulation and shakes |
| CN110032453A (en) * | 2019-04-19 | 2019-07-19 | 上海兆芯集成电路有限公司 | Processing system and its accelerated method to task schedule and distribution |
| CN110445729A (en) * | 2019-09-05 | 2019-11-12 | 北京物芯科技有限责任公司 | A kind of array dispatching method, device, equipment and storage medium |
| CN112511463A (en) * | 2020-11-18 | 2021-03-16 | 潍柴动力股份有限公司 | Message sending method and device |
-
2005
- 2005-08-10 CN CNB2005100899009A patent/CN100499580C/en not_active Expired - Fee Related
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102316009A (en) * | 2010-07-08 | 2012-01-11 | 创锐讯通讯科技(上海)有限公司 | Improved deficit weighted round robin (DWRR) scheduling method |
| CN102694715A (en) * | 2011-03-22 | 2012-09-26 | 中兴通讯股份有限公司 | Method and system for controlling authorization request state information |
| WO2012126220A1 (en) * | 2011-03-22 | 2012-09-27 | 中兴通讯股份有限公司 | Method and system for controlling credit request status information |
| CN102420758A (en) * | 2011-11-30 | 2012-04-18 | 华为技术有限公司 | Method and device for scheduling queue |
| CN102420758B (en) * | 2011-11-30 | 2014-04-30 | 华为技术有限公司 | Method and device for scheduling queue |
| CN105429897A (en) * | 2014-09-19 | 2016-03-23 | 深圳市中兴微电子技术有限公司 | Service quality scheduling method and device |
| CN106254272A (en) * | 2016-09-05 | 2016-12-21 | 盛科网络（苏州）有限公司 | Weighted-fair dispatching method based on hard-wired elasticity and dispatching patcher |
| CN108460731A (en) * | 2017-03-16 | 2018-08-28 | 中国人民解放军海军航空工程学院青岛校区 | A method of it eliminating scenery picture in networking flight simulation and shakes |
| CN110032453A (en) * | 2019-04-19 | 2019-07-19 | 上海兆芯集成电路有限公司 | Processing system and its accelerated method to task schedule and distribution |
| CN110445729A (en) * | 2019-09-05 | 2019-11-12 | 北京物芯科技有限责任公司 | A kind of array dispatching method, device, equipment and storage medium |
| CN112511463A (en) * | 2020-11-18 | 2021-03-16 | 潍柴动力股份有限公司 | Message sending method and device |
| CN112511463B (en) * | 2020-11-18 | 2022-04-05 | 潍柴动力股份有限公司 | Message sending method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100499580C (en) | 2009-06-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1913483A (en) | Deficit polling method of low delay boume small burst | |
| EP2353017B1 (en) | Packet aggregation and fragmentation at layer-2 over a managed network | |
| CN108616458B (en) | System and method for scheduling packet transmissions on a client device | |
| CN1297118C (en) | Bandwidth monitor and control equipment | |
| JP3321043B2 (en) | Data terminal in TCP network | |
| CN113711547A (en) | System and method for facilitating efficient packet forwarding in a Network Interface Controller (NIC) | |
| EP1701506B1 (en) | Method and system for transmission control protocol (TCP) traffic smoothing | |
| EP2095580B1 (en) | Method and apparatus for policing bandwidth usage of a home network | |
| US7277419B2 (en) | Supporting disparate packet based wireless communications | |
| JP2002520921A (en) | Method and apparatus for adjusting TCP sliding window using information on network status | |
| CN109714267B (en) | Transmission control method and system for managing reverse queue | |
| CN110868359B (en) | Network congestion control method | |
| CN1692585A (en) | System and method for wireless network channel management | |
| JP5347836B2 (en) | Communication apparatus and communication method | |
| JP2018500851A (en) | Method and network node for traffic management in a network node in a packet switched network | |
| CN101272349B (en) | Priority level analog queue control method and device of quality service | |
| CN1656775A (en) | Rate-based scheduling for packet applications | |
| CN1165184C (en) | Dispatching method for comprehensive router service | |
| CN105763375B (en) | A kind of data packet sending method, method of reseptance and microwave station | |
| CN1194509C (en) | Method for controlling message transmitting spped rate in router interface | |
| JP4973452B2 (en) | Invalid data removal using WiMAX scheduler latency count | |
| US11622028B2 (en) | Explicit notification of operative conditions along a network path | |
| EP1797682B1 (en) | Quality of service (qos) class reordering | |
| CN115442314B (en) | Practical active data center network transmission system and method | |
| WO2024036476A1 (en) | Packet forwarding method and apparatus |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090610 Termination date: 20150810 |
|
| EXPY | Termination of patent right or utility model |