[1]吕 猛,周炯如,陆洁茹,等.P2P 系统节点并行加入查找算法研究[J].常州大学学报(自然科学版),2009,(02):50-53.
 LV Meng,ZHOU Jio ng- ru,LU Jie- r u,et al.Reserch on Lookup Algorithm of P2P System Nodes Concurrently Joining[J].Journal of Changzhou University(Natural Science Edition),2009,(02):50-53.
点击复制

P2P 系统节点并行加入查找算法研究()
分享到:

常州大学学报(自然科学版)[ISSN:2095-0411/CN:32-1822/N]

卷:
期数:
2009年02期
页码:
50-53
栏目:
出版日期:
2009-06-25

文章信息/Info

Title:
Reserch on Lookup Algorithm of P2P System Nodes Concurrently Joining
作者:
吕 猛 周炯如 陆洁茹 史海峰
江苏工业学院信息科学与工程学院, 江苏 常州 213164
Author(s):
LV Meng ZHOU Jio ng- ru LU Jie- r u SH I Hai- feng
School of Informat ion Science and Engineering, Jiangsu Polytechnic University, Changzhou 213164, China
关键词:
查找算法 对等系统 量化分析 维护协议
Keywords:
lookup algor ithm P2P system quant itat ive analysis maintenance protoco l
分类号:
T P 309
文献标志码:
A
摘要:
分析了Ch ord 系统查找算法的特点, 在此基础上, 给出一个改进的查找算法, 实现了P2P 系统在节点并行加入时正确高 效的数据项查找。同时, 提出了P2P 系统节点并行加入的理想化状态, 并对理想化状态的网络模型进行了量化分析, 从而克服 了Ch ord 环的损坏和查找不能正确进行的情况发生。
Abstract:
This paper analyzes the characteristic of Cho rdcs lo okup algo rithm, show s a mo dified maintenance protoco l based on it , implement s ef ficient ly and co rrect ly lo oks up data items of P2P sy stem w hen the nodes concurrent ly join. Describes a quant itat ive ideal state of it , g ives a quant itative analysis of netw o rk mo del of the ideal state, thus avoiding the Chord ring being broken and the lookuping being disrupted.

参考文献/References:

[1] St oica I, Morri s R, Liben- Now ell D, et al . Chord: A scalabl e peer - t o - peer looku p service for Int ernet appli cat ions [C] M Proceeding s of the 2001 Conferen ce on Ap plicati on , T ech nologies , A rchit ectures , and Prot ocols f or Comput er Commun ication s. Cal ifornia: ACM Pres s, 2001: 149- 1601
[2] Karger D, Lehman E, Leigh ton F, et al . Consis t ent hashin g and random t rees: Dis t ribut ed cachin g p rot ocol s for relievin g hot spot s on th e World Wide Web [C] MProceedings of the 29th Annual ACM S ymposium on T heory of Comput ing. Cal-i forn ia: ACM Pres s, 1997: 654- 663.
[3] Lew in D. Consi st ent hashin g and random t rees: Algorithms f or caching in dis t ribut ed n etw orks [D] . Camb ridge: MIT , 1998.
[4] U . S. Department of Commerce. FIPS 180 - 1 S ecure Hash St andard [S] . Springf ield VA: Nat ional T ech nical Inf ormat ion S ervice, 1995.
[5] Secretary of Commerce. FIPS 180 - 2 An nouncin g the Secure H as h St andard [S] . S pringf ield: Inf ormation Techn ol ogy Manag ement Ref orm Act and Comput er S ecu rity Act , 2002.
[6] Pandu rangan G, Rag havan G, Upf al E. Building l ow - diamet er P2P netw ork s [C] MProceedings of th e 42nd IE EE Sym p on Fou ndat ions of C om put er S cien ce. Las Vegas: IEEE Comput er Soci et y, 2001: 490- 499.
[7] Liben - now ell D, Balakris hman H , Karger D. Anal ysis of the evlut ion of peer- t o - peer syst em s [C] MIn Proceedings of the 21st Annu al Symp on Principl es of Dist ribut ed Comput ing. Mont er ey: ACM SIGOPS and ACM SIGACT, 2002: 300- 350.

备注/Memo

备注/Memo:
作者简介: 吕猛( 1973- ) 男, 安徽淮南人, 讲师, 硕士。
更新日期/Last Update: 2009-06-25