Cost-Minimizing Algorithm for Replica Allocation and Topology Assignment Problem in WAN

Authors:
Marcin Markowski;Andrzej Kasprzak
Affiliations:
Chair of Systems and Computer Networks, Wroclaw University of Technology, Wroclaw, Poland 50-370;Chair of Systems and Computer Networks, Wroclaw University of Technology, Wroclaw, Poland 50-370
Venue:
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Year:
2008

Citing 5
Cited 0

Resource allocation and capacity assignment in distributed systems

Computers and Operations Research
Topological optimization with a network reliability constraint

Discrete Applied Mathematics - Special issue on selected papers from First Japanese-Hungarian Symposium for Discrete Mathematics and its Applications
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer 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 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

The paper deals with the problem of simultaneously assignment of network topology and server's replica placement in the wide area network in order to minimize the criterion composed of the leasing capacity cost and the building cost of the network. An exact algorithm, based on the branch and bound method, is proposed to solve the problem. Algorithm takes into account the problem of ensuring the reliability of the network. Some interesting features, observed during the computational experiments are reported.