位置感知的覆盖网构建算法
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

国家973重点基础研究发展规划(2002CB312105);高等学校全国优秀博士学位论文作者专项资金项目(200141)


Research of Location-aware Overlay Construction Algorithm
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    提出了一个基于底层网络位置信息建立P2P覆盖网的算法Lanet:覆盖网中每个节点都选择和本节点物理距离相近的节点作为自己的邻居,逻辑上相邻的节点也是物理上相近的节点。由于路由路径中每跳的延时都较低,这使得所建立的覆盖网络具有非常低的延时伸展率(latency stretch)。Lanet不需要网络中固定的节点集充当地标节点,具有很好的分布性和可扩展性。模拟实验结果表明,利用该算法建立的位置感知的P2P系统能够大幅度降低数据定位的延时。

    Abstract:

    An algorithm named Lanet whereby the overlay network construction is based on the location information of underlying physical topology is presented. Each peer is connected to a small subset of the other peers which are close in the physical network. The peers that are close in the logical network are also close in the physical network. As a result, the expected delay of each hop in the routing path is very low. This leads to low latency stretch of the overlay network. This algorithm is scalable and distributing for a fixed subset of nodes act as landmarks is not required. Simulation results indicate that the latency of data location in these location-aware systems that are constructed with Lanet can be significantly decreased.

    参考文献
    相似文献
    引证文献
引用本文

张小明,王意洁.位置感知的覆盖网构建算法[J].国防科技大学学报,2006,28(6):124-128.
ZHANG Xiaoming, WANG Yijie. Research of Location-aware Overlay Construction Algorithm[J]. Journal of National University of Defense Technology,2006,28(6):124-128.

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2006-04-03
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2013-03-14
  • 出版日期:
文章二维码