基于帶超級節(jié)點P2P網(wǎng)絡結(jié)構(gòu)的數(shù)據(jù)一致性研究.pdf

1、中南大學碩士學位論文基于帶超級節(jié)點P2P網(wǎng)絡結(jié)構(gòu)的數(shù)據(jù)一致性研究姓名：蔣試偉申請學位級別：碩士專業(yè)：計算機應用技術(shù)指導教師：歐陽松20080401ABSTRACTWiththeP2Pnetworkdevelopment，morescalable，availableandinstantaneoustoallkindsofresourceiSrequiredintheP2PsystemReplicationisaneffectivewayt

2、oimprovesystemperformanceanddataavailabilityWiththeP2Papplicationtransferringfromreadonlystaticfilessharingtoreadwritedynamicalfilesinteracting，aefficientreplications’consistencymaintenancemethodisstronglyrequiredbetween

3、frequentlyupdatedfilesandtheirreplicasintheP2PsystemWhat’Smore，themethodiSrequirednotonlystrongconsistencybutalsofastpropagationofupdatemessagesAfterhighlycomprehendanalysisofthewaytocreatereplicasandmaintainthereplicasc

4、onsistencyatpresent，thisthesispresentsanewmethod：ReplicationsIndexTreebasedConsistencyMaintenanceinSuperPeersstrategy(RjTCM)todealwiththeproblemsInthismethodaccordingtothedifferentresource，allSuperPeers’indexsareorganize

5、dinmanydifferentcompletebinarytreeswhichareusedinconsistencymaintenanceWith對TCM，thisthesismakesfurtherresearchonthestabilityandfaulttoleranceFinallyAexperimentiSmadeandtheexperimentalresultsshowthattheReplicationsIndexTr

6、eebasedConsistencyMaintenanceinSuperPeersCanlargelyreducethenumberoftheduplicatedmessagesMoreoveritCanobviouslyimprovethecoverageMeanwhile，comparingtheNS砌T(NoSequenceReplicationIndexTree)strategytheRITCM’propagationofupd