Adjacency rotation

To decide which existing adjacencies are good ones and which ones are not needed,
handover statistics are collected for the existing adjacencies. Furthermore, in RAN, the
concept of knowing beforehand which adjacencies are missing does not exist yet and
therefore handover statistics are used for finding new good adjacencies. Candidate
adjacencies need to be provisioned to the network before handover statistics can be collected
for them. For this reason, Optimizer can make rotation plans for testing adjacencies
in the network. Each rotation plan can be visualized and modified. Furthermore, the
final list can also be visualized and modified.
Rotating adjacencies and creating the final list
WCDMA adjacency optimization consists of the following phases:
• Selecting a list of existing adjacencies that are good enough and are not deleted
(basic list, BL)
• Creating a list of potentially good adjacencies (candidate pool, P)
• Measuring their performance in live network
• Selecting the best adjacencies to be kept in the network
You can control the rotation process, that is, the number of rotation rounds and the
amount of adjacency candidates in each rotation round. In addition, the maximum
number of adjacency candidates can be controlled. Note that Optimizer may not create
candidates if the adjacency lists are already full or if the maximum numbers are
exceeded.