ASSIGNMENT MODIFICATION IN THE DESIGN OF MULTIPOINT COMMUNICATION NETWORKS
Jozef Petrek - Alexander Speetzen
A typical way to design a hierarchical communication network is first to solve the concentrator quantity problem, the
concentrator location problem and the assignment problem. Afterwards the concentrator layout problem is solved and the designed star
topology is converted into a tree topology. This problem is often mentioned in literature but without considering the advantage of
modifying the existent assignment. In this paper a heuristic algorithm that solves this problem and finds a low cost multipoint solution
using few CPU time is proposed.
Keywords: multipoint, tree topology, heuristic, algorithm, assignment problem, terminal layout problem, hierarchical network planning