Grouping class sensitive queues

Details Grouping class sensitive queues Grouping class sensitive queues

1999-09-23

2002-11-12

Lee, Thomas (Department: 2185)

Electrical computers and digital data processing systems: input/

Input/output data processing

Input/output data buffering

C370S429000, C370S329000, C709S240000, C709S242000, C710S052000

Reexamination Certificate

active

06480911

ABSTRACT:

BACKGROUND OF THE INVENTION
1. Field of Invention
This invention relates to methods and apparatus for class sensitive queuing.
2. Description of Related Art
Data transmitted in a network is often placed in a serial queue for routing and forwarding. The order that the data is queued is irrespective of the subscribers' subscription relationship with the network service provider. Thus, there are no provisions in the network routing and forwarding processes for making distinctions based on subscribers' subscription requirements. In fact, queuing techniques in general do not address subscription related issues. Accordingly, new technology is needed.
SUMMARY OF THE INVENTION
This invention provides a class queuing system where data is placed in queues distinguished by class. The class queuing system distinguishes one class from another based on desired characteristics of a host process such as a network process. For example, in a network environment, the desired characteristics may be expressed in network parameters such as transmission capacity (bandwidth), transmission throughput, end-to-end delay, quality of transmission or error rate, for example. Classes may be distinguished from each other by specifying minimum bounds of the above parameters so that data transmission for each of the classes may be guaranteed performance above the specified minimum bounds.
The class queuing system establishes groups of class queues which may be implemented using a single or multiple memories. Physical grouping of the class queues is not required because the complete class queuing system may be implemented via memory mapping, for example. However, for ease of visualization and discussion, related figures illustrate the group concept to show the functions of the invention.
Each of the groups corresponds to one output port that is coupled to a network link. A group is separated into multiple levels (logical or physical) that extend from input ports to output ports. Again, physical levels are not required but illustrated in the related figures for clarity only. Input data is first queued in a lowest level queue, and then the data is moved from level to level until the data is placed in an output queue for transmission or output via one of the output ports.
Data movement between levels of the class queues is controlled by a respective weight set where weights of the weight set are determined based on the desired characteristics that distinguish the classes. In this way, data of classes requiring greater bandwidth, for example, is moved through the class queues at a faster rate than data of classes having lower bandwidth requirements.
Each of the class queues may also be associated with buffer thresholds. The buffer thresholds specify a maximum size of a queue or a warning condition so that when an amount of data that is queued exceeds the buffer thresholds, either portions of the data may be dropped from the queue based on a data drop scheme or other queue management processes may be applied to adjust the queuing system. For example, the newest piece of data to be placed in the queue may be dropped or the weight set may be changed to account for the volume of data in the queue (e.g., by increasing queue throughput).
The class queuing system may use a weight based scheduling scheme to control transfer of data packets among queues. The weight sets may specify the data throughput for a queue during each cycle of the weight based scheduling so that appropriate transfer rates corresponding to the desired characteristics of each class may be achieved.


REFERENCES:
patent: 5923656 (1999-07-01), Duan et al.
patent: 5974467 (1999-10-01), Haddock et al.
patent: 6072800 (2000-06-01), Lee
patent: 6075791 (2000-06-01), Chiussi et al.
patent: 6101193 (2000-08-01), Ohba
patent: 6205150 (2001-03-01), Ruszczyk
patent: 6219351 (2001-04-01), Kilkki
patent: 6229795 (2001-05-01), Pankaj et al.
patent: 6259698 (2001-07-01), Shin et al.
patent: 6262986 (2001-07-01), Oba et al.
patent: 6262989 (2001-07-01), Gemar et al.
patent: 6295295 (2001-09-01), Wicklund
patent: 6304906 (2001-10-01), Bhatti et al.
patent: 6317416 (2001-11-01), Giroux et al.
patent: 6330223 (2001-12-01), Shimonishi
patent: 403101443 (1991-04-01), None
patent: 410191455 (1998-07-01), None
patent: 411032050 (1999-02-01), None

Affiliated with

Also associated with

Rating

Grouping class sensitive queues does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Grouping class sensitive queues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Grouping class sensitive queues will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2915413