|Table of Contents|

A Cache-Shared Model Based on G-Chord(PDF)

南京师范大学学报（工程技术版）[ISSN:1006-6977/CN:61-1281/TN]

Issue:
2009年04期
Page:
77-81
Research Field:
Publishing date:

Info

Title:
A Cache-Shared Model Based on G-Chord
Author(s):
Song Zhigang
Network and Information Center,Fuzhou University,Fuzhou 350002,China
Keywords:
G-Chord;  cache-shared;  perform ance
PACS:
TP393.02
DOI:
-
Abstract:
A node cache sha ring m ode l based on the G-Chord a lgo rithm is presented, wh ich imp lements the sea rch, store and distributiton o f the ob jec ts by using the content o f cache of the client nodes, wh ile ra ising the coopera tion am ong the c lients, decreas ing the wa it tim e of c lients, and reduc ing the pressure on the serve rs. It was proved in the emu lationa l exper im ent that the leng th of the route- tab le was ev idently curta iled, w hile rem a in ing good leng th o f the av erage path. The research on the difference am ong the amount o f groups and the va lue o f them and the load of the nodes a lso prov ided some re ference for the G-Cho rd grouping schem e.G-Chord, cache-shared, perform ance

References:

[ 1] 陈刚, 吴国新, 杨望. G-Chord: 一种基于Chord的路由改进算法[ J] . 东南大学学报: 自然科学版, 2007, 37( 1): 9-12.
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:
Na tura l Sc ience Ed ition, 2007, 37( 1): 9-12. ( in Ch inese)
[ 2] 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
of theW orkshop on Design Issues in Anonym ity and Unobse rvability. Berke ley, Ca lifo rnia, 2000: 46.
[ 3] 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
SIGCOMM 2001. N ew York, USA: ACM Press, 2001: 149-160.
[ 4] 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
on Peer-to-Peer Systems, 2002. Berlin: Spr inger, 2002: 174-175.
[ 5] Drusche l P, Rowstron A. Pastry: sca lable, distr ibuted object location and routing for large- scale peer-to-peer system [ C ] / /
Proc o f theM idd lewa re 2001. H eide lberg: Spr ing er-Ve rlag, 2001: 329-350.
[ 6] 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
Sc ience D ivision, Un iversity o f Ca lifo rnia at Berke ley, Tech Rep: UCB /CSD-01-1141, 2001.
[ 7] 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
ACM Symposium on Princ ip les of D istributed Com puting, 2002. New Yo rk, USA: ACM Press, 2002: 183-192.
[ 8] 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-
Peer Sy stem sW orkshop ( IPTPS 2002). Cambr idge, MA, 2000: 1-21.

Memo

Memo:
-
Last Update: 2013-04-23