Short path first overlay building

WU Guo-fu; HAN Gang; DOU Wen-hua

您当前的位置：

首页 >

文章列表页 >

Short path first overlay building

更新时间：2024-10-14

- Short path first overlay building
- Vol. 31, Issue 10, Pages: 170-179(2010)
- 作者机构：
  
  国防科技大学计算机学院
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP393.02
- Published：2010
- 稿件说明：
移动端阅览
WU Guo-fu, HAN Gang, DOU Wen-hua. Short path first overlay building[J]. 2010, 31(10): 170-179.
DOI：

WU Guo-fu, HAN Gang, DOU Wen-hua. Short path first overlay building[J]. 2010, 31(10): 170-179. DOI：

摘要

提出了短路径优先策略构造拓扑匹配的覆盖网络。为了快速获取短距离节点信息

引入网络距离预测技术和空间填充曲线技术。基于被动路标的网络距离预测方法

以较小的网络开销和部署成本准确估计网络距离

基于查表的对角线空间填充曲线映射算法

提高筛选临近节点的速度。最后给出短路径优先的覆盖网络构造详细过程。实验结果表明所提方法可有效提高覆盖网络与物理网络的拓扑匹配程度。

Abstract

Shorter path first strategy to build topology matching overlay was presented.First

passive landmark based network distance prediction method was presented

and the network distance between peers could be predicted correctly with low overload and deployment cost.Then

table based diagonal space-filling curve map algorithm was presented

which could accelerate topology information selection.Finally

the process of building overlay using shorter path firs（SPF） strategy was described in detail.Experiment results shown that the SPF overlay can improve the topology matching remarkably.

关键词

Keywords

references

Views

753

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Research on the modeling of the Internet delay space

Related Author

Zhan-feng WANG

Ming CHEN

Chang-you XING

Bing LI

Xiao-feng QIU

Related Institution

Institute of Command Automation,PLA University of Science＆Technology

AI问答

⁰