检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李勇军[1] 蔡皖东[1] 王伟[1] 田广利[1]
机构地区:[1]西北工业大学计算机学院
出 处:《通信学报》2007年第10期85-91,共7页Journal on Communications
摘 要:在分析现有网络拓扑推测算法的基础上,提出了一种基于端到端报文丢失性能的网络拓扑推测方法,该方法通过比较节点间的Hamming距离和节点接收到的报文数量推测网络拓扑,在推测拓扑过程中不需要网络内部节点的协助。通过理论比较和分析,证明该方法在推测精度上比现有的方法有显著的提高,最后利用仿真实验验证了该方法的有效性和准确性,推测精度比现有方法提高了20%。Based on the analysis of existing network topology identification algorithms, an improved network topology identification method based on end-to-end loss performance was proposed. The proposed algorithm identified network topology using Hamming distance of the sibling nodes and inferred number of received probe packets at sibling nodes. The proposed algorithm required no support from internal nodes. The theoretic analysis and comparison shown that the improved algorithm can significantly improve the inference accuracy. To validate its accuracy and efficiency, the proposed algorithm was implemented in a simulated network. The simulation result shown that the inference accuracy is improved more than 20%.
分 类 号:TP393.07[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249