The three-criteria servers replication and topology assignment problem in wide area networks

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

Citing 5
Cited 3

Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
QoS dynamic routing in content delivery networks

NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
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
Topology-informed Internet replica placement

Computer Communications

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
Cost-Minimizing Algorithm for Replica Allocation and Topology Assignment Problem in WAN

ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The designing of wide area networks is usually an optimization process with accurately selected optimization criterion. The most utilized criterions are the quality of service in the network (indicated by average packet delay), the capacity cost (channel capacity leasing cost) and server costs (cost of connecting servers or replicas at nodes). This paper studies the problem of designing wide area networks with taking into account those three criteria. Then, the goal is select servers replica allocation at nodes, network topology, channel capacities and flow routes in order to minimize the linear combination of average delay per packet, capacity cost and server cost. The problem is NP-complete. An exact algorithm, based on the branch and bound method is proposed. Some computational results are reported and several properties of the considered problem are formulated.