Patents by Inventor Bianca Schroeder

Bianca Schroeder has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8831026
    Abstract: 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.
    Type: Grant
    Filed: March 19, 2004
    Date of Patent: September 9, 2014
    Assignee: International Business Machines Corporation
    Inventors: Arun Kwangil Iyengar, Erich M. Nahum, Bianca Schroeder
  • Patent number: 7395351
    Abstract: 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.
    Type: Grant
    Filed: January 28, 2003
    Date of Patent: July 1, 2008
    Assignee: Sprint Spectrum L.P.
    Inventors: Antonio Nucci, Bianca Schroeder, Supratik Bhattacharyya, Nina Taft, Christophe Diot
  • Publication number: 20050207439
    Abstract: 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.
    Type: Application
    Filed: March 19, 2004
    Publication date: September 22, 2005
    Applicant: International Business Machines Corporation
    Inventors: Arun Iyengar, Erich Nahum, Bianca Schroeder