Exact and approximate algorithms for topological design of wide area networks with non-simultaneous single commodity flows

Authors:
Andrzej Kasprzak
Affiliations:
Wroclaw University of Technology, Chair of Systems and Computer Networks, Wroclaw, Poland
Venue:
ICCS'03 Proceedings of the 2003 international conference on Computational science
Year:
2003

Citing 1
Cited 2

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

Computer Communications

The web replica allocation and topology assignment problem in wide area networks: algorithms and computational results

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Evolutionary algorithm for congestion problem in connection-oriented networks

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem is concerned with designing of wide area computer networks. This problem is very important from practical point of view because the network, when designed efficiently, can and does become the lifeblood of a business organization. The problem consists in selection of the nonsimultaneous single commodity flow routes, channel capacities and the wide area network topology in order to maximize the value of the min-max flow subject to the budget constraint. The problem is NP-complete. Then, the branch and bound method is used to construct the exact algorithm. Several properties of the problem are formulated and proved. Computational results are reported.