International Business Machines Corporation

Sprint Spectrum L.p.

Bianca Schroeder

Arun Kwangil Iyengar

Antonio Nucci

Erich Miles Nahum

Nina Taft

Supratik Bhattacharyya

Christophe Diot

Techniques are provided for dynamically scheduling requests in data processing systems in accordance with differentiated service levels. In a first aspect of the invention, a technique for processing a request to at least one server comprises the following steps. A request is received. Then, submission of the request to the at least one server is scheduled based on: (i) a quality-of-service (QoS) class assigned to a client from which the request originated; (ii) a response target associated with the QoS class; and (iii) an estimated response time associated with the at least one server. The technique may further comprise the step of withholding the request from submission to the at least one server when the request originated from a client assigned to a first QoS class to allow a request that originated from a client assigned to a second QoS class to meet a response target associated therewith.

Method and apparatus for dynamically scheduling requests

The present invention includes a method and system for determining link weights that when utilized will optimize the performance of a network in the event of a link failure without the need to alter the link weights. The method includes determining two sets of links, one that includes links with a significant amount of loading and one that includes links with a modest amount of loading. A set of permissible solutions is generated utilizing one randomly chosen link from each set. After omitting recent best permissible solutions, the remaining permissible solutions are evaluated by analyzing for the complete network topology and for the topologies corresponding to all single-link failure states and the best permissible solution is found. If the best permissible solution is better than the current optimal solution, then the best permissible solution is made the optimal solution. These steps are repeated until a predetermined number of iterations have been evaluated without a change in the optimal solution. When that occurs, the number of links used to generate the set of potential solutions is randomly changed and the above-described steps are repeated. The method is complete after a second predetermined number of iterations have been evaluated no matter how many changes to the optimal solution.

Method for assigning link weights in a communications network

Growing community of inventors

Pittsburgh, PA, United States of America

Bianca Schroeder