The two-criteria topological design problem in WAN with delay constraint: an algorithm and computational results

Authors:
Mariusz Gola;Andrzej Kasprzak
Affiliations:
Technical University of Opole, Department of Electrical Engineering and Automatic Control, Opole, Poland;Wroclaw University of Technology, Wroclaw, Poland
Venue:
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Year:
2003

Citing 1
Cited 1

A system for the design of packet-switched communication networks with economic tradeoffs

Computer Communications

Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem is concerned with designing of wide area networks (WAN). The problem consists in selection of flow routes, channel capacities and wide area network topology in order to minimize the total average delay per packet and the leasing cost of channels subject to delay constraint. The problem is NP complete. Then, the branch and bound method is used to construct the exact algorithm. Lower bound of the criterion function is proposed. Computational results are reported. Based on computational experiments, several properties of the considered problem are formulated.