EIGRP中DUAL算法路由查询优化的研究

Research on DUAL rquery optimization in EIGRP

EIGRP是一个高级距离矢量路由协议,支持中到大型网络,属于基于传闻协议在一组网络运行EIGRP中路由器之间路由更新机制,是依靠扩散更新DUAL算法进行触发路由更新。但是,这种算法在某些网络结构中,会出现发送大量查询路由报文、浪费网络设备CUP和内存资源、消耗大量网络链路带宽等问题。文章提出了两种方法来减少扩散更新DUAL算法中查询路由,对今后网络运行EIGPR动态选择路由协议,提供了一些参考价值。

EIGRP is an advanced distance vector routing protocol,a gossip-based protocol.It supports medium-scale and large-scale networks.The routing update mechanism between routers of EIGRP in one group of network operation depends on DUAL to trigger the routing update.However,in some network architectures,such algorithm will send lots of query routing messages,waste the CUP and memory of network devices,consume a large amount of network link bandwidths.Therefore,two methods are proposed to reduce the DUAL query routing,to provide reference for the dynamic selection of routing protocols of EIGPR in network operation in the future.