0000000000470643
AUTHOR
Andrzej Kasprzak
showing 2 related works from this author
Exact and Approximate Algorithms for Two–Criteria Topological Design Problem of WAN with Budget and Delay Constraints
2004
This paper studies the problem of designing wide area networks (WAN). In the paper the two-criteria topology assignment problem with two constraints is considered. The goal is select flow routes, channel capacities and network topology in order to minimize the total average delay per packet and the leasing cost of channels subject to the budget constraint and delay constraint. The problem is NP-complete. Then, the branch and bound method is used to construct the exact algorithm. Also the approximate algorithm is presented. Some computational results are reported. Based on computational experiments, several properties of the considered problem are formulated.
The Two-Criteria Topological Design Problem in WAN with Delay Constraint: An Algorithm and Computational Results
2003
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.