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

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:
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Year:
2007

Citing 5
Cited 0

Resource allocation and capacity assignment in distributed systems

Computers and Operations Research
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
Unsplittable anycast flow problem: formulation and algorithms

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
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
Research: Combined channel allocation and routing algorithms in packet switched networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper deals with the problem of simultaneously assignment of servers replica location, topology, channel capacities and flow routes in the wide area network. Two important cost constraints have been considered during the optimization process: server cost constraint and capacity cost (supporting cost of the network) constraint. In the paper an approximate algorithm for this widespread problem is proposed. Some computational experiments are reported in order to present the quality of the approximate solutions and to show some properties of the considered problem.