期刊文献+

基于会话异构的结构化对等网络拓扑模型 被引量:5

Structured Peer-to-Peer Topology Model Basedon Session Heterogeneity
在线阅读 下载PDF
导出
摘要 针对分布式哈希表(DHT)拓扑模型在动态网络中性能下降的问题,提出了一种改善的会话异构拓扑(SHT)模型.SHT模型利用了对等网络节点存在的会话异构性,将动态节点聚簇在稳定节点,从而降低了网络动态节点对于DHT拓扑的强干扰性.仿真实验显示,SHT模型能有效减少对等网络系统的拓扑维护开销,提高系统稳定性和数据可用性. A novel session heterogeneity topology (SHT) model was proposed to fight the worse performance for Distributd Hash Table (DHT) model in dynamic networks. In SHT model, dynamic nodes are clustered to stable nodes so as to control the dynamic change of DHT topology network. The simulation experiments show that SHT model can efficiently reduce the maintenance overheads, and effectively improve the system stability and data availability in P2P systems.
出处 《上海交通大学学报》 EI CAS CSCD 北大核心 2004年第z1期145-147,153,共4页 Journal of Shanghai Jiaotong University
基金 上海市科技发展基金基础研究重点项目(025115032)
关键词 对等网络 会话异构 分布式哈希表 拓扑模型 peer-to-peer session heterogeneity distributed hash table topology model
  • 相关文献

参考文献6

  • 1[1]Stoica I, Morris R, Karger D, et al. Chord: a scalable peer-to-peer lookup service for Internet applications[A]. ACM SIGCOMM[C]. San Diego, CA:ACM Press, 2001.
  • 2[2]Druschel P, Rowstronand A. Pastry: scalable, distributed object location and routing for large-scale peer-to peer systems [A]. Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms [ C ]. Heidelberg, Germany:Springer, 2001.
  • 3[3]Zhao B Y, Huang L, Stribling J, et al. Tapestry: a resilient global scale overlay for service deployment [J]. IEEE Journal on Selected Areas in Communica tions, 2004, 22(1):41-53.
  • 4[4]Sylvia R, Paul F, Mark H, et al. A scalable contentaddressable network [A]. ACM Sigcomm [C]. San Diego, CA:ACM Press, 2001. 161-172.
  • 5[5]Xu Z, Rui M, Hu Y. Reducing maintenance overhead in DHT based peer-to-peer algorithms[A]. Proceedings of the 3rd International Conference on Peer-toPeer Computing (P2P'03) [C]. Sweden: Linkpings,2003.
  • 6[6]Sariou S, Gummadi K, Gribble S. A measurement study of peer-to-peer file sharing systems [A]. Proceedings of Multimedia Conferencing and Networking [C]. San Jose: ACM Press, 2002.

同被引文献16

  • 1张亮,邹福泰,马范援.Chord协议的最优路由表结构[J].上海交通大学学报,2005,39(8):1276-1279. 被引量:10
  • 2蔡明,俞伟.一种改进的Peer-to-Peer资源定位方法[J].微计算机信息,2006,22(03X):108-109. 被引量:11
  • 3Larke I,Sandberg O,Wiley B,et al. Freenet:A distributed anonymous information storage and retrieval system [A]. ICSI Workshop on Design Issues in Anonymity and Unobservability[C].Germany:Springer, 2000.46- 66.
  • 4Zhao B, Huang L ,Jeremy S ,et al. Tapestry : A resilient global scale overlay for service deployment[J]. IEEE Journal on Selected Areas in Communications, 2004,22(1):41-53.
  • 5Druschel P, Rowstronand A. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems [A]. Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms[C]. Heidelberg, Germany: Springer, 2001. 329- 350.
  • 6Stoical I, Morris R, Karger D, et al. Chord : A scalable peer-to-peer lookup service for internet applications[A]. ACM SIGCOMM [C]. San Diego, CA: ACM Press, 2001.149- 160.
  • 7Sylvia R, Shenker S, Ion Stoica. Routing algorithms for DHTs:Some open questions [A].Proceedings for the 1st International Workshop on Peer-to-Peer Systems[C].Heidelberg, Germany: Springer-Verlag,2002.45- 52.
  • 8Zhang L, Chen S D, Ma F Y, et al. WNChord: A weighted nodes based peer-to-peer routing algorithm[A]. Proceedings of the 5th International Conference on Parallel and Distributed Computing: Applications and Technologies [C]. Heidelberg, Germany : Springer,2004. 155- 159.
  • 9Stoica I, Morris R, Karger D, et al. Chord: A scalable peer to peer lookup service for internet applications[C]// ACM SIGCOMM. San Diego, CA: ACM Press, 2001: 149-160.
  • 10Sylvia R, Paul F, Mark H, et al. A scalable content addressable network[C]// ACM Sigcomm. San Diego,CA:ACM Press, 2001:161-172.

引证文献5

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部