6533b821fe1ef96bd127acda
RESEARCH PRODUCT
The Two-Criteria Topological Design Problem in WAN with Delay Constraint: An Algorithm and Computational Results
Mariusz GolaAndrzej Kasprzaksubject
Constraint (information theory)Mathematical optimizationExact algorithmFlow (mathematics)Network packetWide area networkTopology (electrical circuits)TopologyUpper and lower boundsAlgorithmCommunication channelMathematicsdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2003-01-01 |