一种令P2P覆盖网络拓扑相关的通用方法
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

Supported by the National Natural Science Foundation of China under Grant No.60573131 (国家自然科学基金); the National Grand Fundamental Research 973 Program of China under Grant No.2006CB303004 (国家重点基础研究发展规划(973)); the Teaching and Research Award Program for Out


A Generic Approach to Making P2P Overlay Network Topology-Aware
Author:
Affiliation:

Fund Project:

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

    利用分布式哈希表,有结构的对等(peer-to-peer,简称P2P)网络具备了较短的路由长度和较好的扩展性.然而,由此产生了覆盖网络和物理网络之间的不匹配问题,它严重阻碍了在大规模环境下建立有效的对等网络.提出一种通用的、协议无关的方法来解决该问题.该方法基于节点交换机制,通过发现并实施有利于覆盖网络和物理网络匹配的节点交换来降低网络时延、提高性能.实验表明,该方法在明显降低了覆盖网络的平均时延的同时,也保证了额外开销可控.此外,若与其他协议相关的方法相结合,系统性能还可以得到进一步提高.

    Abstract:

    With the help of distributed Hash table, the structured P2P (peer-to-peer) network has a short routing path and good extensibility. However, the mismatch between the overlay and physical network becomes the obstacle in the way of building an effective peer-to-peer system in a large-scale environment. In this paper, a generic, protocol-independent approach is proposed to solve this problem. This method is based on the swaps of peers. By discovering and performing the potential swaps that are beneficial to the match between overlay and physical network, it can reduce the average latency and improve the performance of the system. The experimental results show that the approach can greatly reduce the average latency of overlay networks. Moreover, the cost of overhead is controllable. Besides, if combining this approach with other protocol-dependent ones, the performance can be further improved.

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

邱彤庆,陈贵海.一种令P2P覆盖网络拓扑相关的通用方法.软件学报,2007,18(2):381-390

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2005-10-22
  • 最后修改日期:2006-02-23
  • 录用日期:
  • 在线发布日期:
  • 出版日期:
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号