US20080013452A1 - Weighted fair queue having adjustable scaling factor - Google Patents
Weighted fair queue having adjustable scaling factor Download PDFInfo
- Publication number
- US20080013452A1 US20080013452A1 US11/862,060 US86206007A US2008013452A1 US 20080013452 A1 US20080013452 A1 US 20080013452A1 US 86206007 A US86206007 A US 86206007A US 2008013452 A1 US2008013452 A1 US 2008013452A1
- Authority
- US
- United States
- Prior art keywords
- distance
- scheduling queue
- range
- scheduler
- flow
- 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.)
- Abandoned
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/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/36—Flow control; Congestion control by determining packet size, e.g. maximum transfer unit [MTU]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/622—Queue service order
- H04L47/623—Weighted service order
Definitions
- the present invention is concerned with data and storage communication systems and is more particularly concerned with a scheduler component of a network processor.
- Data and storage communication networks are in widespread use.
- data packet switching is employed to route data packets or frames from point to point between source and destination, and network processors are employed to handle transmission of data into and out of data switches.
- FIG. 1 is a block diagram illustration of a conventional network processor in which the present invention may be applied.
- the network processor which is generally indicated by reference numeral 10 , may be constituted by a number of components mounted on a card or “blade”. Within a data communication network, a considerable number of blades containing network processors may be interposed between a data switch and a data network.
- the network processor 10 includes data flow chips 12 and 14 .
- the first data flow chip 12 is connected to a data switch 15 (shown in phantom) via first switch ports 16 , and is connected to a data network 17 (shown in phantom) via first network ports 18 .
- the first data flow chip 12 is positioned on the ingress side of the switch 15 and handles data frames that are inbound to the switch 15 .
- the second data flow chip 14 is connected to the switch 15 via second switch ports 20 and is connected to the data network 17 via second network ports 22 .
- the second data flow chip 14 is positioned on the egress side of the switch 15 and handles data frames that are outbound from the switch 15 .
- a first data buffer 24 is coupled to the first data flow chip 12 .
- the first data buffer 24 stores inbound data frames pending transmission of the inbound data frames to the switch 15 .
- a second data buffer 26 is coupled to the second data flow chip 14 , and stores outbound data frames pending transmission of the outbound data frames to the data network 17 .
- the network processor 10 also includes a first processor chip 28 coupled to the first data flow chip 12 .
- the first processor chip 28 supervises operation of the first data flow chip 12 and may include multiple processors.
- a second processor chip 30 is coupled to the second data flow chip 14 , supervises operation of the second data flow chip 14 and may include multiple processors.
- a control signal path 32 couples an output terminal of second data flow chip 14 to an input terminal of first data flow chip 12 (e.g., to allow transmission of data frames therebetween).
- the network processor 10 further includes a first scheduler chip 34 coupled to the first data flow chip 12 .
- the first scheduler chip 34 manages the sequence in which inbound data frames are transmitted to the switch 15 via first switch ports 16 .
- a first memory 36 such as a fast SRAM is coupled to the first scheduler chip 34 (e.g., for storing data frame pointers and flow control information as described further below).
- the first memory 36 may be, for example, a QDR (quad data rate) SRAM.
- a second scheduler chip 38 is coupled to the second data flow chip 14 .
- the second scheduler chip 38 manages the sequence in which data frames are output from the second network ports 22 of the second data flow chip 14 .
- Coupled to the second scheduler chip 38 are at least one and possibly two memories (e.g., fast SRAMs 40 ) for storing data frame pointers and flow control information.
- the memories 40 may, like the first memory 36 , be QDRs.
- the additional memory 40 on the egress side of the network processor 10 may be needed because of a larger number of flows output through the second network ports 22 than through the first switch ports 16 .
- FIG. 2 schematically illustrates conventional queuing arrangements that may be provided for a data flow chip/scheduler pair (either the first data flow chip 12 and the first scheduler chip 34 or the second data flow chip 14 and the second scheduler chip 38 ) of the network processor 10 of FIG. 1 .
- the first data flow chip 12 and the first scheduler chip 34 are illustrated, but a very similar queuing arrangement may be provided in connection with the second data flow chip 14 and the second scheduler chip 38 .
- incoming data frames (from data network 17 ) are buffered in the input data buffer 24 associated with the first data flow chip 12 ( FIG. 1 ).
- Each data frame is associated with a data flow or “flow”.
- a “flow” represents a one-way connection between a source and a destination.
- the scheduling queue 42 defines a sequence in which the flows enqueued therein are to be serviced.
- the particular scheduling queue 42 of interest in connection with the present invention is a weighted fair queue which arbitrates among flows entitled to a “best effort” or “available bandwidth” Quality of Service (QoS).
- QoS Quality of Service
- the scheduling queue 42 is associated with a respective output port 44 of the first data flow chip 12 .
- the output port 44 is one of the first switch ports 16 illustrated in FIG. 1 .
- the data flow chip/scheduler pair under discussion were the egress side data flow chip 14 and scheduler chip 38 , then the output port 44 would be one of the network ports 22 .
- the scheduling queue 42 and one corresponding output port 44 are shown, it should be understood that in fact there may be plural output ports and corresponding scheduling queues each assigned to a respective port.
- a group of output ports may be associated with each scheduling queue 42 . This co-pending patent application is incorporated herein by reference.
- the first scheduler chip 34 also includes flow scheduling calendars which define output schedules for flows which are entitled to a scheduled QoS with guaranteed bandwidth, thus enjoying higher priority than the flows governed by the scheduling queue 42 .
- the memory 36 associated with the first scheduler chip 34 holds pointers (“frame pointers”) to locations in the first data buffer 24 corresponding to data frames associated with the flows enqueued in the scheduling queue 42 .
- the memory 36 also stores flow control information, such as information indicative of the QoS to which flows are entitled.
- the scheduling queue 42 When the scheduling queue 42 indicates that a particular flow enqueued therein is the next to be serviced, reference is made to the frame pointer in the memory 36 corresponding to the first pending data frame for the flow in question and the corresponding frame data is transferred from the first data buffer 24 to an output queue 46 associated with the output port 44 .
- FIG. 3 A more detailed representation of the scheduling queue 42 is shown in FIG. 3 .
- the scheduling queue 42 is used for weighted fair queuing of flows serviced on a “best effort” basis.
- the scheduling queue 42 has 512 slots (each slot represented by reference numeral 48 ). Other numbers of slots may be employed.
- flows are enqueued or attached to the scheduling queue 42 based on a formula that takes into account both a length of a data frame associated with a flow to be enqueued and a weight which corresponds to a QoS to which the flow is entitled.
- the queue slot in which a flow is placed upon enqueuing is calculated according to the formula CP+((WF ⁇ FS)/SF), where CP is a pointer (“current pointer”) that indicates a current position (the slot currently being serviced) in the scheduling queue 42 ; WF is a weighting factor associated with the flow to be enqueued, the weighting factor having been determined on the basis of the QoS to which the flow is entitled; FS is the size of the current frame associated with the flow to be enqueued; and SF is a scaling factor chosen to scale the product (WF ⁇ FS) so that the resulting quotient falls within the range defined by the scheduling queue 42 .
- the weighting factors assigned to the various flows in accordance with the QoS assigned to each flow govern how close to the current pointer of the queue each flow is enqueued.
- flows which exhibit larger frame sizes are enqueued farther from the current pointer of the queue, to prevent such flows from appropriating an undue proportion of the available bandwidth of the queue.
- the “Flow ID” data that identifies a flow (the “Flow ID”) is stored in the appropriate queue slot 48 .
- the scaling factor SF may be chosen to be a value that is too large or too small.
- the enqueuement distance D (WF ⁇ FS)/SF) may overrun the range R of the scheduling queue 42 . If this occurs, an error condition may result, or the enqueuement distance D may be reduced to equal the range R of the scheduling queue 42 , resulting in a failure to properly perform the desired weighted fair queuing.
- the scaling factor SF is chosen to be too large, then all of the flows to be enqueued may be attached relatively close to the current pointer of the scheduling queue 42 . As a result, the full resources of the range of the scheduling queue 42 may not be used, again possibly resulting in a failure to precisely perform the desired weighted fair queuing.
- a scheduler for a network processor includes a scheduling queue in which weighted fair queuing is applied.
- the scheduling queue has a range R.
- Flows are attached to the scheduling queue at a distance D from a current pointer for the scheduling queue.
- the scaling factor SF is adjusted depending on a result of comparing the distance D to the range R.
- the scaling factor SF may be increased if D is greater than R.
- the scaling factor SF may be increased if D exceeds R in regard to a predetermined number of calculations of D.
- the scaling factor SF may be decreased if D is less than R/2.
- the scaling factor SF may be decreased if D is less than one-half R in regard to a predetermined number of calculations of D.
- the scaling factor SF may equal 2 n , where n is a positive integer.
- n may be incremented to increase SF, or may be decremented to decrease SF.
- a method of managing a scheduling queue in a scheduler for a network processor is provided.
- the scheduling queue has a range R.
- the method includes calculating the distance D with respect to a particular flow to be enqueued, comparing the distance D to the range R, and adjusting the scaling factor SF based on a result of the comparing step.
- an initial value at which the scaling factor SF is set may be adjusted adaptively during operation of the scheduler to reflect actual experience with data handled by the scheduler, so that the scaling factor SF assumes a value that is suitable for using the range R of the scheduling queue and/or such that the enqueuement distance D does not overrun the range R of the scheduling queue.
- FIG. 1 is a block diagram of a conventional network processor in which the present invention may be applied;
- FIG. 2 is a block diagram representation of conventional queuing arrangements provided in a data flow chip/scheduler pair included in the network processor of FIG. 1 ;
- FIG. 3 is a pictorial representation of a weighted fair queuing scheduling queue provided in accordance with conventional practices
- FIG. 4 is a flow chart that illustrates a process provided in accordance with the invention to increase the value of a scaling factor when a range of a scheduling queue is overrun;
- FIG. 5 is a flow chart that illustrates a process provided in accordance with the invention to decrease the value of a scaling factor when a range of a scheduling queue is underutilized;
- FIGS. 6A and 6B together form a flow chart that illustrates a process provided in accordance with the invention to increase and/or decrease a scaling factor in response to overrunning or underutilizing a range of a scheduling queue;
- FIG. 7A is a block diagram of an inventive scheduler for use with the processes of FIGS. 4 and 5 ;
- FIG. 7B is a block diagram of an inventive scheduler for use with the processes of FIGS. 6A and 6B .
- Adjustment of a scaling factor SF of a scheduler in accordance with the invention will now be described, initially with reference to FIG. 4 and the conventional network processor 10 of FIGS. 1-3 . It will be understood that the present invention may be employed with any suitable conventional network processor.
- FIG. 4 is a flow chart that illustrates a process provided in accordance with the invention for increasing the value of a scaling factor SF in response to overrunning the range R of the scheduling queue 42 ( FIG. 2 ).
- the schedulers 34 and/or 38 may be provided with a counter C 0 as shown in FIG. 7A .
- the counter C 0 may comprise any conventional counter, whether hardware or software based.
- Enqueuement can occur in one of two ways. The first way is a “new attach” situation, in which, for a flow having no frames corresponding to it, a new frame arrives, and the flow is attached to the scheduling queue 42 in response to arrival of the new frame.
- the second way is a “reattach” situation, in which a flow is already enqueued in the scheduling queue 42 and is picked as a winner (because it is closest to the head of the queue and no higher priority service intervenes), a frame is dispatched with respect to the flow, and the flow is rescheduled on the scheduling queue 42 because there is at least one more frame to be dispatched from the flow.
- decision block 52 it is determined whether the enqueuement distance D exceeded (overran) the range R of the scheduling queue 42 . If not, the procedure of FIG. 4 simply returns (block 54 ) so that the scheduling queue 42 may perform conventional queue operations (not described).
- block 56 follows decision block 52 .
- a value of the counter C 0 ( FIG. 7A ) is incremented. Any suitable counter may be employed (e.g., a hardware or software based counter).
- the threshold can be determined by software if the software has information concerning the flows/frames to be handled. If so, the scaling factor SF can be set accurately based on the flows/frames that are expected. The software would then set the threshold to handle flows that misbehave. For example, if it is not desired to tolerate an occasional frame that causes the enqueuement distance D to exceed the range R, then the threshold may be set to zero. If system requirements allow some misbehaving flows to be tolerated, then the threshold may be set higher.
- an arbitrary value for the initial value of the scaling factor SF can be chosen, and the threshold can be set so that the scaling factor SF is increased rapidly if the range R of the scheduling queue 42 is exceeded.
- a threshold for decreasing the scaling factor SF may be set so that the scaling factor SF is decreased slowly if the flows are all being scheduled in the lower part of the scheduling queue 42 .
- the value of the scaling factor SF is increased. This may be done in a number of ways. For example, if the scaling factor SF is expressed as an integral power of 2 (i.e., 2 n ), then the scaling factor SF may be doubled by incrementing the value of n (e.g., via a left shifting operation as previously described, such as left shifting a register (not shown) in which the scaling factor is stored). It is contemplated, alternatively, to increase SF by a factor other than two.
- block 62 at which the counter C 0 is reset.
- the procedure of FIG. 4 then returns (block 54 ) so that the scheduling queue 42 may perform conventional queue operations (not described).
- the procedure of FIG. 4 operates so that when the range of the scheduling queue 42 is overrun a certain number of times (e.g., as set by the predetermined threshold), the value of the scaling factor SF is increased, to reduce the likelihood of overrunning the range of the scheduling queue 42 in the future.
- the initial value of the scaling factor SF can be set at a low value, and the scheduler 34 ( FIG. 2 ) can be allowed, in operation, to increase the value of the scaling factor SF to adapt to the actual characteristics of the data traffic, so that, after an initial period, overrunning of the range of the scheduling queue 42 does not occur.
- FIG. 5 is a flow chart that represents a procedure provided in accordance with the invention for decreasing the value of the scaling factor SF of the scheduler 34 of FIG. 2 in response to underutilization of the range of the scheduling queue 42 .
- the procedure of FIG. 5 may be employed with other schedulers and/or scheduling queues, and employs the counter C 0 ( FIG. 7A ).
- block 70 which is like block 50 of FIG. 4 (e.g., a flow is attached to the scheduling queue 42 using the current value of the scaling factor SF during calculation of the enqueuement distance D).
- decision block 72 it is determined whether the enqueuement distance D calculated in block 70 is less than one-half the range R of the scheduling queue 42 . If the enqueuement distance D is found to be less than one-half the range R of the scheduling queue 42 , then block 74 follows decision block 72 . (If the scaling factor SF is decreased by a factor other than two, then the enqueuement distance D is advantageously to be compared to something other than one-half of the range R. For example, if the scaling factor SF is to be decreased by a factor of 4, then the enqueuement distance D may be compared to one-fourth of the range R.)
- a value of the counter C 0 is incremented. Following block 74 is decision block 76 at which it is determined whether the incremented counter value is greater than a predetermined threshold. If not, the procedure of FIG. 5 returns (block 78 ). However, if it is found at decision block 76 that the incremented counter value exceeds the predetermined threshold, then block 80 follows decision block 76 .
- the value of the scaling factor SF is decreased.
- the decreasing of the value of the scaling factor SF may occur in a number of ways. For example, if the scaling factor SF is expressed as a power of 2 (i.e., 2 n ) then the scaling factor SF may be halved by decrementing n (e.g., by right shifting a register (not shown) in which the scaling factor is stored). It is contemplated, alternatively, to decrease the scaling factor SF by a factor other than two.
- block 82 at which the counter C 0 is reset.
- the procedure of FIG. 5 then returns (block 78 ).
- block 84 follows decision block 72 .
- the counter C 0 is reset, and the procedure of FIG. 5 then returns (block 78 ).
- the counter C 0 is reset because, if the upper part of the scheduling queue 42 is ever used, then the scaling factor SF will not be too large.
- the value of the scaling factor SF can be set to a high value, in anticipation of a wide range of enqueuement distances that may be encountered during processing of data frames.
- the procedure of FIG. 5 will adaptively decrease the value of the scaling factor to a value that is well suited to the actual characteristics of the data that is being processed.
- FIGS. 6A and 6B together form a flow chart that illustrates a procedure provided in accordance with the invention and by which the value of the scaling factor SF of the scheduler 42 of FIG. 2 can be either increased or decreased to adapt to characteristics of the data handled by the network processor 10 .
- the schedulers 34 and/or 38 may be provided with a first counter C 1 and a second counter C 2 as shown in FIG. 7B .
- the counters C 1 and C 2 may comprise any conventional counters, whether hardware or software based.
- a block 90 which entails the same activity as block 50 of FIG. 4 (e.g., a flow is attached to the scheduling queue 42 using the current value of the scaling factor SF during calculation of the enqueuement distance D).
- a decision block 92 at which it is determined whether the enqueuement distance D is greater than the range R of the scheduling queue 42 . If it is determined at decision block 92 that the enqueuement distance D exceeded the range R of the scheduling queue 42 , then a value of the first counter C 1 ( FIG. 7B ) is incremented (block 94 ). Following block 94 is a decision block 96 .
- the procedure returns (block 98 ). However, if it is determined at decision block 96 that the value of the first counter C 1 exceeds the first threshold, then the value of the scaling factor SF is increased (block 100 ). This may be done, for example, by incrementing the value of n, where SF is expressed as 2 n , or by any other technique.
- block 102 Following block 100 is block 102 .
- the first counter C 1 is reset.
- the second counter C 2 ( FIG. 7B ) also is reset. (As will be seen, the second counter C 2 is involved with determining whether to decrease the value of the scaling factor SF in response to underutilization of the range R of the scheduling queue 42 .)
- the procedure of FIGS. 6A and 6B returns (block 98 ).
- decision block 104 ( FIG. 6B ) follows decision block 92 .
- decision block 104 it is determined whether the enqueuement distance D is less than one-half of the range R of the scheduling queue 42 . If the enqueuement distance D is less than one-half the range R, then block 106 follows decision block 104 .
- the value of the second counter C 2 is incremented. Following block 106 is decision block 108 , at which it is determined whether the value of the second counter C 2 is greater than a second threshold. If not, the procedure returns (block 98 ). However, if it is determined at decision block 108 that the value of the second counter C 2 is greater than the second threshold, then block 110 follows decision block 108 . At decision block 110 the value of the scaling factor SF is decreased. This may be done, for example, by decrementing n where SF is expressed as 2 n , or by any other technique.
- block 112 Following block 110 is block 112 .
- the first and second counters C 1 , C 2 are reset. The procedure then returns (block 98 ).
- block 114 follows decision block 104 .
- the second counter C 2 is reset. The procedure of FIGS. 6A and 6B then returns (block 98 ).
- the scaling factor SF may initially be set at 2 7 (i.e., 128 ).
- the first threshold may be set to be 0 (i.e., the scaling factor SF is increased each time the range R is overrun), and the second threshold may be set to be 8 (i.e. 9 consecutive enqueuements in the lower half of the scheduling queue 42 result in decreasing the scaling factor SF).
- the scaling factor SF may be set at an intermediate value or an arbitrary value, and the scheduler 34 (when configured in accordance with the present invention) then operates to adapt the scaling factor SF, by either increasing or decreasing the value of the scaling factor SF, as required in response to characteristics of the data being processed.
- This aspect of the invention also makes it unnecessary to attempt to predict the characteristics of the data to be processed upon initially setting the value of the scaling factor.
- a scheduler configured in accordance with the present invention can also adapt to changes in a stream of data by increasing or decreasing the scaling factor SF as the situation requires.
- the scheduler may, for example, increase the scaling factor SF during an initial period of operation, then may decrease the scaling factor SF in response to a change in the pattern of data traffic, and further may increase the scaling factor SF again in response to another change in the pattern of data traffic.
- respective scheduling queues e.g., 64
- respective scaling factors SF of the scheduling queues are advantageously to be adjusted independently of one another. Consequently, in a typical situation in accordance with the invention, different values of scaling factors are applicable to different scheduling queues at any given time.
- the processes of FIG. 4-6B may be implemented in hardware, software or a combination thereof.
- the processes of FIGS. 4-6B are implemented in hardware employing a suitable combination of conventional logic circuitry such as adders, comparators, selectors, etc.
- Such hardware may be located, for example, within the scheduler 34 and/or the scheduler 38 ( FIG. 2 ).
- a person of ordinary skill in the art may develop logic circuitry capable of performing the inventive processes described with reference to FIGS. 4-6B .
- the processes of FIGS. 4-6B may comprise one or more computer program products. Each inventive computer program product may be carried by a medium readable by a computer (e.g., a carrier wave signal, a floppy disk, a hard drive, a random access memory, etc.).
- a scheduling queue may have plural subqueues of different ranges and resolutions, according to an invention disclosed in co-pending patent application Ser. No. 10/016,518, filed Nov. 1, 2001 (Attorney Docket No. ROC920010199US1). This co-pending patent application is incorporated herein by reference.
- the invention has been implemented in a separate scheduler chip associated with a network processor. However, it is also contemplated to implement the invention in a scheduler circuit that is implemented as part of a data flow chip or as part of a processor chip.
- reduction of the scaling factor SF has been triggered by underutilization of the range of the scheduling queue, where underutilization has been effectively defined as attaching flows repeatedly in the lower half of the scheduling queue. It is alternatively contemplated, however, to define underutilization of the range of the scheduling queue in other ways. For example, underutilization may be deemed to have occurred upon repeated attachment of flows in the lower third or lower quarter of the scheduling queue.
Abstract
A scheduler for a network processor includes a scheduling queue in which weighted fair queuing is applied. The scheduling queue has a range R. Flows are attached to the scheduling queue at a distance D from a current pointer for the scheduling queue. The distance D is calculated for each flow according to the formula D=((WF×FS)/SF), where WF is a weighting factor applicable to a respective flow; FS is a frame size attributable to the respective flow; and SF is a scaling factor. The scaling factor SF is adjusted depending on a comparison of the distance D to the range R.
Description
- The present application is a continuation of and claims priority to U.S. patent application Ser. No. 10/015,760, filed Nov. 1, 2001, titled “WEIGHTED FAIR QUEUE HAVING ADJUSTABLE SCALING FACTOR,” which is hereby incorporated by reference herein in its entirety.
- The present application is related to the following U.S. patent applications, each of which is hereby incorporated by reference herein in its entirety:
- U.S. patent application Ser. No. 10/016,518, filed Nov. 1, 2001, titled “WEIGHTED FAIR QUEUE HAVING EXTENDED EFFECTIVE RANGE” (IBM Docket No. ROC920010199US1);
- U.S. patent application Ser. No. 10/015,994, filed Nov. 1, 2001, titled “WEIGHTED FAIR QUEUE SERVING PLURAL OUTPUT PORTS” (IBM Docket No. ROC920010200US1);
- U.S. patent application Ser. No. 10/002,085, filed Nov. 1, 2001, titled “EMPTY INDICATORS FOR WEIGHTED FAIR QUEUES” (IBM Docket No. ROC920010202US1);
- U.S. patent application Ser. No. 10/004,373, filed Nov. 1, 2001, titled “QoS SCHEDULER AND METHOD FOR IMPLEMENTING PEAK SERVICE DISTANCE USING NEXT PEAK SERVICE TIME VIOLATED INDICATION” now U.S. Pat. No. 6,973,036 issued Dec. 6, 2005 (IBM Docket No. ROC920010203US1);
- U.S. patent application Ser. No. 10/002,416, filed Nov. 1, 2001, titled “QoS SCHEDULER AND METHOD FOR IMPLEMENTING QUALITY OF SERVICE WITH AGING STAMPS” now U.S. Pat. No. 7,103,051 issued on Sep. 5, 2006 (IBM Docket No. ROC920010204US1);
- U.S. patent application Ser. No. 10/004,440, filed Nov. 1, 2001, titled “QoS SCHEDULER AND METHOD FOR IMPLEMENTING QUALITY OF SERVICE WITH CACHED STATUS ARRAY” now U.S. Pat. No. 7,046,676 issued on May 16, 2006 (IBM Docket No. ROC920010205US1); and
- U.S. patent application Ser. No. 10/004,217, filed Nov. 1, 2001, titled “QoS SCHEDULER AND METHOD FOR IMPLEMENTING QUALITY OF SERVICE ANTICIPATING THE END OF A CHAIN OF FLOWS” now U.S. Pat. No. 6,982,986 issued on Jan. 3, 2006 (IBM Docket No. ROC920010206US1).
- The present invention is concerned with data and storage communication systems and is more particularly concerned with a scheduler component of a network processor.
- Data and storage communication networks are in widespread use. In many data and storage communication networks, data packet switching is employed to route data packets or frames from point to point between source and destination, and network processors are employed to handle transmission of data into and out of data switches.
-
FIG. 1 is a block diagram illustration of a conventional network processor in which the present invention may be applied. The network processor, which is generally indicated byreference numeral 10, may be constituted by a number of components mounted on a card or “blade”. Within a data communication network, a considerable number of blades containing network processors may be interposed between a data switch and a data network. - The
network processor 10 includesdata flow chips data flow chip 12 is connected to a data switch 15 (shown in phantom) viafirst switch ports 16, and is connected to a data network 17 (shown in phantom) viafirst network ports 18. The firstdata flow chip 12 is positioned on the ingress side of theswitch 15 and handles data frames that are inbound to theswitch 15. - The second
data flow chip 14 is connected to theswitch 15 viasecond switch ports 20 and is connected to thedata network 17 viasecond network ports 22. The seconddata flow chip 14 is positioned on the egress side of theswitch 15 and handles data frames that are outbound from theswitch 15. - As shown in
FIG. 1 , afirst data buffer 24 is coupled to the firstdata flow chip 12. Thefirst data buffer 24 stores inbound data frames pending transmission of the inbound data frames to theswitch 15. Asecond data buffer 26 is coupled to the seconddata flow chip 14, and stores outbound data frames pending transmission of the outbound data frames to thedata network 17. - The
network processor 10 also includes afirst processor chip 28 coupled to the firstdata flow chip 12. Thefirst processor chip 28 supervises operation of the firstdata flow chip 12 and may include multiple processors. Asecond processor chip 30 is coupled to the seconddata flow chip 14, supervises operation of the seconddata flow chip 14 and may include multiple processors. - A
control signal path 32 couples an output terminal of seconddata flow chip 14 to an input terminal of first data flow chip 12 (e.g., to allow transmission of data frames therebetween). - The
network processor 10 further includes afirst scheduler chip 34 coupled to the firstdata flow chip 12. Thefirst scheduler chip 34 manages the sequence in which inbound data frames are transmitted to theswitch 15 viafirst switch ports 16. Afirst memory 36 such as a fast SRAM is coupled to the first scheduler chip 34 (e.g., for storing data frame pointers and flow control information as described further below). Thefirst memory 36 may be, for example, a QDR (quad data rate) SRAM. - A
second scheduler chip 38 is coupled to the seconddata flow chip 14. Thesecond scheduler chip 38 manages the sequence in which data frames are output from thesecond network ports 22 of the seconddata flow chip 14. Coupled to thesecond scheduler chip 38 are at least one and possibly two memories (e.g., fast SRAMs 40) for storing data frame pointers and flow control information. Thememories 40 may, like thefirst memory 36, be QDRs. Theadditional memory 40 on the egress side of thenetwork processor 10 may be needed because of a larger number of flows output through thesecond network ports 22 than through thefirst switch ports 16. -
FIG. 2 schematically illustrates conventional queuing arrangements that may be provided for a data flow chip/scheduler pair (either the firstdata flow chip 12 and thefirst scheduler chip 34 or the seconddata flow chip 14 and the second scheduler chip 38) of thenetwork processor 10 ofFIG. 1 . In the particular example illustrated in FIG. 2, the firstdata flow chip 12 and thefirst scheduler chip 34 are illustrated, but a very similar queuing arrangement may be provided in connection with the seconddata flow chip 14 and thesecond scheduler chip 38. In the queuing arrangement for the firstdata flow chip 12 and thefirst scheduler chip 34, incoming data frames (from data network 17) are buffered in theinput data buffer 24 associated with the first data flow chip 12 (FIG. 1 ). Each data frame is associated with a data flow or “flow”. As is familiar to those who are skilled in the art, a “flow” represents a one-way connection between a source and a destination. - Flows with which the incoming data frames are associated are enqueued in a
scheduling queue 42 maintained in thefirst scheduler chip 34. Thescheduling queue 42 defines a sequence in which the flows enqueued therein are to be serviced. Theparticular scheduling queue 42 of interest in connection with the present invention is a weighted fair queue which arbitrates among flows entitled to a “best effort” or “available bandwidth” Quality of Service (QoS). - As shown in
FIG. 2 , thescheduling queue 42 is associated with arespective output port 44 of the firstdata flow chip 12. It is to be understood that theoutput port 44 is one of thefirst switch ports 16 illustrated inFIG. 1 . (However, if the data flow chip/scheduler pair under discussion were the egress sidedata flow chip 14 andscheduler chip 38, then theoutput port 44 would be one of thenetwork ports 22.) Although only onescheduling queue 42 and onecorresponding output port 44 are shown, it should be understood that in fact there may be plural output ports and corresponding scheduling queues each assigned to a respective port. (However, according to an alternative embodiment, disclosed in co-pending patent application Ser. No. 10/015,994, filed Nov. 1, 2001 (Attorney Docket No. ROC920010200US1), a group of output ports may be associated with eachscheduling queue 42. This co-pending patent application is incorporated herein by reference.) - Although not indicated in
FIG. 2 , thefirst scheduler chip 34 also includes flow scheduling calendars which define output schedules for flows which are entitled to a scheduled QoS with guaranteed bandwidth, thus enjoying higher priority than the flows governed by thescheduling queue 42. - The
memory 36 associated with thefirst scheduler chip 34 holds pointers (“frame pointers”) to locations in thefirst data buffer 24 corresponding to data frames associated with the flows enqueued in thescheduling queue 42. Thememory 36 also stores flow control information, such as information indicative of the QoS to which flows are entitled. - When the
scheduling queue 42 indicates that a particular flow enqueued therein is the next to be serviced, reference is made to the frame pointer in thememory 36 corresponding to the first pending data frame for the flow in question and the corresponding frame data is transferred from thefirst data buffer 24 to anoutput queue 46 associated with theoutput port 44. - A more detailed representation of the
scheduling queue 42 is shown inFIG. 3 . As noted above, thescheduling queue 42 is used for weighted fair queuing of flows serviced on a “best effort” basis. In a particular example of a scheduling queue as illustrated inFIG. 3 , thescheduling queue 42 has 512 slots (each slot represented by reference numeral 48). Other numbers of slots may be employed. In accordance with conventional practice, flows are enqueued or attached to thescheduling queue 42 based on a formula that takes into account both a length of a data frame associated with a flow to be enqueued and a weight which corresponds to a QoS to which the flow is entitled. - More specifically, the queue slot in which a flow is placed upon enqueuing is calculated according to the formula CP+((WF×FS)/SF), where CP is a pointer (“current pointer”) that indicates a current position (the slot currently being serviced) in the
scheduling queue 42; WF is a weighting factor associated with the flow to be enqueued, the weighting factor having been determined on the basis of the QoS to which the flow is entitled; FS is the size of the current frame associated with the flow to be enqueued; and SF is a scaling factor chosen to scale the product (WF×FS) so that the resulting quotient falls within the range defined by thescheduling queue 42. (In accordance with conventional practice, the scaling factor SF is conveniently defined as a integral power of 2—i.e., SF=2n, with n being a positive integer—so that scaling the product (WF×FS) is performed by right shifting.) With this known weighted fair queuing technique, the weighting factors assigned to the various flows in accordance with the QoS assigned to each flow govern how close to the current pointer of the queue each flow is enqueued. In addition, flows which exhibit larger frame sizes are enqueued farther from the current pointer of the queue, to prevent such flows from appropriating an undue proportion of the available bandwidth of the queue. Upon enqueuement, data that identifies a flow (the “Flow ID”) is stored in theappropriate queue slot 48. - In some applications, there may be a wide range of data frame sizes associated with the flows, perhaps on the order of about 64 bytes to 64 KB, or three orders of magnitude. It may also be desirable to assign a large range of weighting factors to the flows so that bandwidth can be sold with a great deal of flexibility and precision. In practice, however, it is difficult to predict at the time of designing or initializing the
scheduler chip 34 what will be the characteristics of the data packets handled by thescheduler chip 34. Consequently, it is difficult to anticipate over what range of values the product (WF×FS) will fall during operation of thenetwork processor 10. As a result, the scaling factor SF may be chosen to be a value that is too large or too small. If the value of SF is chosen to be too small, then the enqueuement distance D=(WF×FS)/SF) may overrun the range R of thescheduling queue 42. If this occurs, an error condition may result, or the enqueuement distance D may be reduced to equal the range R of thescheduling queue 42, resulting in a failure to properly perform the desired weighted fair queuing. - If the scaling factor SF is chosen to be too large, then all of the flows to be enqueued may be attached relatively close to the current pointer of the
scheduling queue 42. As a result, the full resources of the range of thescheduling queue 42 may not be used, again possibly resulting in a failure to precisely perform the desired weighted fair queuing. - It would accordingly be desirable to overcome the potential drawbacks of setting the scaling factor SF either too low or too high.
- According to an aspect of the invention, a scheduler for a network processor is provided. The scheduler includes a scheduling queue in which weighted fair queuing is applied. The scheduling queue has a range R. Flows are attached to the scheduling queue at a distance D from a current pointer for the scheduling queue. The distance D is calculated for each flow according to the formula D=((WF×FS)/SF), where WF is a weighting factor applicable to a respective flow; FS is a frame size attributable to the respective flow; and SF is a scaling factor. The scaling factor SF is adjusted depending on a result of comparing the distance D to the range R.
- In at least one embodiment, the scaling factor SF may be increased if D is greater than R. For example, the scaling factor SF may be increased if D exceeds R in regard to a predetermined number of calculations of D.
- In one or more embodiments, the scaling factor SF may be decreased if D is less than R/2. For example, the scaling factor SF may be decreased if D is less than one-half R in regard to a predetermined number of calculations of D.
- In some embodiments, the scaling factor SF may equal 2n, where n is a positive integer. For example, n may be incremented to increase SF, or may be decremented to decrease SF.
- According to another aspect of the invention, a method of managing a scheduling queue in a scheduler for a network processor is provided. The scheduling queue has a range R. Flows are attached to the scheduling queue at a distance D from a current pointer for the scheduling queue, the distance D being calculated for each flow according to the formula D=((WF×FS)/SF), where WF is a weighting factor applicable to a respective flow, FS is a frame size attributable to the respective flow, and SF is a scaling factor. The method includes calculating the distance D with respect to a particular flow to be enqueued, comparing the distance D to the range R, and adjusting the scaling factor SF based on a result of the comparing step.
- In a scheduler provided in accordance with the invention, an initial value at which the scaling factor SF is set may be adjusted adaptively during operation of the scheduler to reflect actual experience with data handled by the scheduler, so that the scaling factor SF assumes a value that is suitable for using the range R of the scheduling queue and/or such that the enqueuement distance D does not overrun the range R of the scheduling queue.
- Other objects, features and advantages of the present invention will become more fully apparent from the following detailed description of exemplary embodiments, the appended claims and the accompanying drawings.
-
FIG. 1 is a block diagram of a conventional network processor in which the present invention may be applied; -
FIG. 2 is a block diagram representation of conventional queuing arrangements provided in a data flow chip/scheduler pair included in the network processor ofFIG. 1 ; -
FIG. 3 is a pictorial representation of a weighted fair queuing scheduling queue provided in accordance with conventional practices; -
FIG. 4 is a flow chart that illustrates a process provided in accordance with the invention to increase the value of a scaling factor when a range of a scheduling queue is overrun; -
FIG. 5 is a flow chart that illustrates a process provided in accordance with the invention to decrease the value of a scaling factor when a range of a scheduling queue is underutilized; -
FIGS. 6A and 6B together form a flow chart that illustrates a process provided in accordance with the invention to increase and/or decrease a scaling factor in response to overrunning or underutilizing a range of a scheduling queue; -
FIG. 7A is a block diagram of an inventive scheduler for use with the processes ofFIGS. 4 and 5 ; and -
FIG. 7B is a block diagram of an inventive scheduler for use with the processes ofFIGS. 6A and 6B . - Adjustment of a scaling factor SF of a scheduler in accordance with the invention will now be described, initially with reference to
FIG. 4 and theconventional network processor 10 ofFIGS. 1-3 . It will be understood that the present invention may be employed with any suitable conventional network processor. -
FIG. 4 is a flow chart that illustrates a process provided in accordance with the invention for increasing the value of a scaling factor SF in response to overrunning the range R of the scheduling queue 42 (FIG. 2 ). In the particular example of thescheduling queue 42 described above, the range R of thescheduling queue 42 corresponds to the number ofslots 48, i.e. R=512. Other ranges may be employed. In accordance with the inventive process ofFIG. 4 , and as described further below, theschedulers 34 and/or 38 may be provided with a counter C0 as shown inFIG. 7A . The counter C0 may comprise any conventional counter, whether hardware or software based. - Initially in
FIG. 4 isblock 50, at which a flow is attached to thescheduling queue 42 using the current value of the scaling factor SF. That is, the enqueuement distance D is calculated according to the conventional formula D=((WF×FS)/SF). Enqueuement can occur in one of two ways. The first way is a “new attach” situation, in which, for a flow having no frames corresponding to it, a new frame arrives, and the flow is attached to thescheduling queue 42 in response to arrival of the new frame. The second way is a “reattach” situation, in which a flow is already enqueued in thescheduling queue 42 and is picked as a winner (because it is closest to the head of the queue and no higher priority service intervenes), a frame is dispatched with respect to the flow, and the flow is rescheduled on thescheduling queue 42 because there is at least one more frame to be dispatched from the flow. - Following
block 50 isdecision block 52. Indecision block 52 it is determined whether the enqueuement distance D exceeded (overran) the range R of thescheduling queue 42. If not, the procedure ofFIG. 4 simply returns (block 54) so that thescheduling queue 42 may perform conventional queue operations (not described). - However, if it is determined at
decision block 52 that the enqueuement distance D overran the range R of thescheduling queue 42, then block 56 followsdecision block 52. Atblock 56, a value of the counter C0 (FIG. 7A ) is incremented. Any suitable counter may be employed (e.g., a hardware or software based counter). - Following
block 56 isdecision block 58. Atdecision block 58, it is determined whether the incremented counter value exceeds a predetermined threshold. This threshold (and other thresholds discussed below) can be set in a variety of ways. For example, the threshold can be determined by software if the software has information concerning the flows/frames to be handled. If so, the scaling factor SF can be set accurately based on the flows/frames that are expected. The software would then set the threshold to handle flows that misbehave. For example, if it is not desired to tolerate an occasional frame that causes the enqueuement distance D to exceed the range R, then the threshold may be set to zero. If system requirements allow some misbehaving flows to be tolerated, then the threshold may be set higher. - If the software has no information concerning the flows/frames that to be handled, then an arbitrary value for the initial value of the scaling factor SF can be chosen, and the threshold can be set so that the scaling factor SF is increased rapidly if the range R of the
scheduling queue 42 is exceeded. (A threshold for decreasing the scaling factor SF, to be discussed below, may be set so that the scaling factor SF is decreased slowly if the flows are all being scheduled in the lower part of thescheduling queue 42.) These threshold values would allow the system to quickly adapt to unknown input. - If a positive determination is made at
decision block 58, the procedure returns (block 54). However, if it is determined atdecision block 58 that the predetermined threshold is exceeded by the incremented counter value, then block 60 followsdecision block 58. - At
block 60 the value of the scaling factor SF is increased. This may be done in a number of ways. For example, if the scaling factor SF is expressed as an integral power of 2 (i.e., 2n), then the scaling factor SF may be doubled by incrementing the value of n (e.g., via a left shifting operation as previously described, such as left shifting a register (not shown) in which the scaling factor is stored). It is contemplated, alternatively, to increase SF by a factor other than two. - Following
block 60 isblock 62 at which the counter C0 is reset. The procedure ofFIG. 4 then returns (block 54) so that thescheduling queue 42 may perform conventional queue operations (not described). - It will be appreciated that the procedure of
FIG. 4 operates so that when the range of thescheduling queue 42 is overrun a certain number of times (e.g., as set by the predetermined threshold), the value of the scaling factor SF is increased, to reduce the likelihood of overrunning the range of thescheduling queue 42 in the future. Thus the initial value of the scaling factor SF can be set at a low value, and the scheduler 34 (FIG. 2 ) can be allowed, in operation, to increase the value of the scaling factor SF to adapt to the actual characteristics of the data traffic, so that, after an initial period, overrunning of the range of thescheduling queue 42 does not occur. -
FIG. 5 is a flow chart that represents a procedure provided in accordance with the invention for decreasing the value of the scaling factor SF of thescheduler 34 ofFIG. 2 in response to underutilization of the range of thescheduling queue 42. As with the procedure ofFIG. 4 , the procedure ofFIG. 5 may be employed with other schedulers and/or scheduling queues, and employs the counter C0 (FIG. 7A ). - The procedure of
FIG. 5 begins withblock 70 which is likeblock 50 ofFIG. 4 (e.g., a flow is attached to thescheduling queue 42 using the current value of the scaling factor SF during calculation of the enqueuement distance D). Followingblock 70 is adecision block 72. Atdecision block 72 it is determined whether the enqueuement distance D calculated inblock 70 is less than one-half the range R of thescheduling queue 42. If the enqueuement distance D is found to be less than one-half the range R of thescheduling queue 42, then block 74 followsdecision block 72. (If the scaling factor SF is decreased by a factor other than two, then the enqueuement distance D is advantageously to be compared to something other than one-half of the range R. For example, if the scaling factor SF is to be decreased by a factor of 4, then the enqueuement distance D may be compared to one-fourth of the range R.) - At block 74 a value of the counter C0 is incremented. Following
block 74 isdecision block 76 at which it is determined whether the incremented counter value is greater than a predetermined threshold. If not, the procedure ofFIG. 5 returns (block 78). However, if it is found atdecision block 76 that the incremented counter value exceeds the predetermined threshold, then block 80 followsdecision block 76. - At
block 80 the value of the scaling factor SF is decreased. The decreasing of the value of the scaling factor SF may occur in a number of ways. For example, if the scaling factor SF is expressed as a power of 2 (i.e., 2n) then the scaling factor SF may be halved by decrementing n (e.g., by right shifting a register (not shown) in which the scaling factor is stored). It is contemplated, alternatively, to decrease the scaling factor SF by a factor other than two. - Following
block 80 isblock 82, at which the counter C0 is reset. The procedure ofFIG. 5 then returns (block 78). - Considering again
decision block 72, if it is determined at that decision block that the enqueuement distance D is not less than one-half the range R of thescheduling queue 42, then block 84 followsdecision block 72. Atblock 84 the counter C0 is reset, and the procedure ofFIG. 5 then returns (block 78). The counter C0 is reset because, if the upper part of thescheduling queue 42 is ever used, then the scaling factor SF will not be too large. - With the procedure of
FIG. 5 , the value of the scaling factor SF can be set to a high value, in anticipation of a wide range of enqueuement distances that may be encountered during processing of data frames. In the event that the high value of the scaling factor leads to underutilization of the range of the scheduling queue, the procedure ofFIG. 5 will adaptively decrease the value of the scaling factor to a value that is well suited to the actual characteristics of the data that is being processed. -
FIGS. 6A and 6B together form a flow chart that illustrates a procedure provided in accordance with the invention and by which the value of the scaling factor SF of thescheduler 42 ofFIG. 2 can be either increased or decreased to adapt to characteristics of the data handled by thenetwork processor 10. In accordance with the inventive process ofFIGS. 6A and 6B , and as described further below, theschedulers 34 and/or 38 may be provided with a first counter C1 and a second counter C2 as shown inFIG. 7B . The counters C1 and C2 may comprise any conventional counters, whether hardware or software based. - Initially in the procedure of
FIGS. 6A and 6B is ablock 90, which entails the same activity asblock 50 ofFIG. 4 (e.g., a flow is attached to thescheduling queue 42 using the current value of the scaling factor SF during calculation of the enqueuement distance D). Followingblock 90 is adecision block 92 at which it is determined whether the enqueuement distance D is greater than the range R of thescheduling queue 42. If it is determined atdecision block 92 that the enqueuement distance D exceeded the range R of thescheduling queue 42, then a value of the first counter C1 (FIG. 7B ) is incremented (block 94). Followingblock 94 is adecision block 96. Atdecision block 96 it is determined whether the value of the first counter C1 is greater than a first threshold. If not, then the procedure returns (block 98). However, if it is determined atdecision block 96 that the value of the first counter C1 exceeds the first threshold, then the value of the scaling factor SF is increased (block 100). This may be done, for example, by incrementing the value of n, where SF is expressed as 2n, or by any other technique. - Following
block 100 isblock 102. Atblock 102 the first counter C1 is reset. The second counter C2 (FIG. 7B ) also is reset. (As will be seen, the second counter C2 is involved with determining whether to decrease the value of the scaling factor SF in response to underutilization of the range R of thescheduling queue 42.) Followingblock 102 the procedure ofFIGS. 6A and 6B returns (block 98). - Considering again
decision block 92, if it is determined atdecision block 92 that the enqueuement distance D is not greater than the range R of thescheduling queue 42, then decision block 104 (FIG. 6B ) followsdecision block 92. Atdecision block 104 it is determined whether the enqueuement distance D is less than one-half of the range R of thescheduling queue 42. If the enqueuement distance D is less than one-half the range R, then block 106 followsdecision block 104. - At
block 106, the value of the second counter C2 is incremented. Followingblock 106 isdecision block 108, at which it is determined whether the value of the second counter C2 is greater than a second threshold. If not, the procedure returns (block 98). However, if it is determined atdecision block 108 that the value of the second counter C2 is greater than the second threshold, then block 110 followsdecision block 108. Atdecision block 110 the value of the scaling factor SF is decreased. This may be done, for example, by decrementing n where SF is expressed as 2n, or by any other technique. - Following
block 110 isblock 112. Atblock 112 the first and second counters C1, C2 are reset. The procedure then returns (block 98). - Considering again
decision block 104, if it is determined atdecision block 104 that the enqueuement distance D is not less than one-half the range R of thescheduling queue 42, then block 114 followsdecision block 104. Atblock 114 the second counter C2 is reset. The procedure ofFIGS. 6A and 6B then returns (block 98). - In one embodiment of the procedure of
FIGS. 6A and 6B , the scaling factor SF may initially be set at 27 (i.e., 128). The first threshold may be set to be 0 (i.e., the scaling factor SF is increased each time the range R is overrun), and the second threshold may be set to be 8 (i.e. 9 consecutive enqueuements in the lower half of thescheduling queue 42 result in decreasing the scaling factor SF). - In the procedure of
FIGS. 6A and 6B , the scaling factor SF may be set at an intermediate value or an arbitrary value, and the scheduler 34 (when configured in accordance with the present invention) then operates to adapt the scaling factor SF, by either increasing or decreasing the value of the scaling factor SF, as required in response to characteristics of the data being processed. This aspect of the invention also makes it unnecessary to attempt to predict the characteristics of the data to be processed upon initially setting the value of the scaling factor. - A scheduler configured in accordance with the present invention can also adapt to changes in a stream of data by increasing or decreasing the scaling factor SF as the situation requires. Thus the scheduler may, for example, increase the scaling factor SF during an initial period of operation, then may decrease the scaling factor SF in response to a change in the pattern of data traffic, and further may increase the scaling factor SF again in response to another change in the pattern of data traffic.
- Noting again that plural scheduling queues (e.g., 64) may be maintained in the inventive scheduler, it should be understood that respective scaling factors SF of the scheduling queues are advantageously to be adjusted independently of one another. Consequently, in a typical situation in accordance with the invention, different values of scaling factors are applicable to different scheduling queues at any given time.
- The processes of
FIG. 4-6B may be implemented in hardware, software or a combination thereof. In at least one embodiment of the invention, the processes ofFIGS. 4-6B are implemented in hardware employing a suitable combination of conventional logic circuitry such as adders, comparators, selectors, etc. Such hardware may be located, for example, within thescheduler 34 and/or the scheduler 38 (FIG. 2 ). A person of ordinary skill in the art may develop logic circuitry capable of performing the inventive processes described with reference toFIGS. 4-6B . In a software embodiment of the invention, the processes ofFIGS. 4-6B may comprise one or more computer program products. Each inventive computer program product may be carried by a medium readable by a computer (e.g., a carrier wave signal, a floppy disk, a hard drive, a random access memory, etc.). - The foregoing description discloses only exemplary embodiments of the invention; modifications of the above disclosed apparatus and methods which fall within the scope of the invention will be readily apparent to those of ordinary skill in the art. According to one alternative embodiment, a scheduling queue may have plural subqueues of different ranges and resolutions, according to an invention disclosed in co-pending patent application Ser. No. 10/016,518, filed Nov. 1, 2001 (Attorney Docket No. ROC920010199US1). This co-pending patent application is incorporated herein by reference.
- Moreover, in the above description, the invention has been implemented in a separate scheduler chip associated with a network processor. However, it is also contemplated to implement the invention in a scheduler circuit that is implemented as part of a data flow chip or as part of a processor chip.
- Furthermore, in accordance with above-disclosed embodiments of the invention, reduction of the scaling factor SF has been triggered by underutilization of the range of the scheduling queue, where underutilization has been effectively defined as attaching flows repeatedly in the lower half of the scheduling queue. It is alternatively contemplated, however, to define underutilization of the range of the scheduling queue in other ways. For example, underutilization may be deemed to have occurred upon repeated attachment of flows in the lower third or lower quarter of the scheduling queue.
- Accordingly, while the present invention has been disclosed in connection with exemplary embodiments thereof, it should be understood that other embodiments may fall within the spirit and scope of the invention, as defined by the following claims.
Claims (19)
1. A scheduler for a network processor, the scheduler including a scheduling queue in which weighted fair queuing is applied, the scheduling queue having a range R, flows being attached to the scheduling queue at a distance D from a current pointer for the scheduling queue, the distance D being calculated for each flow according to the formula D=((WF×FS)/SF), where:
WF is a weighting factor applicable to a respective flow;
FS is a frame size attributable to the respective flow; and
SF is a scaling factor;
wherein the scaling factor SF is adjusted depending on a result of comparing the distance D to the range R.
2. The scheduler of claim 1 , wherein SF is increased if D>R.
3. The scheduler of claim 2 , wherein SF is increased if D exceeds R in regard to a predetermined number of calculations of D.
4. The scheduler of claim 1 , wherein SF is decreased if D<R/2.
5. The scheduler of claim 4 , wherein SF is decreased if D is less than one-half R in regard to a predetermined number of calculations of D.
6. The scheduler of claim 1 , wherein SF=2n, n being a positive integer.
7. A scheduler of claim 6 , wherein n is incremented to adjust SF.
8. The scheduler of claim 6 , wherein n is decremented to adjust SF.
9. A scheduler for a network processor, the scheduler including:
a scheduling queue in which weighted fair queuing is applied, the scheduling queue having a range R, flows being attached to the scheduling queue at a distance D from a current pointer for the scheduling queue, the distance D being calculated for each flow according to the formula D=((WF×FS)/SF), where:
WF is a weighting factor applicable to a respective flow;
FS is a frame size attributable to the respective flow; and
SF is a scaling factor;
wherein the scheduler is adapted to:
calculate the distance D with respect to a particular flow to be enqueued;
compare the distance D to the range R;
increment a counter if the comparison of the distance D to the range R determines that D>R; and
increase SF if the incremented counter exceeds a threshold.
10. A scheduler for a network processor, the scheduler including:
a scheduling queue in which weighted fair queuing is applied, the scheduling queue having a range R, flows being attached to the scheduling queue at a distance D from a current pointer for the scheduling queue, the distance D being calculated for each flow according to the formula D=((WF×FS)/SF), where:
WF is a weighting factor applicable to a respective flow;
FS is a frame size attributable to the respective flow; and
SF is a scaling factor;
wherein the scheduler is adapted to:
calculate the distance D with respect to a particular flow to be enqueued;
compare the distance D to the range R;
increment a counter if the comparison of the distance D to the range R determines that D<R/2; and
decrease SF if the incremented counter exceeds a threshold.
11. A scheduler for a network processor, the scheduler including:
a scheduling queue in which weighted fair queuing is applied, the scheduling queue having a range R, flows being attached to the scheduling queue at a distance D from a current pointer for the scheduling queue, the distance D being calculated for each flow according to the formula D=((WF×FS)/SF), where:
WF is a weighting factor applicable to a respective flow;
FS is a frame size attributable to the respective flow; and
SF is a scaling factor;
wherein the scheduler is adapted to:
calculate the distance D with respect to a particular flow to be enqueued;
compare the distance D to the range R;
increment a first counter if the comparison of the distance D to the range R determines that D>R;
increase SF if the incremented first counter exceeds a first threshold;
increment a second counter if the comparison of the distance D to the range R determines that D<R/2; and
decrease SF if the incremented second counter exceeds a second threshold.
12. A scheduler for a network processor, the scheduler including:
a scheduling queue in which weighted fair queuing is applied, the scheduling queue having a range R, flows being attached to the scheduling queue at a distance D from a current pointer for the scheduling queue, the distance D being calculated for each flow according to the formula D=((WF×FS)/SF), where:
WF is a weighting factor applicable to a respective flow;
FS is a frame size attributable to the respective flow; and
SF is a scaling factor;
wherein the scheduler is adapted to:
calculate the distance D with respect to a particular flow to be enqueued;
compare the distance D to the range R; and
increase SF if the distance D exceeds the range R.
13. A scheduler for a network processor, the scheduler including:
a scheduling queue in which weighted fair queuing is applied, the scheduling queue having a range R, flows being attached to the scheduling queue at a distance D from a current pointer for the scheduling queue, the distance D being calculated for each flow according to the formula D=((WF×FS)/SF), where:
WF is a weighting factor applicable to a respective flow;
FS is a frame size attributable to the respective flow; and
SF is a scaling factor;
wherein the scheduler is adapted to:
calculate the distance D with respect to a particular flow to be enqueued;
compare the distance D to the range R;
increase SF if the distance D exceeds the range R;
increment a counter if the comparison of the distance D to the range R determines that D<R/2; and
decrease SF if the incremented counter exceeds a threshold.
14. A computer program product for use with a scheduler for a network processor, the scheduler including:
a scheduling queue in which weighted fair queuing is applied, the scheduling queue having a range R, flows being attached to the scheduling queue at a distance D from a current pointer for the scheduling queue, the distance D being calculated for each flow according to the formula D=((WF×FS)/SF), where:
WF is a weighting factor applicable to a respective flow;
FS is a frame size attributable to the respective flow; and
SF is a scaling factor;
the computer program product comprising:
a medium readable by a computer, the computer readable medium having computer program code adapted to:
calculate the distance D with respect to a particular flow to be enqueued;
compare the distance D to the range R;
increment a counter if the comparison of the distance D to the range R determines that D>R; and
increase SF if the incremented counter exceeds a threshold.
15. A computer program product for use with a scheduler for a network processor, the scheduler including:
a scheduling queue in which weighted fair queuing is applied, the scheduling queue having a range R, flows being attached to the scheduling queue at a distance D from a current pointer for the scheduling queue, the distance D being calculated for each flow according to the formula D=((WF×FS)/SF), where:
WF is a weighting factor applicable to a respective flow;
FS is a frame size attributable to the respective flow; and
SF is a scaling factor;
the computer program product comprising:
a medium readable by a computer, the computer readable medium having computer program code adapted to:
calculate the distance D with respect to a particular flow to be enqueued;
compare the distance D to the range R;
increment a counter if the comparison of the distance D to the range R determines that D<R/2; and
decrease SF if the incremented counter exceeds a threshold.
16. A computer program product for use with a scheduler for a network processor, the scheduler including:
a scheduling queue in which weighted fair queuing is applied, the scheduling queue having a range R, flows being attached to the scheduling queue at a distance D from a current pointer for the scheduling queue, the distance D being calculated for each flow according to the formula D=((WF×FS)/SF), where:
WF is a weighting factor applicable to a respective flow;
FS is a frame size attributable to the respective flow; and
SF is a scaling factor;
the computer program product comprising:
a medium readable by a computer, the computer readable medium having computer program code adapted to:
calculate the distance D with respect to a particular flow to be enqueued;
compare the distance D to the range R;
increment a first counter if the comparison of the distance D to the range R determines that D>R;
increase SF if the incremented first counter exceeds a first threshold;
increment a second counter if the comparison of the distance D to the range R determines that D<R/2; and
decrease SF if the incremented second counter exceeds a second threshold.
17. A computer program product for use with a scheduler for a network processor, the scheduler including:
a scheduling queue in which weighted fair queuing is applied, the scheduling queue having a range R, flows being attached to the scheduling queue at a distance D from a current pointer for the scheduling queue, the distance D being calculated for each flow according to the formula D=((WF×FS)/SF), where:
WF is a weighting factor applicable to a respective flow;
FS is a frame size attributable to the respective flow; and
SF is a scaling factor;
the computer program product comprising:
a medium readable by a computer, the computer readable medium having computer program code adapted to:
calculate the distance D with respect to a particular flow to be enqueued;
compare the distance D to the range R; and
increase SF if the distance D exceeds the range R.
18. A computer program product for use with a scheduler for a network processor, the scheduler including:
a scheduling queue in which weighted fair queuing is applied, the scheduling queue having a range R, flows being attached to the scheduling queue at a distance D from a current pointer for the scheduling queue, the distance D being calculated for each flow according to the formula D=((WF×FS)/SF), where:
WF is a weighting factor applicable to a respective flow;
FS is a frame size attributable to the respective flow; and
SF is a scaling factor;
the computer program product comprising:
a medium readable by a computer, the computer readable medium having computer program code adapted to:
calculate the distance D with respect to a particular flow to be enqueued;
compare the distance D to the range R;
increase SF if the distance D exceeds the range R;
increment a counter if the comparison of the distance D to the range R determines that D<R/2; and
decrease SF if the incremented counter exceeds a threshold.
19. A computer program product for use with a scheduler for a network processor, the scheduler including:
a scheduling queue in which weighted fair queuing is applied, the scheduling queue having a range R, flows being attached to the scheduling queue at a distance D from a current pointer for the scheduling queue, the distance D being calculated for each flow according to the formula D=((WF×FS)/SF), where:
WF is a weighting factor applicable to a respective flow;
FS is a frame size attributable to the respective flow; and
SF is a scaling factor;
the computer program product comprising:
a medium readable by a computer, the computer readable medium having computer program code adapted to:
calculate the distance D with respect to a particular flow to be enqueued;
compare the distance D to the range R; and
adjust the scaling factor SF based on a result of the comparison of the distance D to the range R.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/862,060 US20080013452A1 (en) | 2001-11-01 | 2007-09-26 | Weighted fair queue having adjustable scaling factor |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/015,760 US7280474B2 (en) | 2001-11-01 | 2001-11-01 | Weighted fair queue having adjustable scaling factor |
US11/862,060 US20080013452A1 (en) | 2001-11-01 | 2007-09-26 | Weighted fair queue having adjustable scaling factor |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/015,760 Continuation US7280474B2 (en) | 2001-11-01 | 2001-11-01 | Weighted fair queue having adjustable scaling factor |
Publications (1)
Publication Number | Publication Date |
---|---|
US20080013452A1 true US20080013452A1 (en) | 2008-01-17 |
Family
ID=21773443
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/015,760 Expired - Fee Related US7280474B2 (en) | 2001-11-01 | 2001-11-01 | Weighted fair queue having adjustable scaling factor |
US11/862,060 Abandoned US20080013452A1 (en) | 2001-11-01 | 2007-09-26 | Weighted fair queue having adjustable scaling factor |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/015,760 Expired - Fee Related US7280474B2 (en) | 2001-11-01 | 2001-11-01 | Weighted fair queue having adjustable scaling factor |
Country Status (1)
Country | Link |
---|---|
US (2) | US7280474B2 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9432445B1 (en) * | 2013-05-17 | 2016-08-30 | Sprint Communications Company L.P. | System and method of maintaining an enqueue rate of data messages into a set of queues |
US9590885B1 (en) | 2013-03-13 | 2017-03-07 | Sprint Communications Company L.P. | System and method of calculating and reporting of messages expiring from a queue |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7317683B2 (en) * | 2001-11-01 | 2008-01-08 | International Business Machines Corporation | Weighted fair queue serving plural output ports |
US6910092B2 (en) * | 2001-12-10 | 2005-06-21 | International Business Machines Corporation | Chip to chip interface for interconnecting chips |
US7680043B2 (en) * | 2002-03-20 | 2010-03-16 | International Business Machines Corporation | Network processor having fast flow queue disable process |
US20060018322A1 (en) * | 2004-07-21 | 2006-01-26 | Moshe Oron | Dedicated service class for voice traffic |
US20070070895A1 (en) * | 2005-09-26 | 2007-03-29 | Paolo Narvaez | Scaleable channel scheduler system and method |
WO2017129228A1 (en) * | 2016-01-26 | 2017-08-03 | Telefonaktiebolaget Lm Ericsson (Publ) | Technique for determining a load of an application |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6952424B1 (en) * | 2000-04-13 | 2005-10-04 | International Business Machines Corporation | Method and system for network processor scheduling outputs using queueing |
US7194741B2 (en) * | 1999-12-08 | 2007-03-20 | Tayyar Haitham F | Weighted fair queuing scheduler |
US7315901B1 (en) * | 2000-04-13 | 2008-01-01 | International Business Machines Corporation | Method and system for network processor scheduling outputs using disconnect/reconnect flow queues |
Family Cites Families (96)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3795A (en) * | 1844-10-12 | Stay for | ||
US136230A (en) * | 1873-02-25 | Improvement in combined rulers and pencil-sharpeners | ||
US12294A (en) * | 1855-01-23 | Improvement in cotton-seed planters | ||
US163922A (en) * | 1875-06-01 | Improvement in feed-cases for machine-guns | ||
US4621359A (en) * | 1984-10-18 | 1986-11-04 | Hughes Aircraft Company | Load balancing for packet switching nodes |
US5249184A (en) * | 1990-01-30 | 1993-09-28 | Johnson Service Company | Network control system with improved reliability |
JPH0494240A (en) | 1990-08-09 | 1992-03-26 | Mitsubishi Electric Corp | Cell exchange |
US5490141A (en) * | 1994-09-30 | 1996-02-06 | International Business Machines Corporation | System and method for providing SVC service through an ATM network for frame relay DTEs with a terminal adapter |
EP0717532A1 (en) * | 1994-12-13 | 1996-06-19 | International Business Machines Corporation | Dynamic fair queuing to support best effort traffic in an ATM network |
US5548590A (en) * | 1995-01-30 | 1996-08-20 | Hewlett-Packard Company | High performance frame time monitoring system and method for a fiber optic switch for a fiber optic network |
US5650993A (en) * | 1995-03-20 | 1997-07-22 | Bell Communications Research, Inc. | Drop from front of buffer policy in feedback networks |
US5917822A (en) * | 1995-11-15 | 1999-06-29 | Xerox Corporation | Method for providing integrated packet services over a shared-media network |
US6157649A (en) | 1995-11-17 | 2000-12-05 | 3 Com Corporation | Method and system for coordination and control of data streams that terminate at different termination units using virtual tunneling |
CA2186795A1 (en) * | 1995-11-17 | 1997-05-18 | Cormac John Sreenan | Resource management system for a broadband multipoint bridge |
WO1997022195A1 (en) * | 1995-12-14 | 1997-06-19 | Cisco Systems, Inc. | Multi-level rate scheduler |
US5790545A (en) * | 1996-03-14 | 1998-08-04 | Motorola Inc. | Efficient output-request packet switch and method |
US5946297A (en) * | 1996-05-31 | 1999-08-31 | International Business Machines Corporation | Scheduling method and apparatus for supporting ATM connections having a guaranteed minimun bandwidth |
US6038217A (en) | 1996-06-27 | 2000-03-14 | Xerox Corporation | Rate shaping in per-flow output queued routing mechanisms for available bit rate (ABR) service in networks having segmented ABR control loops |
US5926459A (en) * | 1996-06-27 | 1999-07-20 | Xerox Corporation | Rate shaping in per-flow queued routing mechanisms for available bit rate service |
US6064650A (en) * | 1996-06-27 | 2000-05-16 | Xerox Corporation | Rate shaping in per-flow output queued routing mechanisms having output links servicing multiple physical layers |
US6064677A (en) | 1996-06-27 | 2000-05-16 | Xerox Corporation | Multiple rate sensitive priority queues for reducing relative data transport unit delay variations in time multiplexed outputs from output queued routing mechanisms |
US6018527A (en) * | 1996-08-13 | 2000-01-25 | Nortel Networks Corporation | Queue service interval based cell scheduler with hierarchical queuing configurations |
US5831971A (en) * | 1996-08-22 | 1998-11-03 | Lucent Technologies, Inc. | Method for leaky bucket traffic shaping using fair queueing collision arbitration |
DE19634492B4 (en) | 1996-08-26 | 2004-10-14 | Siemens Ag | Method for the optimized transmission of ATM cells over connection sections |
JP3435293B2 (en) * | 1996-09-10 | 2003-08-11 | 株式会社東芝 | Packet scheduling apparatus and packet transfer method |
US6229812B1 (en) | 1996-10-28 | 2001-05-08 | Paxonet Communications, Inc. | Scheduling techniques for data cells in a data switch |
US6791947B2 (en) | 1996-12-16 | 2004-09-14 | Juniper Networks | In-line packet processing |
US6028842A (en) | 1996-12-23 | 2000-02-22 | Nortel Networks Corporation | Dynamic traffic conditioning |
US6092115A (en) | 1997-02-07 | 2000-07-18 | Lucent Technologies Inc. | Method for supporting per-connection queuing for feedback-controlled traffic |
US6452933B1 (en) | 1997-02-07 | 2002-09-17 | Lucent Technologies Inc. | Fair queuing system with adaptive bandwidth redistribution |
US5991305A (en) * | 1997-02-14 | 1999-11-23 | Advanced Micro Devices, Inc. | Integrated multiport switch having independently resettable management information base (MIB) |
US6028843A (en) | 1997-03-25 | 2000-02-22 | International Business Machines Corporation | Earliest deadline first communications cell scheduler and scheduling method for transmitting earliest deadline cells first |
US5844890A (en) * | 1997-03-25 | 1998-12-01 | International Business Machines Corporation | Communications cell scheduler and scheduling method for providing proportional use of network bandwith |
AU6788598A (en) * | 1997-04-04 | 1998-10-30 | Ascend Communications, Inc. | Hierarchical packet scheduling method and apparatus |
US5926481A (en) * | 1997-04-16 | 1999-07-20 | Industrial Technology Research Institute | Timer Interrupt method for achieving quality-of-service criteria in a media-on-demand server system |
US6041059A (en) | 1997-04-25 | 2000-03-21 | Mmc Networks, Inc. | Time-wheel ATM cell scheduling |
US6014367A (en) * | 1997-04-25 | 2000-01-11 | Mmc Networks, Inc | Method for weighted fair queuing for ATM cell scheduling |
US6236647B1 (en) | 1998-02-24 | 2001-05-22 | Tantivy Communications, Inc. | Dynamic frame size adjustment and selective reject on a multi-link channel to improve effective throughput and bit error rate |
US6157654A (en) | 1997-06-24 | 2000-12-05 | Alcatel Networks Corporation | Adaptive service weight assignments for ATM scheduling |
US6094435A (en) * | 1997-06-30 | 2000-07-25 | Sun Microsystems, Inc. | System and method for a quality of service in a multi-layer network element |
US6072800A (en) | 1997-08-18 | 2000-06-06 | Nec Usa, Inc. | Weighted longest queue first adaptive scheduling discipline for ATM networks |
US6104700A (en) | 1997-08-29 | 2000-08-15 | Extreme Networks | Policy based quality of service |
US6157614A (en) | 1997-10-22 | 2000-12-05 | Netro Corporation | Wireless ATM network with high quality of service scheduling |
US6169740B1 (en) | 1997-10-30 | 2001-01-02 | Nortel Networks Limited | Method of and apparatus for virtual link management |
US6389031B1 (en) * | 1997-11-05 | 2002-05-14 | Polytechnic University | Methods and apparatus for fairly scheduling queued packets using a ram-based search engine |
US5999963A (en) * | 1997-11-07 | 1999-12-07 | Lucent Technologies, Inc. | Move-to-rear list scheduling |
US6144669A (en) | 1997-12-12 | 2000-11-07 | Newbridge Networks Corporation | Prioritized PVC management queues for improved frame processing capabilities |
US6108307A (en) | 1997-12-12 | 2000-08-22 | Newbridge Networks Corporation | Frame relay priority queses to offer multiple service classes |
US6078953A (en) | 1997-12-29 | 2000-06-20 | Ukiah Software, Inc. | System and method for monitoring quality of service over network |
US6259699B1 (en) * | 1997-12-30 | 2001-07-10 | Nexabit Networks, Llc | System architecture for and method of processing packets and/or cells in a common switch |
US6188698B1 (en) | 1997-12-31 | 2001-02-13 | Cisco Technology, Inc. | Multiple-criteria queueing and transmission scheduling system for multimedia networks |
CA2318163A1 (en) | 1998-01-12 | 1999-07-15 | Cabletron Systems, Inc. | Method for providing delays independent of switch size in a crossbar switch with speedup |
US6072772A (en) * | 1998-01-12 | 2000-06-06 | Cabletron Systems, Inc. | Method for providing bandwidth and delay guarantees in a crossbar switch with speedup |
US6246692B1 (en) * | 1998-02-03 | 2001-06-12 | Broadcom Corporation | Packet switching fabric using the segmented ring with resource reservation control |
US6389019B1 (en) * | 1998-03-18 | 2002-05-14 | Nec Usa, Inc. | Time-based scheduler architecture and method for ATM networks |
US6714553B1 (en) | 1998-04-15 | 2004-03-30 | Top Layer Networks, Inc. | System and process for flexible queuing of data packets in network switching |
US6430184B1 (en) | 1998-04-10 | 2002-08-06 | Top Layer Networks, Inc. | System and process for GHIH-speed pattern matching for application-level switching of data packets |
US6226267B1 (en) | 1998-04-10 | 2001-05-01 | Top Layer Networks, Inc. | System and process for application-level flow connection of data processing networks |
US6721325B1 (en) * | 1998-04-23 | 2004-04-13 | Alcatel Canada Inc. | Fair share scheduling of multiple service classes with prioritized shaping |
US6160812A (en) * | 1998-05-04 | 2000-12-12 | Cabletron Systems, Inc. | Method and apparatus for supplying requests to a scheduler in an input buffered multiport switch |
GB2337406B (en) * | 1998-05-11 | 2003-05-14 | Fujitsu Ltd | Scheduling circuitry and methods |
GB9810552D0 (en) | 1998-05-15 | 1998-07-15 | Nds Ltd | Multiplexer |
US6067301A (en) * | 1998-05-29 | 2000-05-23 | Cabletron Systems, Inc. | Method and apparatus for forwarding packets from a plurality of contending queues to an output |
EP1005779B1 (en) * | 1998-06-19 | 2008-03-12 | Juniper Networks, Inc. | Device for performing ip forwarding and atm switching |
US6404768B1 (en) * | 1998-06-23 | 2002-06-11 | Marconi Communications, Inc. | Method and apparatus for serving ATM packets/cells |
WO2000003256A1 (en) | 1998-07-08 | 2000-01-20 | Broadcom Corporation | Network switch utilizing packet based per head-of-line blocking prevention |
US6885664B2 (en) * | 1998-07-22 | 2005-04-26 | Synchrodyne Networks, Inc. | Distributed switching system and method with time-based routing |
US6122673A (en) | 1998-07-22 | 2000-09-19 | Fore Systems, Inc. | Port scheduler and method for scheduling service providing guarantees, hierarchical rate limiting with/without overbooking capability |
ATE290743T1 (en) * | 1998-07-31 | 2005-03-15 | Cit Alcatel | METHOD, SEQUENCER, INTELLIGENT BUFFER MEMORY, PROCESSOR AND TELECOMMUNICATIONS SYSTEM FOR DISTRIBUTING AVAILABLE BANDWIDTH |
US6356546B1 (en) * | 1998-08-11 | 2002-03-12 | Nortel Networks Limited | Universal transfer method and network with distributed switch |
JP3306705B2 (en) | 1998-09-22 | 2002-07-24 | 富士通株式会社 | Packet transfer control device and scheduling method thereof |
US6266702B1 (en) * | 1998-09-28 | 2001-07-24 | Raytheon Company | Method and apparatus to insert and extract data from a plurality of slots of data frames by using access table to identify network nodes and their slots for insertion and extraction data |
US6608625B1 (en) * | 1998-10-14 | 2003-08-19 | Hitachi, Ltd. | Three dimensional graphic processor |
US6081507A (en) | 1998-11-04 | 2000-06-27 | Polytechnic University | Methods and apparatus for handling time stamp aging |
US6229813B1 (en) | 1998-11-25 | 2001-05-08 | Alcatel Canada Inc. | Pointer system for queue size control in a multi-task processing application |
JP2000183886A (en) | 1998-12-18 | 2000-06-30 | Sumitomo Electric Ind Ltd | Communication equipment |
US6470016B1 (en) * | 1999-02-09 | 2002-10-22 | Nortel Networks Limited | Servicing output queues dynamically according to bandwidth allocation in a frame environment |
JP3166766B2 (en) | 1999-04-09 | 2001-05-14 | 日本電気株式会社 | Queuing method, queuing system routing method, and shake-up switch using the same |
JP3175735B2 (en) | 1999-04-09 | 2001-06-11 | 日本電気株式会社 | Switch routing method and shooting blanks switch using the same |
JP2000324115A (en) * | 1999-05-13 | 2000-11-24 | Nec Corp | Output buffer atm exchange and multiple address control method |
US7058063B1 (en) | 1999-06-18 | 2006-06-06 | Nec Corporation | Pipelined packet scheduler for high speed optical switches |
WO2001013590A1 (en) * | 1999-08-17 | 2001-02-22 | Conexant Systems, Inc. | Integrated circuit with a core processor and a co-processor to provide traffic stream processing |
AU7495800A (en) | 1999-09-15 | 2001-04-17 | Tellabs Operations, Inc. | Allocating network bandwidth |
US6850490B1 (en) * | 1999-10-06 | 2005-02-01 | Enterasys Networks, Inc. | Hierarchical output-queued packet-buffering system and method |
US6646986B1 (en) | 1999-10-14 | 2003-11-11 | Nortel Networks Limited | Scheduling of variable sized packet data under transfer rate control |
US6481251B1 (en) * | 1999-10-25 | 2002-11-19 | Advanced Micro Devices, Inc. | Store queue number assignment and tracking |
JP2001177575A (en) * | 1999-12-20 | 2001-06-29 | Nec Corp | Preferential control system |
US6813274B1 (en) * | 2000-03-21 | 2004-11-02 | Cisco Technology, Inc. | Network switch and method for data switching using a crossbar switch fabric with output port groups operating concurrently and independently |
US6804249B1 (en) * | 2000-04-13 | 2004-10-12 | International Business Machines Corporation | Method and system for network processor scheduling based on calculation |
US7123622B2 (en) * | 2000-04-13 | 2006-10-17 | International Business Machines Corporation | Method and system for network processor scheduling based on service levels |
JP2002050184A (en) * | 2000-08-01 | 2002-02-15 | Kawasaki Microelectronics Kk | Associative memory |
US7158528B2 (en) | 2000-12-15 | 2007-01-02 | Agere Systems Inc. | Scheduler for a packet routing and switching system |
AU2002242067A1 (en) * | 2001-01-30 | 2002-08-12 | Nomadix, Inc. | Methods and systems providing fair queuing and priority scheduling to enhance quality of service in a network |
US6832261B1 (en) * | 2001-02-04 | 2004-12-14 | Cisco Technology, Inc. | Method and apparatus for distributed resequencing and reassembly of subdivided packets |
US7058057B2 (en) | 2001-05-01 | 2006-06-06 | Integrated Device Technology, Inc. | Network switch port traffic manager having configurable packet and cell servicing |
US6990097B2 (en) * | 2001-06-01 | 2006-01-24 | 4198638 Canada Inc. | Cell-based switch fabric with inter-cell control for regulating packet flow |
-
2001
- 2001-11-01 US US10/015,760 patent/US7280474B2/en not_active Expired - Fee Related
-
2007
- 2007-09-26 US US11/862,060 patent/US20080013452A1/en not_active Abandoned
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7194741B2 (en) * | 1999-12-08 | 2007-03-20 | Tayyar Haitham F | Weighted fair queuing scheduler |
US6952424B1 (en) * | 2000-04-13 | 2005-10-04 | International Business Machines Corporation | Method and system for network processor scheduling outputs using queueing |
US7315901B1 (en) * | 2000-04-13 | 2008-01-01 | International Business Machines Corporation | Method and system for network processor scheduling outputs using disconnect/reconnect flow queues |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9590885B1 (en) | 2013-03-13 | 2017-03-07 | Sprint Communications Company L.P. | System and method of calculating and reporting of messages expiring from a queue |
US9432445B1 (en) * | 2013-05-17 | 2016-08-30 | Sprint Communications Company L.P. | System and method of maintaining an enqueue rate of data messages into a set of queues |
Also Published As
Publication number | Publication date |
---|---|
US7280474B2 (en) | 2007-10-09 |
US20030081552A1 (en) | 2003-05-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20080013452A1 (en) | Weighted fair queue having adjustable scaling factor | |
US7929548B2 (en) | Weighted fair queue serving plural output ports | |
EP1083709B1 (en) | Method and apparatus for scheduling traffic to meet quality of service requirements in a communication network | |
US7415477B2 (en) | Method and apparatus for allocating link bandwidth | |
US7212535B2 (en) | Scheduling items using mini-quantum values | |
US20040090974A1 (en) | Method and apparatus for bandwidth guarantee and overload protection in a network switch | |
EP3070893B1 (en) | Scheduling of packets in network devices | |
JP4447521B2 (en) | Packet scheduler and packet scheduling method | |
US20070140285A1 (en) | Weighted fair queue having extended effective range | |
EP2740245B1 (en) | A scalable packet scheduling policy for vast number of sessions | |
US6982986B2 (en) | QoS scheduler and method for implementing quality of service anticipating the end of a chain of flows | |
US20030189934A1 (en) | Method and system for priority enforcement with flow control | |
US20080025215A1 (en) | METHOD AND APPARATUS FOR IMPROVING THE FAIRNESS OF NEW ATTACHES TO A WEIGHTED FAIR QUEUE IN A QUALITY OF SERVICE (QoS) SCHEDULER | |
US6990115B2 (en) | Queue control method and system | |
US6973036B2 (en) | QoS scheduler and method for implementing peak service distance using next peak service time violated indication | |
EP1461920A1 (en) | Method for real time network traffic admission and scheduling | |
EP1232627B1 (en) | Method and system for controlling transmission of packets in computer networks | |
US7103051B2 (en) | QoS scheduler and method for implementing quality of service with aging time stamps | |
EP1347602B1 (en) | Two stage egress scheduler for a network device | |
US7680124B2 (en) | Frame mapping scheduler for scheduling data blocks using a mapping table and a weight table | |
US7231425B1 (en) | Rate-based scheduling method and system | |
US7310345B2 (en) | Empty indicators for weighted fair queues | |
US6618391B1 (en) | Method and apparatus for guaranteeing data transfer rates and delays in data packet networks using discrete data transfer rates | |
Zhang et al. | An efficient scheduling scheme for XMP and DCTCP mixed flows in commodity data centers | |
AU2002365600A1 (en) | Method for real time network traffic admission and scheduling |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO PAY ISSUE FEE |