The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Apr. 29, 2008

Filed:

Oct. 02, 2001
Applicants:

Áron Szentesi, Budapest, HU;

Gábor Magyar, Keeskernét, HU;

Zoltán Király, Budakeszi, HU;

Inventors:

Áron Szentesi, Budapest, HU;

Gábor Magyar, Keeskernét, HU;

Zoltán Király, Budakeszi, HU;

Assignee:
Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
H04L 12/28 (2006.01); H04Q 7/00 (2006.01); G06F 15/173 (2006.01);
U.S. Cl.
CPC ...
Abstract

The present invention provides a method for optimization of the configuration of a hierarchical network having a first hierarchy level (LEVEL(j−1)), a second hierarchy level (LEVEL(j)) next below the first level, and a third hierarchy level (LEVEL(j+1)) next below the second level, each level comprising nodes (RNC's, HUB's, RBS's) each of which, in level other than the lowest, receives traffic from a cluster of nodes (HUB's, RBS's) of the level next below. The method comprises first determining an initial arrangement of nods (RNC's, HUB's, RBS's) in each of the levels other than the highest, allocating respective initial clusters of nodes (HUB's, RBS's) of that level to the nodes (RNC's, HUB's) of the next higher level, and performing optimizing iterations until they result in no changes in number, disposition and allocation of nodes (RNC's, HUB's, RBS's) over predetermined number of iterations.


Find Patent Forward Citations

Loading…