The document presents a study on QoS-aware data replication for data-intensive applications in cloud computing, proposing two algorithms to improve data replication costs and minimize QoS violations. The first algorithm is a greedy method, while the second transforms the problem into a minimum-cost maximum-flow format for optimal solutions in polynomial time, although with greater computational demand. The proposal includes techniques to reduce data replication time while ensuring data availability and aligning with application QoS requirements.