Ashwini Bhoware, K. Jajulwar, S. Ghodmare, K. Dabhekar, Vaibhav Bartakke
{"title":"Performance Analysis of Network Management System using Bioinspired -Blockchain Techniquefor IP Networks","authors":"Ashwini Bhoware, K. Jajulwar, S. Ghodmare, K. Dabhekar, Vaibhav Bartakke","doi":"10.1109/ICSMDI57622.2023.00045","DOIUrl":null,"url":null,"abstract":"To mine a blockchain on IP Networks, one must do several tasks related to chain management, rule optimization, verification, and hash generation design. Various consensus model subsets may benefit from the various blockchain mining techniques proposed by researchers. Most of these techniques, however, are rather complicated, which slows down the mining process for large-scale blockchains. Overly simplistic models that include unnecessary redundancies are inefficient and have little practical use. To solve these issues and boost blockchain mining efficiency in large-scale deployments, the authors of this paper propose creating a novel hybrid bioinspired approach. The proposed IP Network model is adaptable to almost all consensus procedures and may be easily combined with dynamic consensus models with few alterations. After collecting performance and context-specific data from the underlying blockchains, the technique uses Genetic Algorithm (GA) that distributes these range sets among miner nodes that support trust, allowing for high-performance mining while maintaining a high degree of trust under actual application situations. The model was tested against Proof-of-Stake (PoS), Proof-of- Work (PoW), Proof-of- Trust (PoT), and Practical Byzantine Fault Tolerance (PBFT) based consensus algorithms to ensure its effectiveness in real-world scenarios. Mining latency, energy consumption, and computational complexity were used as metrics against which this performance was measured. This analysis revealed that the proposed model has the potential to decrease mining latency by 4.5%, energy usage by 3.9%, and compute complexity by 4.1% across a variety of consensus mechanisms, making it suitable for a number of real-time applications.","PeriodicalId":373017,"journal":{"name":"2023 3rd International Conference on Smart Data Intelligence (ICSMDI)","volume":"348 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 3rd International Conference on Smart Data Intelligence (ICSMDI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSMDI57622.2023.00045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
To mine a blockchain on IP Networks, one must do several tasks related to chain management, rule optimization, verification, and hash generation design. Various consensus model subsets may benefit from the various blockchain mining techniques proposed by researchers. Most of these techniques, however, are rather complicated, which slows down the mining process for large-scale blockchains. Overly simplistic models that include unnecessary redundancies are inefficient and have little practical use. To solve these issues and boost blockchain mining efficiency in large-scale deployments, the authors of this paper propose creating a novel hybrid bioinspired approach. The proposed IP Network model is adaptable to almost all consensus procedures and may be easily combined with dynamic consensus models with few alterations. After collecting performance and context-specific data from the underlying blockchains, the technique uses Genetic Algorithm (GA) that distributes these range sets among miner nodes that support trust, allowing for high-performance mining while maintaining a high degree of trust under actual application situations. The model was tested against Proof-of-Stake (PoS), Proof-of- Work (PoW), Proof-of- Trust (PoT), and Practical Byzantine Fault Tolerance (PBFT) based consensus algorithms to ensure its effectiveness in real-world scenarios. Mining latency, energy consumption, and computational complexity were used as metrics against which this performance was measured. This analysis revealed that the proposed model has the potential to decrease mining latency by 4.5%, energy usage by 3.9%, and compute complexity by 4.1% across a variety of consensus mechanisms, making it suitable for a number of real-time applications.