QoS-Aware and Fault-Tolerant Replica Placement

Document Type

Conference Proceeding

Publication Date

1-1-2020

Abstract

As emerging applications become more and more distributed and decentralized, it has become a more challenging problem to design and build fault-tolerant network systems with high Quality of Service (QoS) guarantee. In this paper, an optimal replica placement problem is formulated in terms of minimizing the replica placement cost subject to both QoS and fault-tolerant constraints. Based on the generalized graph model, the optimal replica placement problem is proved to be NP-hard. The essential properties of the proposed problem are investigated and two criteria, which can quantitatively measure the replica demand of each node and the contribution of one replica to other nodes in the graph, are proposed. The criteria are employed to develop efficient heuristic algorithms. Finally the proposed algorithms are evaluated with extensive network configurations and the experimental results show that the proposed heuristic algorithms can generate solutions very close to the optimal results.

Identifier

85092719460 (Scopus)

ISBN

[9783030602383]

Publication Title

Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

External Full Text Location

https://doi.org/10.1007/978-3-030-60239-0_11

e-ISSN

16113349

ISSN

03029743

First Page

157

Last Page

172

Volume

12453 LNCS

This document is currently not available here.

Share

COinS