The web replica allocation and topology assignment problem in wide area networks: algorithms and computational results

Authors:
Marcin Markowski;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'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2005

Citing 2
Cited 14

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
Exact and approximate algorithms for topological design of wide area networks with non-simultaneous single commodity flows

ICCS'03 Proceedings of the 2003 international conference on Computational science

An approximate algorithm for the servers replication problem with two cost constraints in WAN

PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
An Exact Algorithm for the Servers Allocation, Capacity and Flow Assignment Problem with Cost Criterion and Delay Constraint in Wide Area Networks

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
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 approximate algorithm for three-criteria replica allocation problem in WAN

PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
Branch-and-bound algorithm for anycast flow assignment in connection-oriented networks

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
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
A unified approach to survivability of connection-oriented networks

ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
New algorithms for the unsplittable flow problem

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

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Unsplittable anycast flow problem: formulation and algorithms

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Lagrangean heuristic for anycast flow assignment in connection-oriented networks

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
The gateways location and topology assignment problem in hierarchical wide area networks: algorithms and computational results

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
The three-criteria servers replication and topology assignment problem in wide area networks

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the problem of designing wide area networks. In the paper the web replica allocation and topology assignment problem with budget constraint is considered. The goal is select web replica allocation at nodes, network topology, channel capacities and flow routes in order to minimize average delay per packet and web replica connecting cost at nodes subject to budget constraint. The problem is NP-complete. Then, the branch and bound method is used to construct the exact algorithm. Also an approximate algorithm is presented. Some computational results are reported. Based on computational experiments, several properties of the considered problem are formulated.