CN104869079A - Method and device for queue scheduling based on dynamic weighted round-robin - Google Patents

Method and device for queue scheduling based on dynamic weighted round-robin Download PDF

Info

Publication number
CN104869079A
CN104869079A CN201510318925.5A CN201510318925A CN104869079A CN 104869079 A CN104869079 A CN 104869079A CN 201510318925 A CN201510318925 A CN 201510318925A CN 104869079 A CN104869079 A CN 104869079A
Authority
CN
China
Prior art keywords
queue
scheduling
weight
packet
module
Prior art date
Application number
CN201510318925.5A
Other languages
Chinese (zh)
Other versions
CN104869079B (en
Inventor
董志兵
Original Assignee
烽火通信科技股份有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 烽火通信科技股份有限公司 filed Critical 烽火通信科技股份有限公司
Priority to CN201510318925.5A priority Critical patent/CN104869079B/en
Publication of CN104869079A publication Critical patent/CN104869079A/en
Application granted granted Critical
Publication of CN104869079B publication Critical patent/CN104869079B/en

Links

Abstract

The invention provides a method for queue scheduling based on a dynamic weighted round-robin. The method comprises the following steps of setting and storing a scheduling proportion and a scheduling threshold value of each queue; filling a corresponding scheduling weight for each queue according to the scheduling proportion; obtaining the scheduling weight of each non-empty queue to compare each scheduling weight and each scheduling threshold value, and selecting the queue to read a data packet according to a comparison result; computing according to the scheduling weight of the selected queue and a length of the read data packet in order to update the scheduling weight of the selected queue; and judging whether all queues are empty or the scheduling weight of each queue is smaller than or equal to zero in order to determine whether the scheduling weight of each queue is refilled to carry out scheduling. According to the method, the scheduling threshold value is predetermined and the scheduling weight and the scheduling threshold value of each queue are compared to carry out scheduling on the queue whose scheduling weight is greater than the scheduling threshold value preferentially, so that a flow bandwidth allocated by a high proportion of queues is prevented from being smaller than the configuration proportion, and the accuracy for the scheduling proportion is guaranteed. The invention also provides a scheduling device.

Description

基于动态加权循环法的队列调度方法及装置 The queue scheduling method and apparatus based on a dynamic weighted round robin

技术领域 FIELD

[0001] 本发明涉及通信领域,尤其涉及一种基于动态加权循环法的队列调度方法及装置。 [0001] The present invention relates to the field of communications, particularly to a queue scheduling method and apparatus based on dynamic weighted round robin.

背景技术 Background technique

[0002]目前,在数据通信领域,通过设备的业务种类繁多且流量较大,所以在数据通信设备上都会用到队列调度,动态加权循环法(Dynamic Weighted Round-Robin, DffRR)的队列调度方法是对各队列按照配置比例为每个队列增加调度权值,在每一轮调度循环过程中,使每个队列发送的数据包字节数与填充的调度权值一致,从而到达按比例分配带宽的要求。 [0002] Currently, in the field of data communication through a variety of types of business equipment and larger volume, so the data communication apparatus will be used in the scheduling queue, queue scheduling method for dynamic weighted round-robin (Dynamic Weighted Round-Robin, DffRR) of each queue is configured in accordance with the proportion of each additional queue scheduling weight, per a scheduling cycle, so the number of packet scheduling weight for each queue is filled with bytes transmitted coincides assign bandwidth to reach requirements.

[0003] 然而,由于DWRR的队列调度方法中是轮流对队列进行调度,当调度装置对非空且调度权值为正的队列进行轮流调度时,会导致高配置比例的队列分配的流量带宽小于配置比例,而在其他低比例配置的队列调度权值为负或O时,调度权值大的队列会存在一段时间内发送带宽大于输入带宽,在队列缓存空间有限情况下,造成队列空情况,例如,队列a、b、c、d的输入速率都为120M,DWRR配置的调度比例为I:49:50:100,端口限速为200M,调度最大包长为1K,则每轮调度循环时四个队列填充的调度权值分别为1K、49K、50K、100K,在轮流从4个队列中的非空且调度权值为正的队列中选择一个队列进行调度时,当a、b、c三个队列的调度权值用完后队列d的调度权值剩余50K,此时调度装置只会对队列d进行调度,由于队列的输入速率小于端口限速速率,队列d分配的缓存空间有 [0003] However, since the queue scheduling method is in turn DWRR queue scheduling, when scheduling apparatus for scheduling a non-empty and the weight value is positive, round robin queue, will lead to a high traffic queue assigned a bandwidth smaller than the allocation ratio when allocation ratio, and the O value is negative, or in other low-weight ratio queue scheduling configuration, a large queue scheduling weight there will be a period of time greater than the bandwidth of the transmission input bandwidth, buffer space is limited in the queue, the queue is empty cases causing, for example, queues a, b, c, d are input rate 120M, DWRR configured for scheduling ratio I: 49: 50: 100, port speed to 200M, is a 1K maximum packet size of the scheduling, the scheduling cycle each round filling four queue scheduling weights are 1K, 49K, 50K, 100K, when selected in turn from a queue to schedule the queue 4 and scheduled non-empty queue weight value is positive, when a, b, c scheduling weights of the remaining three queues with queue after scheduling weight of d 50K, only this time the scheduling means scheduling queue d, since the input port queue is less than the rate of rate limit, the buffer space in the queue are assigned d ,从而会导致队列d空而其调度权值剩余即结束一轮调度循环,积累的过程会造成此队列的调度权值溢出,使队列调度发送的数据带宽小于配置比例对应的带宽而无法达到预期带宽,从而导致调度比例不准确。 , Which will lead to d empty queue scheduling weight of its ends a residual i.e. scheduling cycle, the scheduler process will result in the accumulation of the weight of this overflow queue, queue scheduling so that the data transmission bandwidth is less than bandwidth corresponding to the allocation ratio can not achieve the desired bandwidth scheduler resulting in inaccurate ratio.

发明内容 SUMMARY

[0004] 有鉴于此,本发明提供一种能提高调度比例准确性的基于动态加权循环法的队列调度方法及装置。 [0004] Accordingly, the present invention is to provide a improved method and apparatus for scheduling queue based on the accuracy of the dynamic weighted round-robin scheduling in proportion.

[0005] 一种基于动态加权循环法的队列调度方法,其用于在调度装置端口进行队列的调度,所述基于动态加权循环法的队列调度方法包括以下步骤: [0005] A queue scheduling method based on dynamic weighted round-robin, which queues for scheduling in the scheduling apparatus port, the queue scheduling method based on dynamic weighted round robin method comprising the steps of:

[0006] 设置各队列的调度比例及一个调度门限值并存储; [0006] Set the ratio of queues and schedulers threshold value and storing a schedule;

[0007] 根据配置的调度比例依需要为各个队列填充对应的调度权值; [0007] The scheduler according to the scheduling weight ratio corresponding to the configuration of the filling as needed for each queue;

[0008] 在存在非空队列时获取非空队列的各个调度权值来比较各队列的调度权值与所述调度门限值的大小并根据比较结果选择相应队列读取数据包; [0008] Gets the respective non-empty queue scheduling weight in the presence of a non-empty queue to compare the weights of each scheduling queue and scheduling said threshold value and select the appropriate size of the queue read data packet based on the comparison;

[0009] 根据所选队列的调度权值与对应读取的数据包的长度计算以更新所选队列的调度权值; [0009] Based on the updated scheduling weight of selected queue according to the length of the packet scheduling weight of the selected queue with the corresponding read;

[0010] 判断所有队列是否均为空或各队列调度权值是否均小于或等于O并根据判断结果来确定是否重新填充各队列的调度权值以进行调度。 [0010] It is determined whether all the queues are empty or whether the queue scheduling weight of less than or equal to O, and determines whether the scheduled refill weight of each queue to be scheduled in accordance with the determination result.

[0011] 一种基于动态加权循环法的队列调度装置,其用于在调度装置端口进行队列的调度,所述基于动态加权循环法的队列调度装置包括一个配置模块、一个填充模块、一个判断模块、一个分组比较模块、一个数据包读取模块及一个更新计算模块,所述配置模块用于设置各队列的调度比例及一个调度门限值并存储,所述填充模块用于根据配置的调度比例依需要为各个队列填充对应的调度权值,所述判断模块用于判断各队列中是否存在非空队列,所述分组比较模块用于在存在非空队列时获取非空队列的各个调度权值来比较各队列的调度权值与所述调度门限值的大小,所述数据包读取模块用于根据比较结果来选择相应的队列读取数据包,所述更新计算模块用于根据所选队列的调度权值与对应读取的数据包的长度计算以更新所选队列的调度权值,在更新所 [0011] A queue scheduling apparatus based on dynamic weighted round robin method for scheduling in the scheduling queue port means, comprising a configuration module, a module-based filling device dynamic weighted round robin queue scheduling method, a determination module , a packet comparison module, a reading module and a data packet update computation module, the configuration module is used to set the ratio of the scheduling queues and a scheduled threshold value and storing the filling ratio according to the scheduling module configured for as needed to fill the scheduling weight corresponding to each queue, a determination module for determining whether there is a non-empty queue in each queue, the packets comparison module configured to obtain respective non-empty queue scheduling weight in the presence of a non-empty queue scheduling weight compared with the threshold value of the size of each scheduling queue, means for reading the data packet to select the appropriate queue read data packet based on the comparison, the update based on the selected calculation module length of the packet queue scheduling weight corresponding to the read update scheduler calculates the weight of the selected queue, updating the 选队列的调度权值后所述判断模块判断所有队列是否均为空或各队列调度权值是否均小于或等于O并根据判断结果来确定是否重新填充各队列的调度权值以进行调度。 After the selected queue scheduling weight determination module determines whether all the queues are empty or whether the queue scheduling weight of less than or equal to O, and determines whether the scheduled refill weight of each queue to be scheduled in accordance with the determination result.

[0012] 与现有技术相比,本发明提供的基于动态加权循环法的队列调度方法及装置利用配置模块预先设置一个调度门限值,分组比较模块比较各队列的调度权值与调度门限值的大小后优先对调度权值大于调度门限值或者调度权值大于等于调度门限值的优先队列进行调度,避免高配置比例的队列分配的流量带宽小于配置比例,防止高配置比例的队列调度权值溢出,保证了动态加权循环法的队列调度比例的准确性,以使队列的带宽达到预期效果。 [0012] Compared with the prior art, the present invention provides a method and apparatus based on the queue scheduling module configured using dynamic weighted round-robin schedule of a previously set threshold value, the comparison module compares the packet scheduling weight for each queue scheduling gate threshold the size of the value of the priority scheduling weight greater than the threshold scheduler scheduling weight greater than or equal to the priority queue scheduling scheduling threshold, assign queues to avoid high traffic bandwidth allocation ratio is smaller than the allocation ratio, arranged to prevent a high proportion of the queue scheduling weights overflow queue scheduling to ensure the accuracy of the ratio of dynamic weighted round-robin, so that the bandwidth of traffic expected.

附图说明 BRIEF DESCRIPTION

[0013] 图1是本发明提供的基于动态加权循环法的队列调度装置的模块示意图。 [0013] FIG. 1 is a schematic block queue scheduling apparatus based on a dynamic weighted round-robin of the present invention is provided.

[0014] 图2是本发明基于动态加权循环法的队列调度方法的流程图。 [0014] FIG 2 is a flowchart of a method of dynamic weighted round robin queue scheduling method of the present invention.

[0015] 主要元件符号说明 [0015] Main reference numerals DESCRIPTION

[0016] 基于DWRR的队列调度装置 100 [0016] Based on the queue scheduling apparatus 100 DWRR

[0017] 配置模块 110 [0017] Configuration module 110

[0018] 填充模块 120 [0018] filling module 120

[0019] 基数设置单元 122 [0019] The base unit 122 is provided

[0020] 填充计算单元 124 [0020] The calculation unit 124 is filled

[0021] 判断模块 130 [0021] The determining module 130

[0022] 分组比较模块 140 [0022] The comparison module 140 packets

[0023] 数据包读取模块 150 [0023] The reading module 150 packets

[0024] 更新计算模块 160 [0024] update computation module 160

[0025] 如下具体实施方式将结合上述附图进一步说明本发明。 [0025] The following specific embodiments in conjunction with the accompanying drawings, the present invention is described.

具体实施方式 Detailed ways

[0026] 请参阅图1,其为本发明实施方式提供的一种基于动态加权循环法(DynamicWeighted Round-Robin,DWRR)的队列调度装置100,其用于在DWRR调度装置的端口进行队列的调度,所述基于DWRR的队列调度装置100包括一个配置模块110、一个填充模块120、一个判断模块130、一个分组比较模块140、一个数据包读取模块150及一个更新计算模块160。 [0026] Please refer to FIG. 1, one embodiment of the present provides a queue scheduling apparatus based on dynamic weighted round-robin (DynamicWeighted Round-Robin, DWRR) of the invention 100, which queues for scheduling in the scheduling apparatus of the port DWRR the queue scheduling based DWRR apparatus 100 includes a configuration module 110, a filling module 120, a judging module 130, a comparison module 140 packet, a packet reading module 150 and a calculation module 160 updates.

[0027] 所述配置模块110用于设置各队列的调度比例及一个调度门限值并存储,本实施方式中,设定四个队列a、b、c、d使用DWRR调度方式映射到一个输出端口,配置四个队列a、 [0027] The module 110 is configured to set the ratio of the scheduling queues and a scheduled threshold value and store, in this embodiment, four queues set a, b, c, d using DWRR Scheduling mapped to an output port configured four queues a,

b、c、d的调度比例为I:10:20:50,调度门限值设定为120KB(千字节)。 Scheduling ratio b, c, d is I: 10: 20: 50, the threshold is set to dispatch 120KB (kilobytes). 可以理解的是,调度比例及调度门限值依需要自行设定即可。 It will be appreciated that the ratio of scheduling and a scheduling threshold need be set by itself.

[0028] 所述填充模块120包括一个基数设置单元122及一个填充计算单元124,所述基数设置单元122用于依需要确定一个填充基数值,本实施方式中,为方便电路的处理,确定的填充基数值为一个大于最大包长的最小整数值,如以太网的最大包长为1518B (Byte),则确定填充基数值为2K,从而保证每轮调度每个队列可以调度一个数据包。 [0028] The filling module 120 includes a base 122 and a filling unit arranged calculation unit 124, a base 122 is provided for filling a base value by means determines that, according to the present embodiment, the processing for the convenience of the circuit, determined filling a base value is the maximum packet length is greater than the minimum integer value, such as the maximum Ethernet packet size is 1518B (Byte), it is determined that the base is filled 2K, thus ensuring the round schedules each queue may schedule a packet. 所述填充计算单元124用于依照配置模块110对各队列配置的调度比例分别乘以所确定的填充基数值以得到各个队列的调度权值。 The filling means 124 for calculating the ratio in accordance with the scheduling module 110 is configured for each queue configuration are multiplied by the determined base value filled to obtain a scheduling weight of each queue. 本实施方式中,队列a、b、c、d的调度权值分别为1X2K、10X2K、20X2K、50X2K,即分别为2Κ、20Κ、40Κ、100Κ。 In the present embodiment, queues a, b, c, d respectively, the scheduling weight 1X2K, 10X2K, 20X2K, 50X2K, i.e. respectively 2Κ, 20Κ, 40Κ, 100Κ.

[0029] 所述判断模块130用于判断各队列中是否存在非空队列及端口的发送速率是否正常,若队列中不存在非空队列且端口的发送速率不正常即端口发送速率不在正常限速范围内时,调度装置100会处于等待状态直到端口发送速率满足端口的限速范围且存在非空队列。 [0029] The determining module 130 for determining whether there is a queue for each non-empty queue and a transmission rate of the port is normal, if non-empty queue and the transmission rate of the port does not exist in the queue is not normal i.e. not in the normal speed transmission rate port when the range, scheduling means 100 will be in a wait state until the port to meet the transmission rate and the speed limit of the port there is a non-empty queue. 可以理解的是,判断模块130判断出存在非空队列后会记录下非空队列的队列号。 It will be appreciated that the determining module 130 determines that there is a non-empty queue in the queue number will be recorded after a non-empty queue. 本实施方式中,判断端口限速使用单令牌桶的方式实现,当令牌桶的令牌为正数时表示端口发送速率在正常范围内,队列中没有任何元素时表示队列为空队列,如根据队列的头尾指针或表头中的标志位等来判断队列是否为非空。 In the present embodiment, the line rate is determined using a single token bucket manner, the port transmission rate in the normal range, there is no queue element indicates that the queue is empty queue token when the token bucket is a positive number, the head and tail pointer as flag or the like in the header to determine whether the queue is non-empty queue.

[0030] 所述分组比较模块140用于在判断模块130判断队列中存在非空队列时从填充模块120中获取相应非空队列中各队列的调度权值,并比较各非空队列的调度权值与所设置的调度门限值的大小,可以理解的是,分组比较模块140根据判断模块130记录的非空队列号从填充模块中获取相对应队列的调度权值。 Obtaining scheduling weight for each queue is non-empty queue corresponding to [0030] of the packet for comparison module 140 determines that there is a non-empty queue module 130 determines a queue from filling module 120, and compare each non-empty queue scheduling weight and scheduling threshold value the size of the set, it is understood that the comparison module 140 acquires packet scheduling weight corresponding queue from filling module 130 according to a non-empty queue record determination module. 本实施方式中,各队列的调度权值与调度门限值的大小关系分为调度权值大于或等于调度门限值的优先队列及调度权值小于调度门限值的队列。 The present embodiment, the scheduling and dispatching weight threshold magnitude relationship into each queue scheduling weight equal to or greater than the threshold scheduler and a scheduling priority queue is less than the weight threshold scheduling queue. 可以理解的是,各队列的调度权值与调度门限值的大小关系还可分为调度权值大于调度门限值的优先队列及调度权值小于或等于调度门限值的队列。 It will be appreciated that the scheduling weight for each queue scheduling gate limits the magnitude relationship can be divided into scheduling weight greater than a threshold value scheduling priority queue and scheduling weight of less than or equal to the threshold value scheduling queue.

[0031] 本实施方式中,在比较各队列调度权值与配置门限值时,使用一个4比特的权值指示信号表示队列调度权值是否大于配置门限值,如在队列的调度权值大于配置门限值时,指示信号对应比特置为1,否则置为O。 [0031] In the present embodiment, when comparing the weight of the queue scheduling configuration threshold value, using a 4-bit indication signal indicating whether weights scheduling weight greater than the configured threshold queue, such as queue scheduling metric value is greater than the threshold value configuration, the signal indicating the corresponding bit is set to 1, otherwise it is set to O.

[0032] 所述数据包读取模块150用于根据分组比较模块140的比较结果来选择相应的队列读取队列的一个数据包,即在分组比较模块140判断出优先队列后,数据包读取模块150先从优先队列中选择一个队列读取数据包,本实施方式中,在分组比较模块140判断出存在调度权值大于或等于调度门限值的优先队列时,即判断出指示权值信号为I的队列时,数据包读取模块150先从调度权值大于或等于调度门限值的优先队列中选择一个队列读取数据包,在分组比较模块140比较不存在调度权值大于或等于调度门限值的优先队列时,即各非空队列的调度权值小于调度门限值,数据包读取模块150从指示权值为O的各非空队列中选择一个队列读取数据包。 After [0032] The packet data reading module 150 for selecting a corresponding data packet read queue queues the packet according to a comparison result of the comparison module 140, i.e., the comparison module 140 determines that the packet priority queue, the packets read when the start module 150 selects one queue priority queue read data packets, according to the present embodiment, the comparison module 140 determines that the packet there is a priority queue scheduling weights greater than or equal scheduled threshold value, i.e. determines that the signal indicative of the weight I is the queue, the read module 150 to start a data packet scheduling weight equal to or greater than the threshold value of priority queue scheduling queue read a selected packet, the packet 140 does not exist in comparing the comparison module scheduling weight of greater than or equal when the threshold priority queue scheduling, i.e. scheduling weight of each non-empty queue scheduling is smaller than the threshold value, the data read module 150 selects a packet queue read data packets from each non-empty queue is indicated in the right value of O.

[0033] 可以理解的是,若分组比较模块140判断出存在调度权值大于调度门限值的优先队列时,则数据包读取模块150先从调度权值大于调度门限值的优先队列中选择一个队列读取数据包,若分组比较模块140比较不存在调度权值大于调度门限值的优先队列时,即各非空队列的调度权值小于或等于调度门限值,则数据包读取模块150从小于或等于调度门限值的队列中选择一个队列读取数据包。 [0033] It will be appreciated that, if the comparison module 140 determines that the packet there is a priority queue scheduling weight is greater than the threshold value of the scheduling, the data read module 150 to start the packet scheduler scheduling priority queue is greater than the weight threshold in selecting a data packet queue reading, if the comparison module 140 compares the packet priority scheduling queue scheduling weight greater than the threshold value does not exist, i.e. each non-empty queue scheduling weight of less than or equal scheduling threshold, the packet is read module queues take from less than or equal to the threshold scheduler 150 selects one queue read packet.

[0034] 所述更新计算模块160用于将所选队列的调度权值减去对应读取的数据包的长度后计算得到所选队列更新后的调度权值,也即用队列的调度权值减去选择的数据包的实际长度后更新作为当前比较的值。 [0034] The calculation module 160 is used to update the selected queue scheduling weights calculated by subtracting the weight of the selected schedule update queue length of the packet corresponding to the read, i.e. with the queue scheduling weight as the current comparison values ​​by subtracting the updated actual length of the selected packets. 例如,所选队列的调度权值为2K,所选队列读取的数据包的包长为1536B,则所选队列的调度权值将更新为2KB-1536B = 2 X 1024B-1536B = 512B,调度权值以字节(Byte)为单位。 For example, the scheduling weight of selected queue is 2K, packet length data packets selected queue 1536b is read, the scheduling weight of the selected queue is updated to 2KB-1536B = 2 X 1024B-1536B = 512B, scheduling weight in bytes (byte) units.

[0035] 在更新计算模块160将所选队列的调度权值进行计算更新后,判断模块130将判断所有队列是否均为空队列或各队列调度权值是否均小于或等于O并根据判断结果来确定是否重新填充各队列的调度权值以进行调度,即若所有队列均为空队列或者各队列的调度权值小于或等于0( < O)时,本轮调度结束,填充模块120为各队列根据配置比例填充调度权值后进行下一轮调度,若所有队列不为空队列或者各队列的调度权值大于O时,判断模块130将再次判断各队列中是否存在非空队列及端口的发送速率是否正常后以继续本轮调度。 After [0035] the weight of selected queue scheduling is calculated in the updated update computation module 160, the determining module 130 determines whether all queues are empty queue or if the queue scheduling weight of less than or equal to O, and based on the result determining whether the scheduled refill weight of each queue to be scheduled, i.e., if all queues are empty queue or a scheduling weight for each queue is less than or equal to 0 (<O), the end of the scheduling round, each queue is filling module 120 according to one configuration after scheduling the scheduling weight ratio of filler, if all the queue is not empty queue or a scheduling weight for each queue is greater than O, the determining module 130 again determines whether to send the non-empty queue and the port is present in each queue after the rate is normal scheduled to continue the current round.

[0036] 请参阅图2,其为本发明实施方式提供的一种基于动态加权循环法的队列调度方法的流程图,其用于在调度装置端口进行队列的调度,所述基于动态加权循环法的队列调度方法包括以下步骤: [0036] Referring to FIG 2, one embodiment of the present invention which provides a flowchart of the queue scheduling method based on dynamic weighted round-robin, which queues for scheduling in a scheduling apparatus of a port, based on a dynamic weighted round-robin the queue scheduling method comprising the steps of:

[0037] SllO:设置各队列的调度比例及一个调度门限值并存储; [0037] SllO: Set queues and schedulers ratio threshold value and storing a schedule;

[0038] S120:根据配置的调度比例依需要为各个队列填充对应的调度权值; [0038] S120: scheduling weight for each queue corresponding to the filling ratio based on the scheduling configuration as needed;

[0039] S130:判断端口发送速率是否正常且判断是否存在非空队列,若是,则进入步骤S140,若否,则等待直到端口发送速率正常且存在非空队列后进入步骤S140 ; [0039] S130: judging whether the transmission rate is normal and the port determines whether or not there is a non-empty queue, and if yes, the process proceeds to step S140, the if not, the transmission rate of the port normally waits until there is a non-empty queue and flow proceeds to Step S140;

[0040] S140:比较是否存在调度权值大于或等于调度门限值的优先队列,若是,则进入步骤S150,若否,则进入步骤S160。 [0040] S140: comparing whether there is a scheduling weight greater than or equal priority queue scheduling threshold, if yes, the process proceeds to step S150, the if not, the process proceeds to step S160.

[0041] S150:从调度权值大于或等于调度门限值的优先队列中选择一个队列进行调度; [0041] S150: From the scheduling weight equal to or greater than the threshold value scheduling priority queues selected a scheduling queue;

[0042] S160:从调度权值小于调度门限值的队列中选择一个队列进行调度; [0042] S160: From the scheduling weight is less than the threshold value of the queue scheduling selecting a scheduling queue;

[0043] S170:根据所选择的队列读取数据包; [0043] S170: reading the data packet according to the selected queue;

[0044] S180:根据所选队列的调度权值与对应读取的数据包的长度计算以更新所选队列的调度权值; [0044] S180: Based on the updated scheduling weight of selected queue length of the packet according to the selected queue scheduling weight corresponding to the read;

[0045] S190:判断所有队列是否均为空或各队列调度权值是否均小于或等于0,若是,则返回步骤S120,若否,则返回步骤S130。 [0045] S190: determining whether all the queues are empty or whether the scheduling weight for each queue is less than or equal to 0, and if yes, returns to step S120, and if not, returns to step S130.

[0046] 在步骤SllO中,利用配置模块110设置各队列的调度比例及一个调度门限值并存储,本实施方式中,配置四个队列a、b、c、d的调度比例为1:10:20:50,调度门限值设定为120KB。 [0046] In step SllO, the configuration module 110 is provided by using the ratio of the scheduling queues and a scheduled threshold value and store, in this embodiment, four queues arranged a, scheduling ratio b, c, d is 1:10 : 20: 50, the threshold value is set to dispatch 120KB.

[0047] 在步骤S120中包括以下步骤: [0047] comprising the following steps in step S120:

[0048] S121:依需要确定一个填充基数值; [0048] S121: determined by filling a base value;

[0049] S122:依照各队列配置的调度比例分别乘以所确定的填充基数值以得到各个队列的调度权值。 [0049] S122: In accordance with the ratio of the scheduling queue configuration are multiplied by the determined base value filled to give each scheduling queue weights.

[0050] 在步骤S121中,利用基数设置单元122依需要确定一个填充基数值,本实施方式中,确定的填充基数值为一个大于最大包长的最小整数值,如以太网的最大包长为1518B,则确定填充基数值为2K。 [0050] In step S121, the setting unit 122 using a radix determined by filling a base value, the present embodiment, determining the base fill value is greater than a maximum packet size of the smallest integer value, such as the maximum Ethernet packet size is 1518B, it is determined that the base is filled 2K.

[0051] 在步骤S122中,利用填充计算单元124依照配置模块110对各队列配置的调度比例分别乘以所确定的填充基数值以得到各个队列的调度权值。 [0051] In step S122, the calculation unit 124 using the filling ratio in accordance with the scheduling module 110 is configured for each queue configuration are multiplied by the determined base value filled to obtain a scheduling weight of each queue. 本实施方式中,如队列a、b、 In the present embodiment, such as queues a, b,

c、d的剩余调度权值分别为-1K、0、10K、40K,四个队列a、b、c、d的调度比例为I:10:20:50,填充基数值为2K,则队列a、b、c、d的调度权值重新填充后分别为1K、20K、50K、140K。 c, d is the residual scheduling weight ratio are scheduled -1K, 0,10K, 40K, four queues a, b, c, d is I: 10: 20: 50, the base is filled 2K, then a queue after, b, c, d refill scheduling weights are 1K, 20K, 50K, 140K.

[0052] 在步骤S130中,利用判断模块130判断各队列中是否存在非空队列及端口的发送速率是否正常,若队列中不存在非空队列且端口的发送速率不正常即端口发送速率不在正常限速范围内时,调度装置100会处于等待状态直到端口发送速率满足端口的限速范围且存在非空队列。 [0052] In step S130, if the determination module 130 determines in each queue if there is transmission rate of a non-empty queue and the port is normal, if the transmission rate of a non-empty queue and the port does not exist in the queue is not normal i.e. port transmission rate is not normal when the speed range, the scheduling means 100 will be in a wait state until the port to meet the transmission rate and the speed limit of the port there is a non-empty queue.

[0053] 在步骤S140中,利用分组比较模块140比较是否存在调度权值大于或等于调度门限值的优先队列,当出现各队列的调度权值中存在大于或小于调度门限值的队列时,分组比较模块140将所有队列分为了两组,其中一组优先队列的调度权值大于或等于调度门限值,另一组队列的调度权值小于调度门限值。 When [0053] In step S140, the comparison module using a packet scheduling priority queue scheduling weights greater than or equal threshold comparator 140 exists when there is a scheduling weight for each queue is present in greater or less than the threshold value a queue scheduling , all packets queue comparison module 140 is divided into two groups, one group scheduling priority queue weights equal to or greater than the threshold value scheduling, the scheduling weight value is smaller than the other set of queues scheduled threshold value. 本实施方式中,队列a、b、c的调度权值分别为1K、20K、50K,均小于调度门限值120Κ,d队列的调度权值为140K,大于调度门限值120K,即四个队列分为两组,一组为队列a、b、c,权值指示信号为0,另一组为队列d,权值指示信号为I。 In the present embodiment, queues a, b, c scheduling weight respectively 1K, 20K, 50K, is less than the scheduler threshold 120Κ, d queue scheduling weight is 140K, 120K greater than a threshold value scheduling, i.e. four queue divided into two groups, one group queues a, b, c, weight indicating signal is 0, the other group queues d, weight indication signal is I.

[0054] 可以理解的是,分组比较模块140还可以将两组队列分为一组优先队列的调度权值大于调度门限值,另一组队列的调度权值小于或等于调度门限值,即可依据实际需要确定调度权值与调度门限值相等的队列是否优先调度。 [0054] It will be appreciated that the packet comparison module 140 may also be divided into two groups of a set of queue scheduling weights scheduling priority queue is greater than a threshold value, another set of queue scheduling weight less than or equal scheduling threshold value, it can be based on actual need to determine whether equal weights of scheduling and dispatching threshold queue priority scheduling.

[0055] 在步骤S150中,在分组比较模块140判断出存在调度权值大于或等于调度门限值的优先队列时从优先队列中选择一个队列进行调度,本实施方式中,队列d的调度权值大于调度门限值,则可依据队列d的权值指示信号I来选择优先调度队列d。 [0055] In step S150, the comparison module 140 determines that the packet from the priority queue exists scheduling weight of greater than or equal priority queue scheduling a selected threshold for queue scheduling, the present embodiment, the scheduling weights of the queues of d scheduling value is greater than the threshold value, the basis weights of the queues may be indicative of the value of the signal d I d to select the priority scheduling queue. 可以理解的是,下次调度时轮流从优先队列中选择一个队列进行调度,即若优先队列中包括两个队列,则本次调度一个队列,下次调度时轮流调度另一个队列。 It will be appreciated that, when selected in turn a next scheduled dispatch queue, i.e. if the queue includes two priority queues, the queue from the present scheduling a priority queue, another queue the next round robin scheduling.

[0056] 在步骤S160中,在分组比较模块140比较不存在调度权值大于或等于调度门限值的优先队列时随机从调度权值小于调度门限值的队列中选择一个队列进行调度。 [0056] In step S160, the comparison module 140 compares the packet scheduling is not random weights greater than or equal priority queue scheduling threshold value is smaller than the threshold value from the scheduling queue scheduling weight for a selected queue scheduling exist. 可以理解的是,下次调度时轮流从调度权值小于调度门限值的队列中选择一个队列进行调度,即若非空队列中包括两个队列,则本次调度一个队列,下次调度时轮流调度另一个队列。 It will be appreciated that, in turn is less than the weight scheduled values ​​from the scheduler queue threshold select a scheduling queue schedule the next, i.e., if not empty queue includes two queues, the present scheduling queue, the next scheduled turn scheduling another queue.

[0057] 在步骤S170中,利用数据包读取模块150选择相应的队列读取队列的一个数据包,本实施方式中,若分组比较模块140判断出存在调度权值大于或等于调度门限值的优先队列时,则数据包读取模块150先优先队列中选择一个队列读取数据包,即数据包读取模块150根据队列d的权值指示信号I来选择读取队列d的数据包。 [0057] In step S170, the data packet using the read module 150 selects the appropriate queue to read a packet queue, in the present embodiment, the comparison module 140 determines if a packet scheduling weight that there is greater or equal to the threshold scheduler when the priority queue, the packet reading module 150 to select a queue priority queue read data packet, i.e. a packet data read module 150 reads the packet queue is the queue weight d d I value is selected according to the instruction signal.

[0058] 可以理解的是,若分组比较模块140比较不存在调度权值大于或等于调度门限值的优先队列时,即各非空队列的调度权值小于调度门限值,则数据包读取模块150从调度权值小于调度门限值的队列中随机选择一个队列读取数据包。 [0058] It will be appreciated that, if the comparison module 140 compares the packet scheduling priority queue scheduling weights greater than or equal to the threshold value does not exist, i.e. each non-empty queue scheduling weight scheduled value is smaller than the threshold value, the packet is read taken from the scheduling module 150 scheduling weights less than the threshold value a queue randomly selected queue read packet.

[0059] 在步骤S180中,利用更新计算模块160将所选队列的调度权值减去对应读取的数据包的长度后得到所选队列更新后的调度权值。 [0059] In step S180, update computation module 160 using the scheduling weight obtained by subtracting the selected queue scheduling weight of the selected queue after updating the corresponding length of the packet read. 例如,所选队列的调度权值为2K,所选队列读取的数据包的包长为1536B,则所选队列的调度权值将更新为2KB-1536B =2X1024B-1536B = 512B,调度权值以字节(Byte)为单位。 For example, the scheduling weight of selected queue is 2K, packet length data packets selected queue 1536b is read, the scheduling weight of the selected queue is updated to 2KB-1536B = 2X1024B-1536B = 512B, scheduling weight byte (byte) units.

[0060] 在步骤S190中,利用判断模块130判断所有队列是否均为空队列或各队列调度权值是否均小于或等于0,若所有队列均为空队列或者各队列的调度权值小于等于0( < O)时,则本轮调度结束,返回步骤S120,即填充模块120重新为各队列根据配置比例填充调度权值后进行下一轮调度。 [0060] In step S190, if the determination module 130 determines whether all queues are empty queue or if the queue scheduling weights were less than or equal to 0, if all queues are empty queue scheduling weight for each queue is less than or equal to 0 (<O), then scheduling round end, return step S120, the module 120 that is filled with a re-scheduled at each scheduling queues according to weights arranged after the filling ratio. 若判断模块130判断所有队列不为空队列时,返回步骤S130继续判断端口发送速率是否正常后继续本轮调度,若判断模块130判断各队列的调度权值大于O时,返回步骤S130继续判断各队列中是否存在非空队列及端口的发送速率是否正常后以继续本轮调度。 Determining module 130 determines if all the queue is not empty queue, returns to step S130 to continue the current round is determined to continue scheduling the transmission rate after the port is normal, the determining module 130 determines if the scheduling weight for each queue is greater than O, returns to step S130 continues to determine the respective whether the transmission rate and the queue not empty port exists whether to continue the normal round of scheduling queues.

[0061] 本发明提供的基于动态加权循环法的队列调度装置100及方法中,利用配置模块110预先设置一个调度门限值,分组比较模块140比较各队列的调度权值与调度门限值的大小后优先对调度权值大于调度门限值或者调度权值大于等于调度门限值的优先队列进行调度,避免高配置比例的队列分配的流量带宽小于配置比例,防止高配置比例的队列调度权值溢出,保证了DWRR队列的调度比例的准确性,以使队列的带宽达到预期效果。 [0061] The present invention provides a method based on the queue 100 and the dynamic weighted round-robin scheduling apparatus, a configuration module 110 by using a preset schedule threshold comparison module 140 compares each of the packet queues and scheduling scheduling weight threshold after the size is greater than the priority of the scheduling weight threshold scheduler scheduling weight greater than or equal to the priority queue scheduling scheduling threshold, assign queues to avoid high traffic bandwidth allocation ratio is smaller than the allocation ratio, a high weight to prevent the queue scheduling allocation ratio overflow value, to ensure the accuracy of the scheduling queue DWRR ratio, so that the bandwidth of traffic expected.

[0062] 可以理解的是,对于本领域的普通技术人员来说,可以根据本发明的技术构思做出其他各种相应的改变与变形,而所有这些改变与变形都应属于本发明权利要求的保护范围。 [0062] It will be appreciated that those of ordinary skill in the art, can make various changes and modification of other appropriate according to the technical concept of the present invention, and all such modifications and variations should belong to the claims of the invention protected range.

Claims (10)

1.一种基于动态加权循环法的队列调度方法,其用于在调度装置端口进行队列的调度,所述基于动态加权循环法的队列调度方法包括以下步骤: 设置各队列的调度比例及一个调度门限值并存储; 根据配置的调度比例依需要为各个队列填充对应的调度权值; 在存在非空队列时获取非空队列的各个调度权值来比较各队列的调度权值与所述调度门限值的大小并根据比较结果选择相应队列读取数据包; 根据所选队列的调度权值与对应读取的数据包的长度计算以更新所选队列的调度权值; 判断所有队列是否均为空或各队列调度权值是否均小于或等于O并根据判断结果来确定是否重新填充各队列的调度权值以进行调度。 A queue scheduling method based on dynamic weighted round-robin, which queues for scheduling in the scheduling apparatus port, the queue scheduling method based on dynamic weighted round robin method comprising the steps of: setting the ratio of each queue scheduler and a scheduling and storing the threshold value; scheduling configuration proportion requires scheduling weight for each queue corresponding to a habit of filling; comparison to obtain respective non-empty queue scheduling weight in the presence of a non-empty queue scheduling weight for each queue and the scheduler threshold value and select the appropriate size of the read data packet queue according to the comparison result; calculated to update the selected queue scheduling weight according to the length of the packet scheduling weight of the selected queue corresponding to the read; determining whether all queues are each queue is empty or whether the scheduling weight of less than or equal to O, and determines whether the refill scheduling weight for each queue to be scheduled in accordance with the determination result.
2.如权利要求1所述的基于动态加权循环法的队列调度方法,其特征在于,在为各队列填充调度权值的步骤中包括以下步骤: 依需要确定一个填充基数值; 依照各队列配置的调度比例分别乘以所确定的填充基数值以得到各个队列的调度权值。 2. The queue scheduling method based on dynamic weighted round-robin, wherein said 1, comprising the step of scheduling the step of filling the respective weights queue claim: determined by filling a required value group; each queue is configured in accordance with scheduling filling ratio is multiplied by the determined base value to obtain each scheduling queue weights.
3.如权利要求1所述的基于动态加权循环法的队列调度方法,其特征在于,在更新所选队列的调度权值的步骤中包括以下步骤: 将所选队列的调度权值减去对应读取的数据包的长度后得到所选队列更新后的调度权值。 Scheduling weights corresponding to the selected queue subtracted: 3. The queue scheduling method based on dynamic weighted round-robin, wherein said 1, comprising the step of scheduling the step of updating the selected queue weights claims after the read length of the packet scheduling weight to give the selected queue updates.
4.如权利要求1所述的基于动态加权循环法的队列调度方法,其特征在于,在比较各队列的调度权值与调度门限值的大小步骤中包括以下步骤: 比较是否存在调度权值大于或等于所述调度门限值的优先队列,若是,则先从优先队列中选择一个队列读取数据包,若否,则从非空队列中选择一个队列读取数据包。 4. The queue scheduling method based on dynamic weighted round robin method according to claim 1, characterized in that it comprises the steps of scheduling in scheduling weight threshold comparison step size in each queue: if the scheduling weight Comparative presence greater than or equal to the priority queue scheduling threshold, if yes, select a start priority queue read packet queue, if not, selected from a non-empty queue read packet queue.
5.如权利要求1所述的基于动态加权循环法的队列调度方法,其特征在于,在比较各队列的调度权值与调度门限值的大小步骤中包括以下步骤: 比较是否存在调度权值大于所述调度门限值的优先队列,若是,则先从优先队列中选择一个队列读取数据包,若否,则从调度权值小于或等于所述调度门限值的队列中选择一个队列读取数据包。 The queue scheduling method based on dynamic weighted round robin method according to claim 1, characterized in that it comprises the steps of scheduling in scheduling weight threshold comparison step size in each queue: if the scheduling weight Comparative presence scheduling priority queue is greater than the threshold, if yes, select a start priority queue read packet queue, if not, from the scheduling weight of less than or equal to the threshold value scheduling queue select a queue reading the data packet.
6.如权利要求1所述的基于动态加权循环法的队列调度方法,其特征在于,在填充调度权值与比较调度权值的步骤之间还包括以下步骤: 判断端口发送速率是否正常且判断是否存在非空队列。 6. The queue scheduling method based on dynamic weighted round robin method according to claim 1, characterized in that, between the step of filling the scheduling weight scheduled weight comparison further comprises the steps of: determining whether the port is normal and determines a transmission rate if there is non-empty queue.
7.—种基于动态加权循环法的队列调度装置,其用于在调度装置端口进行队列的调度,所述基于动态加权循环法的队列调度装置包括: 一个配置模块,用于设置各队列的调度比例及一个调度门限值并存储; 一个填充模块,用于根据配置的调度比例依需要为各个队列填充对应的调度权值; 一个判断模块,用于判断各队列中是否存在非空队列; 一个分组比较模块,用于在存在非空队列时获取非空队列的各个调度权值来比较各队列的调度权值与所述调度门限值的大小; 一个数据包读取模块,用于根据比较结果来选择相应的队列读取数据包; 一个更新计算模块,用于根据所选队列的调度权值与对应读取的数据包的长度计算以更新所选队列的调度权值; 在更新所选队列的调度权值后所述判断模块判断所有队列是否均为空或各队列调度权值是否均小于或等于 7.- species queue scheduling apparatus based dynamic weighted round robin method for scheduling in the scheduling queue port means, said queue scheduling apparatus based on dynamic weighted round-robin comprises: a configuration module, to set scheduling for each queue ratio and a threshold value and storing the schedule; a filling module, according to the ratio of the scheduling configuration as needed to fill the scheduling weight corresponding to each queue; a determining module, for determining whether there is a non-empty queue in each queue; a packet comparison module, configured to obtain respective non-empty queue scheduling weight in the presence of a non-empty queue to the scheduling weight for each comparison with the scheduling queue size threshold; a data packet read module for comparison results selects corresponding queues read data packet; updating a calculation module for calculating the selected queue to update the scheduling weight according to the length of the packet scheduling weight of the selected queue with the corresponding read; update selected after the queue scheduling weight determination module determines whether all the queues are empty or whether the queue scheduling weights were less than or equal to O并根据判断结果来确定是否重新填充各队列的调度权值以进行调度。 O and determining whether to refill each scheduling queue to perform the weight determination in accordance with the scheduling result.
8.如权利要求7所述的基于动态加权循环法的队列调度装置,其特征在于,所述填充模块包括一个基数设置单元及一个填充计算单元,所述基数设置单元用于依需要确定一个填充基数值,所述填充计算单元用于依照各队列配置的调度比例分别乘以所确定的填充基数值以得到各个队列的调度权值。 8. The queue scheduling based device of claim 7 dynamic weighted round-robin claim, characterized in that said filling module comprises a base and a filling unit arranged calculating unit, said base unit is provided for determining a fill as needed base value, means for calculating the filling ratio in accordance with the scheduling queue configuration are multiplied by the respective filling values ​​based on the determined scheduling weight to give each queue.
9.如权利要求7所述的基于动态加权循环法的队列调度装置,其特征在于,所述分组比较模块比较是否存在调度权值大于或等于所述调度门限值的优先队列,若是,则所述数据包读取模块先从优先队列中选择一个队列读取数据包,若否,则所述数据包读取模块从非空队列中选择一个队列读取数据包。 According to claim 7 based on the queue scheduling apparatus of a dynamic weighted round-robin, wherein said comparison module compares whether the packet queue scheduling priority threshold value is greater than or equal to a scheduling weight to the presence, if yes, reading the data packet start module selects one priority queue read packet queue, if not, the read data packet queue module selects a data packet to read from the non-empty queue.
10.如权利要求7所述的基于动态加权循环法的队列调度装置,其特征在于,所述分组比较模块比较是否存在调度权值大于所述调度门限值的优先队列,若是,则所述数据包读取模块先从优先队列中选择一个队列读取数据包,若否,则所述数据包读取模块从调度权值小于或等于所述调度门限值的队列中选择一个队列读取数据包。 10. The apparatus of claim queue scheduling based on dynamic weighted round-robin 7 claim, wherein said comparison module compares whether the packet scheduling weight is greater than the threshold value scheduling priority queue exists, and if yes, the packet start reading module selects one priority queue read packet queue, if not, read the packet from the scheduling module is smaller than or equal to the weight threshold scheduling queue read select a queue data pack.
CN201510318925.5A 2015-06-11 2015-06-11 Array dispatching method and device based on dynamic weighting round-robin method CN104869079B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510318925.5A CN104869079B (en) 2015-06-11 2015-06-11 Array dispatching method and device based on dynamic weighting round-robin method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510318925.5A CN104869079B (en) 2015-06-11 2015-06-11 Array dispatching method and device based on dynamic weighting round-robin method

Publications (2)

Publication Number Publication Date
CN104869079A true CN104869079A (en) 2015-08-26
CN104869079B CN104869079B (en) 2018-03-20

Family

ID=53914609

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510318925.5A CN104869079B (en) 2015-06-11 2015-06-11 Array dispatching method and device based on dynamic weighting round-robin method

Country Status (1)

Country Link
CN (1) CN104869079B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106533982A (en) * 2016-11-14 2017-03-22 西安电子科技大学 Dynamic queue scheduling device and method based on bandwidth borrowing
CN107185222A (en) * 2017-05-27 2017-09-22 竞技世界(北京)网络技术有限公司 Cards game head is the determination method and device of power

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1111858A2 (en) * 1999-12-22 2001-06-27 Alcatel USA Sourcing, L.P. A weighted round robin scheduling engine
WO2002009358A2 (en) * 2000-07-26 2002-01-31 Santera Systems, Inc. Method of active dynamic resource assignment in a telecommunications network
US6438135B1 (en) * 1999-10-21 2002-08-20 Advanced Micro Devices, Inc. Dynamic weighted round robin queuing
US6470016B1 (en) * 1999-02-09 2002-10-22 Nortel Networks Limited Servicing output queues dynamically according to bandwidth allocation in a frame environment
CN101026558A (en) * 2007-01-18 2007-08-29 华为技术有限公司 Method and device for realizing mass port backpressure
CN101964758A (en) * 2010-11-05 2011-02-02 南京邮电大学 Differentiated service-based queue scheduling method
US20110149977A1 (en) * 2009-12-17 2011-06-23 Juniper Networks, Inc. Avoiding unfair advantage in weighted round robin (wrr) scheduling
CN102231697A (en) * 2011-06-17 2011-11-02 瑞斯康达科技发展股份有限公司 Bandwidth dispatching method of message queues as well as message reporting method and device
CN103873383A (en) * 2012-12-12 2014-06-18 中国移动通信集团上海有限公司 Queue scheduling method and device
CN103888379A (en) * 2013-12-03 2014-06-25 江苏达科信息科技有限公司 Improved queue scheduling algorithm based on trusted scheduling

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6470016B1 (en) * 1999-02-09 2002-10-22 Nortel Networks Limited Servicing output queues dynamically according to bandwidth allocation in a frame environment
US6438135B1 (en) * 1999-10-21 2002-08-20 Advanced Micro Devices, Inc. Dynamic weighted round robin queuing
EP1111858A2 (en) * 1999-12-22 2001-06-27 Alcatel USA Sourcing, L.P. A weighted round robin scheduling engine
WO2002009358A2 (en) * 2000-07-26 2002-01-31 Santera Systems, Inc. Method of active dynamic resource assignment in a telecommunications network
CN101026558A (en) * 2007-01-18 2007-08-29 华为技术有限公司 Method and device for realizing mass port backpressure
US20110149977A1 (en) * 2009-12-17 2011-06-23 Juniper Networks, Inc. Avoiding unfair advantage in weighted round robin (wrr) scheduling
CN101964758A (en) * 2010-11-05 2011-02-02 南京邮电大学 Differentiated service-based queue scheduling method
CN102231697A (en) * 2011-06-17 2011-11-02 瑞斯康达科技发展股份有限公司 Bandwidth dispatching method of message queues as well as message reporting method and device
CN103873383A (en) * 2012-12-12 2014-06-18 中国移动通信集团上海有限公司 Queue scheduling method and device
CN103888379A (en) * 2013-12-03 2014-06-25 江苏达科信息科技有限公司 Improved queue scheduling algorithm based on trusted scheduling

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
CHRISTOFOROS KACHRIS 等: "A Dynamically Reconfigurable Queue Scheduler", 《IEEE》 *
SOKO DIVANOVIC 等: "Dynamic Weighted Round Robin in Crosspoint Queued Switch", 《IEEE》 *
李静: "基于区分服务的队列调度技术研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106533982A (en) * 2016-11-14 2017-03-22 西安电子科技大学 Dynamic queue scheduling device and method based on bandwidth borrowing
CN106533982B (en) * 2016-11-14 2019-05-21 西安电子科技大学 The dynamic queue's dispatching device and method borrowed based on bandwidth
CN107185222A (en) * 2017-05-27 2017-09-22 竞技世界(北京)网络技术有限公司 Cards game head is the determination method and device of power
CN107185222B (en) * 2017-05-27 2018-04-24 竞技世界(北京)网络技术有限公司 Cards game head is the definite method and device of power

Also Published As

Publication number Publication date
CN104869079B (en) 2018-03-20

Similar Documents

Publication Publication Date Title
US6914881B1 (en) Prioritized continuous-deficit round robin scheduling
US5333269A (en) Mechanism for transferring messages between source and destination users through a shared memory
US8391139B2 (en) Dynamic load balancing using quality/loading bands
US20140369360A1 (en) Systems and methods for managing traffic in a network using dynamic scheduling priorities
US7295557B2 (en) System and method for scheduling message transmission and processing in a digital data network
KR101190413B1 (en) Enhancement of end-to-end network qos
US20050047425A1 (en) Hierarchical scheduling for communications systems
JP4762996B2 (en) Method and apparatus for ordering packets for routing in a network with indirect determination of packets to be treated with priority
US7324452B2 (en) Weighted credit-based arbitration using credit history
JP4636583B2 (en) Method and apparatus for dynamically scheduling class-based packets
US6721796B1 (en) Hierarchical dynamic buffer management system and method
US20030016686A1 (en) Traffic manager for network switch port
CN1981484B (en) Hierarchal scheduler with multiple scheduling lanes and scheduling method
JP4356261B2 (en) Priority setting method and apparatus
US7619970B2 (en) Method, device and system of scheduling data transport over a fabric
US20070268903A1 (en) System and Method for Assigning Packets to Output Queues
EP1129532A1 (en) Event based rate policing with a jumping window
US8977774B2 (en) Method for reducing buffer capacity in a pipeline processor
AU3867999A (en) System and method for regulating message flow in a digital data network
US8656071B1 (en) System and method for routing a data message through a message network
US7286550B2 (en) Single cycle weighted random early detection circuit and method
CN104539440B (en) Traffic management with in-let dimple
US8014288B1 (en) Packet latency based arbitration technique for a packet switch
US20040163084A1 (en) Method and apparatus for allocating link bandwidth
US7986706B2 (en) Hierarchical pipelined distributed scheduling traffic manager

Legal Events

Date Code Title Description
C06 Publication
EXSB Decision made by sipo to initiate substantive examination
TA01 Transfer of patent application right
TA01 Transfer of patent application right
GR01 Patent grant