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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
