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

Authors:
Przemyslaw Ryba;Andrzej Kasprzak
Affiliations:
Chair of Systems and Computer Networks, Wroclaw University of Technology, Wroclaw, Poland;Chair of Systems and Computer Networks, Wroclaw University of Technology, Wroclaw, Poland
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Year:
2006

Citing 3
Cited 2

An Exact Algorithm for Host Allocation, Capacity and Flow Assignment Problem in WAN

WITASI '02 Proceedings of the IFIP TC6/WG6.4 Workshop on Internet Technologies, Applications and Social Impact
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
On the multidensity gateway location problem for a multilevel high speed internetwork

Computer Communications

The Two-Criteria Gateways Location and Topology Assignment Problem in Hierarchical WANs: An Exact Algorithm and Computational Results

ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
An exact algorithm for the minimal cost gateways location, capacity and flow assignment problem in two-level hierarchical wide area networks

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

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.