【24h】

Simulating Realistic Packet Routing without Routing Protocols

机译:在没有路由协议的情况下模拟现实的数据包路由

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decisions at each hop along the path should accurately represent decisions made by actual routers with a similar topology. Further, the routing decisions must be affected by topology changes, such as link weight adjustments or node failures. The methods used by the simulation tools to achieve these requirements can be classified into three fundamental classes. First, the simulator can implement a model of any of the well known routing protocols, such as BGP, OSPF, or EIGRP. Assuming the implemented models of these protocols are a reasonable representation of the deployed protocol, the routing decisions and routing updates in the presence of failures will highly accurate and will accurately model the real-world network. A second method is to use global topology knowledge within the simulator to pre-compute routing information using any of several graph theoretic algorithms that compute paths through a graph. Should any topology changes occur, the simulator can simply re-compute routes based on revised global knowledge. A third method is the use of on-demand routing computations using global topology knowledge, coupled with a source-based routing scheme, such as the well-know NIx-Vector method. Both of the first two methods suffer from excessive memory requirements for routing table storage, which can be 0(N�) in the extreme case.The last two methods suffer from unrealistic routing decisions in the presence of topology changes, due to the use of instantaneous global topology knowledge. A link failure in some part of the topology is immediately known to all nodes, which results in instantaneous and unrealistic routing updates throughout the network. We present an approach toimprove the realism of the on-demand methods, without incurring the 0(N�) memory overhead of the routing protocol method.
机译:任何网络仿真环境的基本要求是在仿真拓扑中实际将数据包从源转发到目的地。沿路径的每个跃点处的路由决策应准确表示具有类似拓扑结构的实际路由器所做的决策。此外,路由决策必须受拓扑更改(例如链路权重调整或节点故障)影响。仿真工具用来满足这些要求的方法可以分为三个基本类别。首先,模拟器可以实现任何众所周知的路由协议(例如BGP,OSPF或EIGRP)的模型。假设这些协议的已实现模型是已部署协议的合理表示,那么在存在故障的情况下,路由决策和路由更新将非常准确,并将对真实世界的网络进行准确建模。第二种方法是使用仿真器中的全局拓扑知识,通过几种计算通过图形的路径的图形理论算法中的任何一种来预先计算路由信息。如果发生任何拓扑变化,模拟器可以根据修订后的全局知识简单地重新计算路由。第三种方法是使用按需路由计算,该计算使用了全局拓扑知识,并结合了基于源的路由方案,例如众所周知的NIx-Vector方法。前两种方法都对路由表存储有过多的内存需求,在极端情况下可能为0(N。)。后两种方法由于存在拓扑更改而存在不切实际的路由决策,这是由于使用了瞬时全局拓扑知识。所有节点都立即知道拓扑结构中某些部分的链路故障,这会导致整个网络的瞬时和不现实的路由更新。我们提出一种改善按需方法的真实性的方法,而不会产生路由协议方法的0(N。)内存开销。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号