Blockchain Network Waiting Time Traffic Distribution Based on Priority

Blockchain (Bchain) technology has a wide range of applications across various fields. We can easily use Bchain in healthcare, and the number of transactions in healthcare is very high. In healthcare, there are several entities that can affect the process, from emergencies to normal OPD handling, so the Bchain throughput must be very low in healthcare. As per the distributed nature of Bchain, the waiting time (WT) for transactions should be minimal, and we divide the traffic into two categories, i.e., high priority (Hp) and low priority (Lp). We propose a method for distributing the WT using the Pollaczek-Khintchine equation. The study highlights the impact of transaction arrival rates and priority-based processing on Bchain congestion, showing that high-fee transactions experience significantly lower waiting times while low-fee transactions face delays. It underscores the importance of optimizing gas fees for faster confirmation and suggests that scalability solutions like adaptive block sizes and Layer 2 rollups are essential for reducing congestion. Additionally, the findings provide valuable insights for Bchain developers and policymakers to improve transaction prioritization mechanisms, optimize mining incentives, and refine protocol upgrades like Ethereum's EIP-1559 to enhance overall network efficiency. The results show that the allocation of Hp traffic remains unaffected by Lp traffic, whereas Lp traffic is dependent on Hp traffic.