6533b820fe1ef96bd127a29f

RESEARCH PRODUCT

Exact and Approximate Algorithms for Two–Criteria Topological Design Problem of WAN with Budget and Delay Constraints

Andrzej KasprzakMariusz Gola

subject

Constraint (information theory)Mathematical optimizationExact algorithmConstraint satisfaction dual problemTopology (electrical circuits)TopologyNetwork topologyAssignment problemAlgorithmBudget constraintMathematicsCommunication channel

description

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.

yearjournalcountryeditionlanguage
2004-01-01
https://doi.org/10.1007/978-3-540-24767-8_64