网络直径 （Network Diameter）：网络中任意两个结点之间的最长距离。它表征了信息在网络中传输时可能经过的链路长度的最大值，因此它是说明网络通信性能的一个...
基于94个网页-相关网页
RP(k) structure takes full advantage of Petersen’s stability and ring’s simplicity, which has short network diameter, simple topology structure and efficient routing policy. Compared with the other topologies, the RP(k)C-Grid system has better stability and higher communication efficiency.2.
由于RP(k)结构充分利用了Petersen的稳定性和环的简单性,具有短的网络直径、简单的拓扑结构及高效的路由策略,基于RP(k)构建的RP(k)C-Grid系统和其它拓扑结构相比具有更好的稳定性和更高的通信效率。
参考来源 - Internet环境下的资源管理模型及算法研究·2,447,543篇论文数据，部分数据来源于NoteExpress
The results show that the change of network diameter, average path length are negative correlation with that of the network clustering coefficient.
且生成网络直径、平均路径长度与网络平均聚类系数呈负相关关系。
The running time of the algorithm is linear. Simulation results show that the time steps of the algorithm are very close to the network diameter in practice.
该算法的时间复杂性是线性的，模拟结果表明多播路由算法的多播时间步接近网络的直径。
The results show that the change of network diameter, average path length and degree correlation are negative correlation with that of the network clustering coefficient.
且生成网络直径、平均路径长度、度关联系数与网络平均聚类系数呈负相关。
应用推荐