Author:
Chunduri Venkata,Raparthi Mohan,Yellu Ramswaroop Reddy,Keshta Ismail,Byeon Haewon,Soni Mukesh,Bhatt Mohammed Wasim
Abstract
AbstractA large number of nodes, and significant system overhead are among the challenges. To tackle these problems, a new PBFT technique known as trace-PBFT (t-PBFT) is being contemplated for adoption in the food supply chain. The PBFT algorithm, short for Practical Byzantine Fault Tolerance, serves as the fundamental algorithm. The linkages throughout the supply chain may be categorized into three primary groups. As a response to the continuing discussion over the amount of data, the status of each node is continuously updated in real time. This metric is utilized to evaluate the dependability of the principal node and to analyze the overall performance of the nodes. To minimize the amount of data transmitted between nodes, we optimized the consensus process of the first algorithm. The distinct attributes of offering collaborative food technology were considered throughout this procedure. Experimental evidence indicates that the t-PBFT approach outperforms the PBFT algorithm in terms of throughput, request delay, and information overhead. An architectural paradigm is proposed by integrating the t-PBFT algorithm with a federated network. This model was developed in response to the distinct demands of the food supply chain. This model effectively captures data at each stage of the food supply chain to ensure information tracking while preserving the safety of the food technology flow process.
Publisher
Springer Science and Business Media LLC