Patents by Inventor Istvan BAKOS

Istvan BAKOS 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: 10374832
    Abstract: The present invention addresses method, apparatus and computer program product for resource management within a distributed system in a core network element, comprising organizing computing resources of the core network element into sets, wherein a first set is always active, setting an upper threshold and a lower threshold for the load of the sets, wherein the sets in operation are loaded as long as the average load of the sets in operation reaches the upper threshold, and when the upper threshold is exceeded, a new set is activated, whereas, when the load thereof falls below the lower threshold, the last activated set is deactivated, assigning a priority number to each set, segmenting an interval of random numbers for randomizing a request distribution in subintervals which are allocated to the computing resources of the active sets, wherein the length of each subinterval is determined based on the priority number of the set of the respective computing resource, and allotting a random number out of the inte
    Type: Grant
    Filed: November 25, 2014
    Date of Patent: August 6, 2019
    Assignee: NOKIA SOLUTIONS AND NETWORKS OY
    Inventors: Istvan Bakos, Gyula Bodog, Attila Gabor Hilt, Laszlo Janosi, Gabor Jaro
  • Publication number: 20170264463
    Abstract: The present invention addresses method, apparatus and computer program product for resource management within a distributed system in a core network element, comprising organizing computing resources of the core network element into sets, wherein a first set is always active, setting an upper threshold and a lower threshold for the load of the sets, wherein the sets in operation are loaded as long as the average load of the sets in operation reaches the upper threshold, and when the upper threshold is exceeded, a new set is activated, whereas, when the load thereof falls below the lower threshold, the last activated set is deactivated, assigning a priority number to each set, segmenting an interval of random numbers for randomizing a request distribution in subintervals which are allocated to the computing resources of the active sets, wherein the length of each subinterval is determined based on the priority number of the set of the respective computing resource, and allotting a random number out of the inte
    Type: Application
    Filed: November 25, 2014
    Publication date: September 14, 2017
    Inventors: Istvan BAKOS, Gyula BODOG, Attila Gabor HILT, Laszlo JANOSI, Gabor JARO