An approximate algorithm for the minimal cost gateways location, capacity and flow assignment in two-level hierarchical wide area networks

Abstract

In the paper the problem of designing two-level hierarchical structure of wide area network is considered. The goal is to select gateways location, channel capacities and flow routes in order to minimize total cost of leasing capacities of channels of 2nd level network, subject to delay constraint. An approximate algorithm is proposed. Some results following from computational experiment are reported. © Springer-Verlag Berlin Heidelberg 2006.