Abstract:
Due to growing interest in blockchain technology for secure, auditable, decentralized applications, its challenges must be addressed. This letter discusses the delay caused by Proof-of-Work (PoW) blockchains, which require consensus to append new information to a distributed ledger. We introduce a batch-service queuing theory-based end-to-end latency model that characterizes timers and forks. Analytically estimating the optimal block size. Analytical and simulation results show that the optimal block size approximation is a consistent method that reduces blockchain application overheads and yields close-to-optimal performance.
Note: Please discuss with our team before submitting this abstract to the college. This Abstract or Synopsis varies based on student project requirements.
Did you like this final year project?
To download this project Code with thesis report and project training... Click Here
