Back

G-2001-17

Heuristic Method for Discrete Capacity Tree Access Network Design

, , and

BibTeX reference

This paper solves the problem of designing an access tree network for which the users are connected to the switches through SONET channels on fiber optics links and ADM equipment at the nodes. The economies of scale provided by the SONET hierarchy are specifically taken into account. A fast tabu search method is proposed and its details are thoroughly discussed. Results are provided for a set of random cases as well as for a real network.

, 17 pages

Research Axis

Research application

Document

G0117.ps (300 KB)