首页> 外文期刊>International Journal of Distributed Sensor Networks >Routing Algorithms Based on Partial Deployment of SAVA Nodes in Trustworthy Internet
【24h】

Routing Algorithms Based on Partial Deployment of SAVA Nodes in Trustworthy Internet

机译:可信互联网中基于SAVA节点部分部署的路由算法

获取原文
           

摘要

Although the fundamental principles of best-effort and destination address based packet forwarding in today's Internet have brought tremendous convenience, the trustworthy issue in Internet is a hot problem since the lack of source IP address checking in most cases makes it easy for the attackers to spoof the source address. Therefore, one challenge in trustworthy Internet is to build a feasible mechanism to verify the source address. Recently, a feasible mechanism called Source Address Validation Architecture (SAVA) has been proposed to specify standardization of methods for building effective source-address validation to ensure that packets forwarded hold authentic source addresses. In SAVA mechanism, if a packet has been recognized as a spoofed source address, it will be dropped by the SAVA router and not be transmitted to the next hop. In our work, we study the routing algorithms based on partial deployment of SAVA nodes in Internet and propose three kinds of routing algorithms, i.e., Shortest-Path Algorithm (SPA), SAVA based Shortest-Path Algorithm (SSPA), and SAVA based Shortest-Path Algorithm with Load Balancing (SSPALB). To the best of our best knowledge, this is the first investigation for SAVA mechanism from the point of routing method. In SPA, the packet will be routed on the shortest path that may not traverse the SAVA node, and then the SAVA requirement may not be ensured. In SSPA, the packet will be routed on the shortest path that must traverse one SAVA node such that the SAVA requirement can be ensured. In SSPALB, the packet will be routed on the shortest path that must traverse one SAVA node at the same time this SAVA node must be the least-load such that the SAVA requirement can be ensured and the load can be more balancing. We simulate an incremental traffic model for the three kinds of routing algorithms to compare the performances of SAVA Satisfactory Degree (SSD) and Load Balancing (LB). Simulation results show that:1. ? the SSDs of SSPA and SSPALB can reach 100% while the SSD of SPA is only 20%-30%, which means that SSPA and SSPALB are completely satisfactory for SAVA requirements but SPA cannot;2. ? the LB of SSPALB can reach 100% while the LBs of SPA and SSPA are only 70%-80%, which means that SSPALB is more favorable for the load balancing.
机译:尽管当今Internet上尽力而为和基于目标地址的数据包转发的基本原理带来了极大的便利,但是Internet中的可信赖问题仍然是一个热门问题,因为在大多数情况下缺少源IP地址检查可以使攻击者易于欺骗源地址。因此,可信赖的Internet面临的一个挑战是建立一种可行的机制来验证源地址。最近,已经提出了一种称为“源地址验证体系结构”(SAVA)的可行机制,以指定用于建立有效源地址验证的方法的标准化,以确保转发的数据包保存真实的源地址。在SAVA机制中,如果数据包已被识别为欺骗源地址,则SAVA路由器会将其丢弃,并且不会将其传输到下一跳。在我们的工作中,我们研究了基于SAVA节点在Internet上部分部署的路由算法,并提出了三种路由算法,即最短路径算法(SPA),基于SAVA的最短路径算法(SSPA)和基于SAVA的最短路由算法负载均衡的多路径算法(SSPALB)。据我们所知,这是从路由方法的角度对SAVA机制进行的首次研究。在SPA中,数据包将在可能未穿越SAVA节点的最短路径上进行路由,因此可能无法确保SAVA要求。在SSPA中,数据包将在最短路径上路由,该路径必须经过一个SAVA节点,这样才能确保SAVA要求。在SSPALB中,数据包将在必须经过一个SAVA节点的最短路径上路由,同时此SAVA节点必须是最小负载,从而可以确保SAVA要求,并且负载可以更加平衡。我们针对三种路由算法模拟增量流量模型,以比较SAVA满意程度(SSD)和负载平衡(LB)的性能。仿真结果表明:1。 ? SSPA和SSPALB的SSD可以达到100%,而SPA的SSD仅为20%-30%,这意味着SSPA和SSPALB完全可以满足SAVA的要求,但是SPA不能; 2。 ? SSPALB的LB可以达到100%,而SPA和SSPA的LB仅为70%-80%,这意味着SSPALB更有利于负载均衡。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号