System and method for adaptive admission control and resource management for service time guarantees

• US 20040230675A1
• Filed: 05/15/2003
• Published: 11/18/2004
• Est. Priority Date: 05/15/2003
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Dillenberger, Donna N., Sahu, Sambit, Pradhan, Prashant, Tewari, Renu, Freimuth, Douglas Morgan
• Granted Patent: US 7,472,159 B2
• Time in Patent Office: Days
• US Class Current: 709/223
• CPC Class Codes: H04L 47/11 Identifying congestion
• CPC Class Codes: H04L 47/15 in relation to multipoint traffic arrangements for broadcast or multicast in data networks H04L12/18
• CPC Class Codes: H04L 47/2433 Allocation of priorities to traffic types
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/745 Reaction in network
• CPC Class Codes: H04L 47/748 Negotiation of resources, e.g. modification of a request
• CPC Class Codes: H04L 47/805 QOS or priority aware
• CPC Class Codes: H04L 47/821 Prioritising resource allocation or reservation requests
• CPC Class Codes: H04L 47/822 Collecting or measuring resource availability data
• CPC Class Codes: H04L 47/826 Involving periods of time
• CPC Class Codes: H04L 67/61 taking into account QoS or priority requirements
• CPC Class Codes: H04L 67/62 Establishing a time schedule for servicing the requests
• CPC Class Codes: H04L 69/16 Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
• CPC Class Codes: H04L 69/163 In-band adaptation of TCP data exchange; In-band control procedures
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

A method and system architecture to manage system resources in such a way as to provide service time guarantees to various classes of work using the system. In the case that the system resources are not sufficient to provide the specified service time guarantees, a method and system architecture is provided to limit work into the system such that the guarantees are satisfied and the revenue derived from the system is maximized.

Claims

1. A system for providing computer server servicing at a plurality of server resources of client requests for a plurality of request classes each having different response time guarantees comprising:

a resource management component for accepting and dynamically scheduling client requests based on request classes and a predetermined scheduling policy;

a monitoring component for monitoring the status of requests in different request classes and for monitoring resource usage; and

an adaptation engine for evaluating the results of said monitoring and for generating adjustment input to said resource management component based on said evaluating.

2. The system of claim 1 wherein said resource management component comprises:

a classifier for classifying incoming client requests into each of said plurality of request classes;

a plurality of class-based accept queues for queuing said incoming client requests; and

an accept queue scheduler for determining the order in which queued client requests are provided for servicing based on said classes and the predetermined policy.

3. The system of claim 2 further comprising a server resource scheduler for allocating resources to service queued client requests provided from said accept queue scheduler.

4. The system of claim 2 wherein the accept queue scheduler is a weighted fair queuing scheduler.

5. The system of claim 3 wherein the server resource scheduler is a hierarchical start-time fair queuing scheduler.

6. The system of claim 2 wherein said monitoring component comprises at least one timer for determining the time for a queued request to be removed from its accept queue.

7. The system of claim 3 wherein said server resource scheduler dynamically partitions available server resources based on request classes, resource availability, and said policy.

8. The system of claim 7 wherein said server resource scheduler dynamically adjusts said partitioning based on said adjustment input.

9. The system of claim 2 wherein said accept queue scheduler dynamically alters said order based on said adjustment input.

10. A method for providing computer server servicing at a plurality of server resources of client requests for a plurality of request classes each having different response time guarantees comprising the steps of:

accepting and dynamically scheduling client requests based on request classes and a predetermined scheduling policy;

monitoring the status of requests in different request classes and server resource usage;

evaluating the results of said monitoring; and

generating adjustment input for said dynamically scheduling based on said evaluating.

11. The method of claim 10 wherein said accepting and dynamically scheduling comprises the steps of:

classifying incoming client requests into each of said plurality of request classes;

queuing classified incoming client requests into a plurality of class-based accept queues; and

determining the order in which queued client requests are provided for servicing based on said classes and the predetermined policy.

12. The method of claim 11 further comprising allocating resources to service queued client requests provided for servicing.

13. The method of claim 11 wherein the determining the order is performed by a weighted fair queuing scheduler.

14. The method of claim 12 wherein the allocating is performed by a hierarchical start-time fair queuing scheduler.

15. The method of claim 11 wherein said monitoring comprises determining the time for a queued request to be removed from its accept queue.

16. The method of claim 12 wherein said allocating comprises dynamically partitioning available server resources based on request classes, resource availability, and said policy.

17. The method of claim 16 wherein said allocating further comprises dynamically adjusting said partitioning based on said adjustment input.

18. The method of claim 11 wherein said determining the order further comprises dynamically altering said order based on said adjustment input.

19. A program storage device readable by machine tangibly embodying a program of instructions executable by the machine to perform method steps for providing computer server servicing at a plurality of server resources of client requests for a plurality of request classes each having different response time guarantees, said method comprising the steps of:

accepting and dynamically scheduling client requests based on request classes and a predetermined scheduling policy;

monitoring the status of requests in different request classes and server resource usage;

evaluating the results of said monitoring; and

generating adjustment input for said dynamically scheduling based on said evaluating.

20. The program storage device of claim 19 wherein said accepting and dynamically scheduling comprises the steps of:

classifying incoming client requests into each of said plurality of request classes;

queuing classified incoming client requests into a plurality of class-based accept queues; and

determining the order in which queued client requests are provided for servicing based on said classes and the predetermined policy,

and further comprising allocating resources to service queued client requests provided for servicing.