Blockchain technology has attracted significant attention primarily due to its potential with respect to achieving trustworthy decentralized architecture through features such as peer-to-peer networks, public ledger management, and an auditable data structure of its transactions. The applications of blockchain are not limited to cryptocurrency but have influenced wider domains through selfaccountability, auditability, and transparency. However, blockchain technology has experienced serious challenges, which exposed its limitations to mitigate against undesired circumstances such as the demand for highly scalable solutions. Although there has been a comparative analysis of consensus algorithms and their impacts on scalability, but there have only been comparisons without any detailed empirical investigations and are just based upon the theoretical data shared in the white papers of various blockchain platforms. We have used an empirical analysis-based approach to evaluate the impact of two mostly used consensus algorithms when the system is loaded with the bulk of transactions. This has been achieved by incorporating Proof of Work (PoW) and round robin-based consensus algorithms using separate blockchain networks. The purpose was obvious to investigate and help future research propose more scalable solutions for blockchain systems along with their direct impact on a consensus mechanism. Our experimental investigations have shown that although round robin-based consensus has shown a higher rate of mining transactions into the main consensus blockchain, but at the same time PoW may become a preferred choice in public blockchain networks due to its incentives-based approach in most of the blockchain systems.