Patents by Inventor Priya Krishnan SUNDARARAJAN

Priya Krishnan SUNDARARAJAN 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: 9880885
    Abstract: A method in a server end station is described. The method includes performing an iteration of a rebalancing computation by selecting a set of one or more service sets for rebalancing, wherein the selecting the set of one or more service sets is based on service set constraints and host constraints; generating candidate solutions, wherein each candidate solution includes a randomized one-to-one mapping of each of the service sets to one of the hosts; performing one or more crossover operations on the candidate solutions; performing one or more mutation operations on the additional candidate solutions; selecting as a solution one of the candidate solutions that has a best fitness score, wherein a fitness score for a candidate solution is calculated based on the distribution of resources resulting from and number of migrations needed for the candidate solution; and repeating the iteration of the rebalancing computation an additional number of times.
    Type: Grant
    Filed: April 17, 2015
    Date of Patent: January 30, 2018
    Assignee: Telefonaktiebolaget LM Ericsson (Publ)
    Inventors: Priya Krishnan Sundararajan, Eugen Feller, Julien Forgeat
  • Publication number: 20160226789
    Abstract: A method in a server end station is described. The method includes performing an iteration of a rebalancing computation by selecting a set of one or more service sets for rebalancing, wherein the selecting the set of one or more service sets is based on service set constraints and host constraints; generating candidate solutions, wherein each candidate solution includes a randomized one-to-one mapping of each of the service sets to one of the hosts; performing one or more crossover operations on the candidate solutions; performing one or more mutation operations on the additional candidate solutions; selecting as a solution one of the candidate solutions that has a best fitness score, wherein a fitness score for a candidate solution is calculated based on the distribution of resources resulting from and number of migrations needed for the candidate solution; and repeating the iteration of the rebalancing computation an additional number of times.
    Type: Application
    Filed: April 17, 2015
    Publication date: August 4, 2016
    Inventors: Priya Krishnan SUNDARARAJAN, Eugen FELLER, Julien FORGEAT