|
OALib Journal期刊
ISSN: 2333-9721
费用：99美元
|
|
|
|
基于G-Chord的Cache共享模型
, PP. 77-81
Keywords: G-Chord,Cache共享,性能
Abstract:
提出了一种基于G-Chord算法的节点Cache共享模型,实现对象的搜索、存储和分发,有效地利用了客户节点的缓存内容,提高了客户间的合作,减小了客户的等待时间,降低了服务器的压力.仿真实验证明,采用G-Chord算法处理节点的路由表长度有了显著的缩减,能够保持较好的平均路径长度.此外,对分组数量的不同取值、节点负载的研究也为G-Chord的分组方案提供了一定的参考依据.
| [1] | [ 陈刚, 吴国新, 杨望. G-Chord: 一种基于Chord的路由改进算法[ J] . 东南大学学报: 自然科学版, 2007, 37( 1): 9-12.
|
| [2] | Chen Gang, W u Guox in, Y angW ang. G-Chord: an improv ed routing a lg rithm for Cho rd[ J]. Journa l of SoutheastUn iv ers ity:
|
| [3] | Na tura l Sc ience Ed ition, 2007, 37( 1): 9-12. ( in Ch inese)
|
| [4] | [ C la rke I, Sandberg O, W iley B, e t a.l Freenet: A distributed anonym ous inform a tion sto rage and retr ieva l system [ C ] / /Proceedings
|
| [5] | of theW orkshop on Design Issues in Anonym ity and Unobse rvability. Berke ley, Ca lifo rnia, 2000: 46.
|
| [6] | [ Sto ica I, M o rris R, Karge rD, et a.l Cho rd: a sca lable peer-to-peer lookup serv ice for Interne t app lications[ C] / /Proc of ACM
|
| [7] | SIGCOMM 2001. N ew York, USA: ACM Press, 2001: 149-160.
|
| [8] | [ Ra tnasamy S, Shenker S, Sto ica I. Routing a lgor ithm s for DHTs: som e open questions[ C] / /Proc o f 1st Internationa lWo rkshop
|
| [9] | on Peer-to-Peer Systems, 2002. Berlin: Spr inger, 2002: 174-175.
|
| [10] | [ Drusche l P, Rowstron A. Pastry: sca lable, distr ibuted object location and routing for large- scale peer-to-peer system [ C ] / /
|
| [11] | Proc o f theM idd lewa re 2001. H eide lberg: Spr ing er-Ve rlag, 2001: 329-350.
|
| [12] | [ Zhao B, Kubiatow icz J, Jo seph A. Tapestry: an infrastructure for fault-to le rant w ide-area location and routing[ R]. Com puter
|
| [13] | Sc ience D ivision, Un iversity o f Ca lifo rnia at Berke ley, Tech Rep: UCB /CSD-01-1141, 2001.
|
| [14] | [ M a lkhi D, Nao rM, Ra tajczak D. V iceroy: a scalab le and dynam ic emu la tion of the butterfly [ C] / /Pro c of the 21st annual
|
| [15] | ACM Symposium on Princ ip les of D istributed Com puting, 2002. New Yo rk, USA: ACM Press, 2002: 183-192.
|
| [16] | [ Stading T, M an iatis P, BakerM. Peer- to-peer caching schem es to address flash c rowds[ C] / /Proc of 1st In ternational Peer- to-
|
| [17] | Peer Sy stem sW orkshop ( IPTPS 2002). Cambr idge, MA, 2000: 1-21.
|
Full-Text
|
|
Contact Us
service@oalib.com QQ:3279437679 
WhatsApp +8615387084133
|
|
