The gateways location and topology assignment problem in hierarchical wide area networks: algorithms and computational results

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:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Year:
2006

Citing 4
Cited 3

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
A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks

Computational Optimization and Applications
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
A new function for optimization of working paths in survivable MPLS networks

ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the problem of designing two-level hierarchical structure wide area network. The goal is to select gateways location, 2nd level network topology, channels capacities and flow routes in order to minimize the total average delay per packet in hierarchical network subject to budget constraint. The problem is NP-complete. Then, the branch and bound method is used to construct the exact algorithm. Also a heuristic algorithm is proposed. Some computational results are reported. Based on computational experiments, several properties of the considered problem, important from practical point of view, are formulated.