MTree_Nix网络模拟路由计算与查找策略  

MTree_Nix Routing Computation and Lookup Mechanism in Network Simulation

作　　者：郝志宇[1] 云晓春[1] 张宏莉[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院

出　　处：《电子学报》2008年第3期477-481,共5页Acta Electronica Sinica

基　　金：国家973计划资助项目(No.2005CB321806);国家863-917专项(No.2004-研4-AA-01);国家863计划资助项目(No.2007AA010501)

摘　　要：提出并实现了Nix-Vector的改进—MTree_Nix路由策略.MTree_Nix以若干棵最小生成树作为基本路由表,对不能被最小生成树覆盖的路由信息则采用Nix-Vector策略进行实时计算.通过分析MTree_Nix的存储空间和路由查找时间,找到二者之间达到最优平衡的条件.比较实验结果表明,MTree_Nix路由策略模拟时间比Nix-Vector节省85%.Nix-Vector routing mechanism is improved and MTree_Nix routing is presented. MTree_Nix maintains variable number of spanning trees as the base routing table,and uses Nix-Vector routing to compute on demand the routing states that cannot be covered by any of the spanning trees. Through analyzing space and time complexity, we obtain the constraint condition of the optimized trade-off between space and time requirement in MTree Nix. Experimental results show that MTree_Nix can reduce the simulation time for about 85 %.

关 键 词：网络模拟 路由策略 Nix-Vector 最小生成树 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]