An Exact Algorithm for the Servers Allocation, Capacity and Flow Assignment Problem with Cost Criterion and Delay Constraint in Wide Area Networks

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

Citing 6
Cited 1

Resource allocation and capacity assignment in distributed systems

Computers and Operations Research
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
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 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
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

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper deals with the problem of simultaneously assignment of server's allocation, channel capacities and flow routes 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. Some interesting features, observed during the computational experiments are reported.