P2P網(wǎng)絡(luò)群發(fā)通信算法優(yōu)化研究與模擬.pdf

1、西安石油大學(xué)碩士學(xué)位論文P2P網(wǎng)絡(luò)群發(fā)通信算法優(yōu)化研究與模擬姓名：李娜申請(qǐng)學(xué)位級(jí)別：碩士專(zhuān)業(yè)：計(jì)算機(jī)應(yīng)用技術(shù)指導(dǎo)教師：劉天時(shí)20090520英文摘要Subject：TheStudyandSimulationonOptimizationalgorithmofP2PMulticastCommunicationSpeciality：Name：Instructor：ABSTRACTWiththeextensiveUSeofP2Ptechnolo

2、gyinvariousfieldstheP2PmulticastalgorithmbasedonP2PnetworkisincreasinglybecominganimportantaspectonaffectingthedevelopmentofP2PtechnologySincetheconcunentcommunicationtimeusedasamajorstandardtomeasuretheP2Pnetworkmultica

3、stalgorithm，ithasbeenmademoreattentionforthee街cientofmulticastcommunicationalgorithmThisdissertationisbasedonP2Ptechnologytostudythealgorithm，whichconstructsthemulticasttreeintheP2PnetworkThealgorithmcanbebasedonthevalue

4、ofcommunicationnetworks，whichcanmakethecommunicationsequenceofcommunicationnodesinarationaldistributionAnditensureallthenodesofcommunicationtomakefulluseofthesmallervalueinthecommunicationtreewhichachievestheconcurrentco

5、mmunicationwiththeshortesttimeFirstofall，weneedtomakethepreliminaryestimatestoeachnodeforaseriesoffactors，suchasthelocationdistributionofnodesandthecommunicationenvironment。inordertogetthecommunicationweightSecondlybecau

6、seofthecommunicationtreeprovideaneffectivemethodoftransmissiontojointhenodes，whichneedthesamedata，inthesamesharinggroupandtousethesamedatastreamTherefore，usethesourcenodesfortherootthedifferentalgorithmsstructurethediffe

7、renttrees，andthedifferenttreeshavethedifferentconcurrentcommunicationtimeAfterindepthanalysisoftheP2Pcommunicationrulesandmulticastalgorithm，thisdissertationusetheconcurrentcommunicationmethodundertheconditionsoftheshort

8、esttimeofconcurrentcommunicationtobeensured，anewalgorithm，whichCanimprovetheoverallefficiencyofcommunication，forbuildingacommunicationtreeisgivenThisalgorithmisinaccordancewiththevalueofcommunicationsnodewhichparticipate

9、in，todistributetheirrespectivecommunicationtask，andtodistributetherationalcommunicationpositioninthecommunicationtreeIncontrasttothetwocommunicationtreealgorithm(KruskalcommunicationstreealgorithmandBranchFirstcommunicat

10、iontreealgorithm)，thisdissertationpropose”DifjficultNode”P(pán)rioritycommunicationtreealgorithmInordertoadapttothesituationoflarge—scalenetworkwithmanynodes，thisdissertationcombinedwithantcolonyalgorithmtofurtheroptimizethee