In the era of rapidly growing cloud computing services, efficient data replication strategies are crucial for enhancing system performance, reliability and resource optimization. This research paper highlights concept of scalability, with a particular focus on Popularity Based Replica Placement, as a technique to strengthen scalability. The study compares the Traditional Popularity-Based Replica Placement (PBRP) algorithm with an Optimized PBRP approach. The proposed algorithm improves scalability in cloud computing by dynamically placing the replicas based on their data access patterns. The proposed approach mainly focuses on file popularity and adaptive threshold to ensure replicas are distributed optimally across multiple datacenters. The performance comparison is done to analyze execution time, storage utilization and data availability. For Simulation results we have used CloudSim to demonstrate that optimized PBRP improves load balancing, reduces latency, and optimizes storage usage. This makes PBRA a promising solution for scalable cloud storage systems. The findings are evidence that optimized PBRA is an effective solution for scalable cloud environments as it offers reliability and operational efficiency.