Network topologies
First Claim
1. A method for optimization of the configuration of a hierarchical network, the network having m hierarchy levels, where m is at least 3, comprising a first hierarchy level (LEVEL(j−
- 1)), a second hierarchy level (LEVEL(j)) next below the first hierarchy level, and a third hierarchy level (LEVEL(j+1)) next below the second hierarchy level, each hierarchy level comprising nodes (RNC'"'"'s, HUB'"'"'s, RBS'"'"'s) each of which, in hierarchy levels other than the lowest, receives traffic from a cluster of nodes (HUB'"'"'s, RBS'"'"'s) of the hierarchy level next below, the method comprising the steps as follows;
setting and/or generating an initial arrangement of nodes (RNC'"'"'s, HUB'"'"'s, RBS'"'"'s) in each of the hierarchy levels and, in each of the hierarchy 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 hierarchy level (LEVEL(j−
1), (LEVEL(j)),iteratively repeating the following steps (a) and (b);
(a) for each node (RNC) of the first hierarchy level (LEVEL(j−
1)), identifying an optimized number of, and dispositions of, nodes (HUB'"'"'s) of the second hierarchy level (LEVEL(j)), for those nodes (RBS'"'"'s) of the third hierarchy level (LEVEL(j+1)) which, immediately prior to this iteration of step (a), were allocated to the nodes (HUB'"'"'s) of the second hierarchy level (LEVEL(j)) allocated to the node (RNC) concerned of the first hierarchy level (LEVEL(j−
1)), andfor each said node (RNC) of the first hierarchy level (LEVEL (j−
1)), reallocating said those nodes (RBS'"'"'s) of the third hierarchy level (LEVEL(j+1) to the nodes (HUB'"'"'s) of the second hierarchy level (LEVEL(j)) identified in this iteration of step (a),(b) for the nodes (HUB'"'"'s) of the second hierarchy (LEVEL(j)) identified in step (a), identifying an optimized number of, and dispositions of, the nodes (RNC) of the first hierarchy level (LEVEL(j−
1)), and reallocating the nodes (HUB'"'"'s) of the second hierarchy level (LEVEL(j)) identified instep (a) to the nodes (RNC'"'"'s) of the first hierarchy level (LEVEL(j−
1)) determined in this iteration of step (b),until steps (a) and (b) result in no changes in number, disposition and allocation of said nodes (RNC'"'"'s, HUB'"'"'s, RBS'"'"'s) over a predetermined number of iterations of those steps, wherein said nodes are allocated to provide an optimized number and disposition of the nodes within the network.
4 Assignments
0 Petitions
Accused Products
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.
60 Citations
12 Claims
-
1. A method for optimization of the configuration of a hierarchical network, the network having m hierarchy levels, where m is at least 3, comprising a first hierarchy level (LEVEL(j−
- 1)), a second hierarchy level (LEVEL(j)) next below the first hierarchy level, and a third hierarchy level (LEVEL(j+1)) next below the second hierarchy level, each hierarchy level comprising nodes (RNC'"'"'s, HUB'"'"'s, RBS'"'"'s) each of which, in hierarchy levels other than the lowest, receives traffic from a cluster of nodes (HUB'"'"'s, RBS'"'"'s) of the hierarchy level next below, the method comprising the steps as follows;
setting and/or generating an initial arrangement of nodes (RNC'"'"'s, HUB'"'"'s, RBS'"'"'s) in each of the hierarchy levels and, in each of the hierarchy 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 hierarchy level (LEVEL(j−
1), (LEVEL(j)),iteratively repeating the following steps (a) and (b); (a) for each node (RNC) of the first hierarchy level (LEVEL(j−
1)), identifying an optimized number of, and dispositions of, nodes (HUB'"'"'s) of the second hierarchy level (LEVEL(j)), for those nodes (RBS'"'"'s) of the third hierarchy level (LEVEL(j+1)) which, immediately prior to this iteration of step (a), were allocated to the nodes (HUB'"'"'s) of the second hierarchy level (LEVEL(j)) allocated to the node (RNC) concerned of the first hierarchy level (LEVEL(j−
1)), andfor each said node (RNC) of the first hierarchy level (LEVEL (j−
1)), reallocating said those nodes (RBS'"'"'s) of the third hierarchy level (LEVEL(j+1) to the nodes (HUB'"'"'s) of the second hierarchy level (LEVEL(j)) identified in this iteration of step (a),(b) for the nodes (HUB'"'"'s) of the second hierarchy (LEVEL(j)) identified in step (a), identifying an optimized number of, and dispositions of, the nodes (RNC) of the first hierarchy level (LEVEL(j−
1)), and reallocating the nodes (HUB'"'"'s) of the second hierarchy level (LEVEL(j)) identified instep (a) to the nodes (RNC'"'"'s) of the first hierarchy level (LEVEL(j−
1)) determined in this iteration of step (b),until steps (a) and (b) result in no changes in number, disposition and allocation of said nodes (RNC'"'"'s, HUB'"'"'s, RBS'"'"'s) over a predetermined number of iterations of those steps, wherein said nodes are allocated to provide an optimized number and disposition of the nodes within the network. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
- 1)), a second hierarchy level (LEVEL(j)) next below the first hierarchy level, and a third hierarchy level (LEVEL(j+1)) next below the second hierarchy level, each hierarchy level comprising nodes (RNC'"'"'s, HUB'"'"'s, RBS'"'"'s) each of which, in hierarchy levels other than the lowest, receives traffic from a cluster of nodes (HUB'"'"'s, RBS'"'"'s) of the hierarchy level next below, the method comprising the steps as follows;
-
12. A computer readable medium encoded with a computer program for optimization of the configuration of a hierarchical network, the network having m hierarchy levels, where m is at least 3, comprising a first hierarchy level (LEVEL(j−
- 1)), a second hierarchy level (LEVEL(j)) next below the first hierarchy level, and a third hierarchy level (LEVEL(j+1) next below the second hierarchy level, each hierarchy level comprising nodes (RNC'"'"'s, HUB'"'"'s, RBS'"'"'s) each of which, in hierarchy levels other than the lowest, receives traffic from a cluster of nodes (HUB'"'"'s, RBS'"'"'s) of the hierarchy level next below, said computer program comprising;
code segment for setting and/or generating an initial arrangement of nodes (RNC'"'"'s, HUB'"'"'s, RBS'"'"'s) in each of the hierarchy levels and, in each of the hierarchy 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 hierarchy level (LEVEL(j−
1), (LEVEL(j)),wherein the code segment iteratively repeats the following code segments of (a) and (b); (a) code segment for each node (RNC) of the first hierarchy level (LEVEL(j−
1)), identifying an optimized number of, and dispositions of, nodes (HUB'"'"'s) of the second hierarchy level (LEVEL(j)), for those nodes (RBS'"'"'s) of the third hierarchy level (LEVEL(j+1)) which, immediately prior to this iteration of code segment (a), were allocated to the nodes (HUB'"'"'s) of the second hierarchy level (LEVEL(j)) allocated to the node (RNC) concerned of the first hierarchy level (LEVEL(j−
1)), andfor each said node (RNC) of the first hierarchy level (LEVEL (j−
1)), reallocating said those nodes (RBS'"'"'s) of the third hierarchy level (LEVEL(j+1) to the nodes (HUB'"'"'s) of the second hierarchy level (LEVEL(j)) identified in this iteration of code segment (a),(b) code segment for the nodes (HUB'"'"'s) of the second hierarchy (LEVEL(j)) identified in code segment (a), identifying an optimized number of, and dispositions of, the nodes (RNC) of the first hierarchy level (LEVEL(j−
1)), and reallocating the nodes (HUB'"'"'s) of the second hierarchy level (LEVEL(j)) identified in code segment (a) to the nodes (RNC'"'"'s) of the first hierarchy level (LEVEL(j−
1)) determined in this iteration of code segment (b),until the code segments of (a) and (b) result in no changes in number, disposition and allocation of said nodes (RNC'"'"'s, HUBs, RBS'"'"'s) over a predetermined number of iterations of those code segments, wherein said nodes are allocated to provide an optimized number and disposition of the nodes within the network.
- 1)), a second hierarchy level (LEVEL(j)) next below the first hierarchy level, and a third hierarchy level (LEVEL(j+1) next below the second hierarchy level, each hierarchy level comprising nodes (RNC'"'"'s, HUB'"'"'s, RBS'"'"'s) each of which, in hierarchy levels other than the lowest, receives traffic from a cluster of nodes (HUB'"'"'s, RBS'"'"'s) of the hierarchy level next below, said computer program comprising;
Specification