Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network
Reexamination Certificate
2005-10-18
2005-10-18
Hsu, Alpus H. (Department: 2665)
Multiplex communications
Data flow congestion prevention or control
Control of data admission to the network
C370S235000, C370S395400, C370S395420, C370S412000, C370S429000, C709S240000, C710S040000, C711S151000, C711S158000
Reexamination Certificate
active
06956818
ABSTRACT:
A method and apparatus are provided for scheduling data for transmission over a communication link shared by multiple applications operating on a host computer. The apparatus incorporates multiple storage components, with each storage component configured to store descriptors of data having one of multiple priorities. Each descriptor identifies a location (e.g., in host computer memory) of a portion of data to be included in a packet transmitted over the communication link. The apparatus services each storage component in turn to retrieve one or more descriptors, identify their associated data, retrieve the data and prepare it for transmission. Each storage component has an associated weight, which may be proportional to the priority of data represented by descriptors stored in the component. A storage component's weight may indicate a portion of the transmission bandwidth or a maximum amount of data that may be scheduled for transmission each time the component is serviced. The weights are dynamic and may be updated during operation of the apparatus in order to alter the amount of data that may be transmitted during one of a storage component's turn at being serviced. If a weight is changed, servicing of the storage components restarts with the storage component associated with the highest priority data. If more data is scheduled for transmission during a servicing turn than indicated by the weight of the serviced component, a deficit is formed for that component. The deficit serves to decrease the maximum amount of data that may be scheduled during a succeeding turn for the component. When a weight is changed, a deficit may be reset to zero.
REFERENCES:
patent: 5732094 (1998-03-01), Petersen et al.
patent: 5751951 (1998-05-01), Osborne et al.
patent: 5844890 (1998-12-01), Delp et al.
patent: 6094435 (2000-07-01), Hoffman et al.
patent: 6490248 (2002-12-01), Shimojo
patent: 6490640 (2002-12-01), Johansson
patent: 6721273 (2004-04-01), Lyon
patent: 0 710 046 (1996-05-01), None
patent: WO 99/00949 (1999-01-01), None
Shreedhar, et al., Efficient Fair Queuing Using Deficit Round Robin, Computer Communications Review, Association For computing Machinery, New York, US, vol. 25, No. 4, Oct. 1, 1995, pp. 231-242.
Saha, et al. Carry-Over Round Robin: A Simple Cell Scheduling Mechanism for ATM Networks, IEEE/ACM Transactions on Networking, IEEE Inc., New York, US, vol. 6, No. 6, Dec. 1998, pp. 779-796.
Hsu Alpus H.
Park Vaughan & Fleming LLP
Philpott Justin M
Sun Microsystems Inc.
LandOfFree
Method and apparatus for dynamic class-based packet scheduling does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for dynamic class-based packet scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for dynamic class-based packet scheduling will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3456509