An approximate algorithm for three-criteria replica allocation problem in WAN

  • Authors:
  • Marcin Markowski;Andrzej Kasprzak

  • Affiliations:
  • Wroclaw University of Technology, Wroclaw, Poland;Wroclaw University of Technology, Wroclaw, Poland

  • Venue:
  • PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Designing of wide area networks comprises two important tasks: resource allocation and topology assignment. Most significant type of resources are servers. The proper allocation of servers has a critical meaning on the quality of the network. Since amount of data stored on servers increases fast, the servers are often replicated. The problem of replicas allocation is more general and more complicated than servers' allocation problem, but it matters strongly. The network topology and the capacities of channels have an impact on the cost of the network. In the paper the new approximate algorithm for solving replicas allocation, topology, capacity and flow assignment problem is presented. Three important indicators of network efficiency and two different kinds of costs are taken as optimization criterion. Some computational experiments are reported.