检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郝志宇[1] 翟健宏[1] 云晓春[1] 张宏莉[1]
机构地区:[1]哈尔滨工业大学计算机科学与技术学院,黑龙江哈尔滨150001
出 处:《通信学报》2007年第12期19-24,共6页Journal on Communications
基 金:国家重点基础研究发展计划("973"计划)基金资助项目(2005CB321806);国家863-917专项基金资助项目(2004-研4-AA-01)~~
摘 要:网络模拟路由策略的基本目标是真实地反映模拟数据包的转发过程。拓扑变化会影响路由选择结果。现有模拟器在处理动态路由时会让所有节点同时感知到拓扑变化信息,这与实际网络中的情况并不相符。给出并分析动态路由模拟抽象模型,进而提出计算不同节点对拓扑变化感知时间的策略;提出动态MTree_Nix路由策略,以静态路由表和拓扑变化消息序列作为动态路由表,通过比较节点的感知时间查找路由。实验结果表明,此算法能够更真实地模拟网络中的动态路由,并且具有较高的模拟效率。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 will be affected by topology changes. In almost all current simulators, all the nodes know the topology changes instantaneously, which is obviously unrealistic. The model of dynamic routing was presented and analyzed. Further an approach was proposed to compute the time needed for each node to know the topology changes, and dynamic MTree Nix routing mechanism was presented, which maintains static routing table and a message queue of topology changes, and looks up routing states according to the known time of different changes. Experimental results show that our approach can improve the realism of dynamic routing in network simulation, with high simulation efficiency.
分 类 号:TP393.01[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117