In recent years, we have evidenced an extensive effort in the development of computer communication networks, especially in the LAN (Local Area Networks).
One of the important aspects in the design of LAN is to solve the topological design problems involved in establishing and/or expanding a LAN, based on one or more subnetworks installed before.
In this paper, a multi-period expansion model for the LAN with the BUS/TREE topology is developed and analysed. The LAN topology considered has a hierarchical structure, containing a higher-level network and two or more lower-level networks.
The model presented here uses two-step heuristic approach. The first step heuristic (LP-MST Algorithm) solves the problems of cable layout between the central computer and the terminal devices scattered on each partitioned area. And the second step heuristic (DL-MST Algorithm) solves the problem of cable layout among all central computers located in the several partitioned areas where the LAN is to be installed.
