等价多径路由的哈希门限算法的模拟和分析(英文)  

A Simulation and Analysis of the Hash-threshold Algorithm Used for Equal-Cost Multipath Routing

作　　者：王肖虹[1] 

机构地区：[1]宁波大学信息科学与工程学院,浙江宁波315211

出　　处：《宁波大学学报（理工版）》2003年第2期157-160,共4页Journal of Ningbo University：Natural Science and Engineering Edition

摘　　要：实现和分析了在RFC2992中提出的用于等价多径(ECMP)路由技术的哈希门限(hash-threshold)算法。编制了模拟实现OSPF协议的程序以支持该算法。为分析算法性能,编制了辅助程序计算哈希门限算法和模N算法的流量分裂度,并推导了它们的计算复杂度。The hash-threshold algorithm for the Equal-Cost Multipath(ECMP) routing proposed by RFC 2992 is implemented and analyzed. For supporting the hash-threshold algorithm, a program is also created that simulates the Open Shortest Path First(OSPF) routing. For evaluating the performance of the hash-threshold, its computation complexity and disruption is calculated and compared with that of the module- N algorithm.

关 键 词：等价多径 0SPF 性能分析 哈希门限 

分 类 号：TP393.01[自动化与计算机技术—计算机应用技术]