一种基于DHT的对等网络构造方式

doi:10.13190/jbupt.200701.118.hanl

北京邮电大学学报 ›› 2007, Vol. 30 ›› Issue (1): 118-122.doi: 10.13190/jbupt.200701.118.hanl

一种基于DHT的对等网络构造方式

韩丽, 雷振明, 刘芳

北京邮电大学信息工程学院，北京 100876

收稿日期:2006-10-10 修回日期:1900-01-01 出版日期:2007-03-30 发布日期:2007-03-30
通讯作者: 韩丽

A New Peer-to-Peer Network Constitution Based on DHT

HAN Li, LEI Zhen-ming, LIU Fang

School of Information Engineering , Beijing University of Posts and Telecommunications, Beijing 100876, China

Received:2006-10-10 Revised:1900-01-01 Online:2007-03-30 Published:2007-03-30
Contact: HAN Li

摘要/Abstract

摘要：

基于维star connected cycle (SCC)拓扑图首次提出了一种常量小度数的对等网络构造方式SCC-DHT，它采用分布式哈希表（DHT）的思想进行有效地资源查找定位，网络节点之间的覆盖连接则是参考SCC拓扑图，使得每个节点在维持个邻居节点度数的前提下，资源查找路径为．实验结果表明, SCC-DHT具有更好的健壮性和可扩展性．

关键词: 对等网络, 分布式哈希表, SCC拓扑图, 常量小度数

Abstract:

A constant-degree peer-to-peer network constitution based on d dimension star connected cycles(SCC) graph was presented firstly, namely SCC- distributed Hash table (DHT). It adopts DHT to search and locate resource, and the connection of network nodes are covered and connected according to SCC graph. SCC-DHT achieves a time complexity of logic hop per lookup request by using neighbors per node. The simulation results show that SCC-DHT has better robustness and expansibility.

Key words: peer-to-peer network, distribute Hash table, star connected cycles graph, small constant-degree

中图分类号:

TN911.22

韩丽, 雷振明, 刘芳. 一种基于DHT的对等网络构造方式[J]. 北京邮电大学学报, 2007, 30(1): 118-122.

HAN Li, LEI Zhen-ming, LIU Fang. A New Peer-to-Peer Network Constitution Based on DHT[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2007, 30(1): 118-122.

参考文献

[1] Clark D. Face-to-face with peer-to-peer networking [J]. IEEE Computer, 2001, 34(1): 18-21.
[2] Schoder D, Fischbach K. Peer-to-peer prospects [J]. Communications of the ACM, 2003, 46(2): 27-29.
[3] Tomoya K, Shigeki Y. Application of P2P technology to marketing // Proceedings of the 2003 International Conference on Cyberworlds. Washington:IEEE Computer Society Press, 2003: 372-379.
[4] Lichun Ji, Deters R. Coordination and enterprise wide P2P computing //Proceedings of 2005 IEEE International Conference on Service Computing. Washington: IEEE Computer Society press, 2005: 141-148.
[5] Balakrishnan H, Kaashoek M F. Looking up data in P2P systems [J]. Communications of the ACM, 2003, 46(2): 43-48.
[6] Ratnasamy S, Shenker S, Stoica I. Routing algorithms for DHTs: some open questions //Proceedings of 1^st Workshop on Peer-to-Peer Systems. Cambridge: , 2002: 45-52.
[7] Saroiu S, Gummadi P K, Gribble S D. A measurement study of peer-to-peer Sharing Systems //Proceedings of Multimedia Computing and Networking 2002(MMCN). San Jose: , 2002: 156-170.
[8] Stoica I, Morris R, Karger D. Chord: a scalable peer-to-peer lookup service for internet applications // Proceedings of ACM SIGCOMM 2001. San Deigo CA: , 2001: 149-160.
[9] Rowstron A, Druschel P. Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems //IFIP/ACM International Conference on Distirbuted Systems Platforms (Middleware). HeideIberg:, 2001: 329-350.
[10] Zhao Y B, Huang L, Stribling J, et al. Tapestry: a resilient global-scale overlay for service deployment [J]. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 41-53.
[11] Ratansamy S, Francis P, Handley M, et al. A scalable content-addressable network //Proceedings of ACM SIGCOMM 2001. San Deigo: , 2001: 161-172.
[12] Maymounkov P, Mazzieres D. Kademlia: a peer-to-peer information system based on the XOR metric //Proceedings of 1^st International Workshop on Peer-to-Peer System IPTPS 2002. Cambridge: , 2002: 53-65.
[13] Kaashoek F, Karger D R. Koorde: a simple degree-optimal hash table //Proceedings of 2^nd workshop on Peer-to-Peer systems. Berkeley: , 2003: 98-107.
[14] Fraigniaud P, Gattron P. The content-addressable network D2B . : CNRS University de Paris-sud France, 2003.
[15] Loguinov D, Kumar A. Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilence //Proceedings of ACM SIGCOMM 2003. Germany: , 2003: 395-406.
[16] Malkhi D, Naor M, Ratajczak D. Viceroy: a scalable and dynamic lookup network //Proceedings of 21^st ACM Symp on Principles of Distributed Computing. Monterey: , 2002: 367-389.
[17] Xu J, Kumar A, Yu X X. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks [J]. IEEE Jounal on Selected Areas on Communications, 2004, 22(1): 151-163.
[18] Li Dongsheng, Lu Xicheng, Wu Jie. FISSIONE: a scalable constant degree and low congestion DHT schemes based on Kautz graphs //Proceedings of INFOCOM 2005. 24^th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005: 1677-1688.
[19] Latifi S, Azevedo M, Bagherzadeh N. the star connected cycles: a fix-degree network for parallel processing //Proceedings of International Conference on Parallel Processing. 1993: 100-110.
[20] Sheldon B A, Dov H, Balakrishnan K. The star graph: an attractive alternative to the n-cube //Proceedings of Parallel Processing. New York :, 1987: 393-400.

一种基于DHT的对等网络构造方式

A New Peer-to-Peer Network Constitution Based on DHT

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 14

编辑推荐

Metrics

本文评价

[1]	张春红, 胡清源, 程时端. 基于降维算法的分布式语义资源搜索[J]. 北京邮电大学学报, 2013, 36(2): 74-78.
[2]	魏祥麟陈鸣张国敏. 一种综合的结构化P2P系统负载均衡机制[J]. 北京邮电大学学报, 2012, 35(3): 87-90.
[3]	聂荣聂林刘超慧雷振明兰巨龙. BitTorrent网络特性的测量与研究[J]. 北京邮电大学学报, 2012, 35(3): 125-128.
[4]	吕晓鹏,王文东,龚向阳,马建. 混合网中的P2P资源共享机制[J]. 北京邮电大学学报, 2011, 34(4): 113-117.
[5]	杨莉,张毓森,邢长友,王金双. 兴趣域信任相似度敏感的P2P拓扑构建模型[J]. 北京邮电大学学报, 2011, 34(2): 94-98.
[6]	弭伟,张春红,裘晓峰,曾志民,李漓春. 基于结构化P2P系统的SDYA负载均衡算法[J]. 北京邮电大学学报, 2010, 33(6): 116-120.
[7]	刘乃文,刘方爱,刘书昌. 环皮特森簇网格的资源搜索机制[J]. 北京邮电大学学报, 2010, 33(4): 59-63.
[8]	贡岩1,2,杨放春1,邹华1,双锴1. 利用信任和社会网络的资源发现方法[J]. 北京邮电大学学报, 2009, 32(5): 84-87.
[9]	代战锋温巧燕李小标. P2P网络环境下的推荐信任模型方案[J]. 北京邮电大学学报, 2009, 32(3): 69-72.
[10]	邹东尧, 宋美娜, 宋俊德. 对等网络Chord模型的分区管理策略[J]. 北京邮电大学学报, 2008, 31(3): 54-58.
[11]	关志涛，曹元大，李剑. 混合对等网络中基于激励的可靠搜索算法[J]. 北京邮电大学学报, 2008, 31(2): 42-45.
[12]	王蛟, 周亚建, 杨义先. 基于可信列表的启发式流量检测模型[J]. 北京邮电大学学报, 2008, 31(2): 95-98.
[13]	高长喜1,2, 章甫源1,2, 辛阳1,2, 钮心忻1,2, 杨义先1,2. P2P网络中蠕虫传播与防治模型的研究[J]. 北京邮电大学学报, 2006, 29(s2): 49-53.
[14]	程久军，李玉宏，程时端，马建. 移动P2P系统体系结构与关键技术的研究[J]. 北京邮电大学学报, 2006, 29(4): 86-89.