Cost-minimizing algorithm for replica allocation and topology assignment problem in WAN

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Markowski, M., & Kasprzak, A. (2008). Cost-minimizing algorithm for replica allocation and topology assignment problem in WAN. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5101 LNCS, pp. 549–558). https://doi.org/10.1007/978-3-540-69384-0_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free