FlexRout: Dynamic Routing in Blockchain Networks

IF 7.9 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY IEEE Transactions on Network Science and Engineering Pub Date : 2024-12-25 DOI:10.1109/TNSE.2024.3519802
Souradeep Das;Riya Tapwal;Sudip Misra
{"title":"FlexRout: Dynamic Routing in Blockchain Networks","authors":"Souradeep Das;Riya Tapwal;Sudip Misra","doi":"10.1109/TNSE.2024.3519802","DOIUrl":null,"url":null,"abstract":"Blockchain is highly dependent on network topology and routing paths for efficient operation. The speed and effectiveness of mining are impacted by network topology, as a well-defined routing path improves the speed of mining by the faster exchange of data for verification. However, high traffic on the path, caused by the exchange of messages among the miners leads to delays in the routing path and lengthens the time needed for mining data. Moreover, the dynamic addition and termination of miners from the network affect the topology, further contributing to delays in the mining process and transactions. To address these challenges, we present a novel system called <italic>FlexRout</i> that dynamically predicts the optimal routing path to increase the speed of the mining process. It firstly predicts miners (nodes) who can leave mining by checking their resource availability. Simultaneously, it also grants a reward or a penalty depending upon the right or wrong prediction made respectively. Experimental results demonstrate that <italic>FlexRout</i> can significantly reduce traffic by almost 49% and latency by 50%.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 2","pages":"838-847"},"PeriodicalIF":7.9000,"publicationDate":"2024-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10816437/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Blockchain is highly dependent on network topology and routing paths for efficient operation. The speed and effectiveness of mining are impacted by network topology, as a well-defined routing path improves the speed of mining by the faster exchange of data for verification. However, high traffic on the path, caused by the exchange of messages among the miners leads to delays in the routing path and lengthens the time needed for mining data. Moreover, the dynamic addition and termination of miners from the network affect the topology, further contributing to delays in the mining process and transactions. To address these challenges, we present a novel system called FlexRout that dynamically predicts the optimal routing path to increase the speed of the mining process. It firstly predicts miners (nodes) who can leave mining by checking their resource availability. Simultaneously, it also grants a reward or a penalty depending upon the right or wrong prediction made respectively. Experimental results demonstrate that FlexRout can significantly reduce traffic by almost 49% and latency by 50%.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
flexroute:区块链网络中的动态路由
区块链高度依赖于网络拓扑和路由路径,以实现高效运行。挖掘的速度和有效性受到网络拓扑结构的影响,因为定义良好的路由路径通过更快地交换用于验证的数据来提高挖掘的速度。然而,由于矿工之间的消息交换导致路径上的高流量导致路由路径延迟,并延长了挖掘数据所需的时间。此外,网络中矿工的动态加入和终止会影响拓扑结构,进一步导致挖掘过程和交易的延迟。为了应对这些挑战,我们提出了一个名为flexroute的新系统,该系统可以动态预测最佳路由路径,以提高挖矿过程的速度。它首先通过检查资源可用性来预测哪些矿工(节点)可以离开挖矿。同时,它还根据预测的正确或错误分别给予奖励或惩罚。实验结果表明,flexroute可以显著减少49%的流量和50%的延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Network Science and Engineering
IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering
CiteScore
12.60
自引率
9.10%
发文量
393
期刊介绍: The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.
期刊最新文献
Distance-Aware Hypergraph and Attention Network With Unimodal Assistance for Multimodal Sentiment Analysis Enhancing Intrusion Detection via Interpretable Inter-Flow Spatio-Temporal Graphs and Intra-Flow Features FLSC-CI: Federated Learning and Semantic Communication Empowered Multimodal Terminal Collaborative Inferencing Framework for IoT Businesses Underwater Target Tracking Based on Acoustic-Optical Fusion for Multi-AUV Systems A Graph Neural Network-Based Approach for Critical Node Detection in Dynamic Satellite Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1