首页> 外文期刊>Journal of Parallel and Distributed Computing >A novel routing verification approach based on blockchain for inter-domain routing in smart metropolitan area networks
【24h】

A novel routing verification approach based on blockchain for inter-domain routing in smart metropolitan area networks

机译:基于智能大都市区域网络域间路线区块链条的新型路由验证方法

获取原文
获取原文并翻译 | 示例
           

摘要

In recent years, with the continuous expansion of metropolitan area networks, the routing security problem has become more and more serious. In particular, promise-violating attack to inter-domain routing protocol is one of the most difficult attacks to defend, which always leads to serious consequences, such as maliciously attracting traffic and disrupting the network. To deal with such attack, current research generally adopts routing verification. However, it can only detect attacks violating a specific routing policy triggered by one malicious node, and no research has yet solved the problem caused by multiple collusion nodes. In this paper, we propose BRVM, a blockchain-based routing verification model, to address the issue that violating the shortest AS Path policy. The main idea of BRVM is to construct a route proof chain to verify whether a route violates the policy with the help of the blockchain technology. The precondition that avoiding the collusion attack is that the proportion of the malicious verification nodes is lower than the fault tolerance rate of the consensus algorithm. Then, we prove the correctness of BRVM in theory, and implement a prototype based on Quagga and Hyperledger Fabric. Some experiments on this prototype show that BRVM can indeed solve the promise-violating problem caused by multiple collusion nodes, and about 15.5% faster in performance compared with SPIDeR.
机译:近年来,随着大都市领域的持续扩张,路由安全问题变得越来越严重。特别是,对域间路由协议的承诺攻击是捍卫最困难的攻击之一,这总能导致严重后果,例如恶意吸引流量并扰乱网络。要处理此类攻击,目前的研究通常采用路由验证。但是,它只能检测到违反由一个恶意节点触发的特定路由策略的攻击,并且没有解决了多个勾结节点引起的问题。在本文中,我们提出了BRVM,基于区块链的路由验证模型,以解决违反最短作为路径策略的问题。 BRVM的主要思想是构建路线证明链,以验证路线是否违反了策略的帮助。避免勾结攻击的前提是恶意验证节点的比例低于共识算法的容错率。然后,我们在理论上证明BRVM的正确性,并基于Quagga和超涉及的结构来实现原型。关于该原型的一些实验表明,BRVM可以确实可以解决由多种勾结节点引起的承诺违规问题,与蜘蛛相比,性能速度快约15.5%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号