Performance analysis and optimized operation of structured overlay networks [Elektronische Ressource] / Gerald Kunzmann

Gerald Kunzmann

Description

wurdeT1.ecamhniscBahehenUnivUniersit?t2.M?ncDihenrLehrstuhlFf?rnKHerzogommEbunikuoationsnetzeJulius-Maximilians-UnivPaerfobrmancehenAnalysisundandhnikOptimizedVOprerationDr.-Ing.ofderStructuredDr.-Ing.OverlaheyDr.-Ing.NetTweriscoW?rzburgrkseDipl.-Ing.iUniv.21.GeralddKunzmannecVersit?tolhlst?ndhif?rgerInformationstecAbangenommen.drucorsitzekdeder:vv.-Prof.onHans-GeorgderPr?ferFDissertation:aUniv.-Prof.kuJ?rglersp?ctr?Univ.-Prof.tPhElektrotecchnikran-Gia,undyInformationstechehnikersit?tderDieTssecrthniscthenonUniamv11.2008ersit?teiM?nceheTnhnisczurUnivErlangungM?ncdeseingereicaktademiscdurchendieGradesakult?teinesElektrotecDoktor-Ingenieursund(Dr.-Ing.)hnikgenehmigten08.04.2009Dissertation.wP6,erfoGeraldrmanceyAnalysisrksandMaOptimizedOverlaOpNeterationoofDipl.-Ing.StKunzmannryuc2009turedhangingAbstracttheseThecurrenongoingasprotocessmostofmaglandobalizationBasedleadsroutingtoresourcesatableshstoredugethatdemandwfor(highlycongurationscalabledicationsappli-structurcations.wsTheaPlimitedeer-to-Poeertrate(P2P)etecBasedhnologystructuredenablesnanyarbitrarysystemslargeleanoumitbweruoftheusersotoyparticipatehandcertainconerlatributeyitopdistributederservicestolikstructureethesis,conytenytlodistributionvorsimcollab-poration.wWithwP2Pof,tothetoievndynamictelligefrequennocmainestructureisInshiftedtfromtocenctralizedwinstancesvtovtheaedgeswoferlathe.Inproactivternet.thatThisdeshiftoutisofsuppoorted.

Sujets

• Informatik

Informations

• Publié par: technische_universitat_munchen
• Publié le: 01 janvier 2009
• Nombre de lectures: 12
• Langue: English
• Poids de l'ouvrage: 8 Mo

Extrait

TechnischeUniv.-Prof.am08.04.2009Univyersit?teingereicM?ncv.-Prof.henUniv.-Prof.Lehrstuhlssf?rTKakult?tommdeunikPr?ferationsnetzeersp?cPcerfoersit?trmancetAnalysiseiandUnivOptimizeddurcOpunderationorsitzeof:StructuredHans-GeorgOverlaDissertation:yJ?rgNetrwPhoran-Gia,rksheDipl.-Ing.DieUniv.rtGeraldonKunzmann11.2008Veolhnisclst?ndM?ncitgerdieAbElektrotecdruchnikkVdernvronUniderDr.-Ing.FHerzogaderku1.lDr.-Ing.tEb?het2.ElektrotecDr.-Ing.hnikuoundTInformationstecBahnikeriscderJulius-Maximilians-UnivTW?rzburgecDihniscehenaUniivwurdeersit?t21.M?ncbhednrzurecErlangunghendesersit?takhenademischhenundGradesheinesFDoktor-Ingenieursf?r(Dr.-Ing.)hnikgenehmigtenInformationstecDiamssertation.angenommen.Performance6,wGeraldAnalysisyandrksOptimizedMaOpOverlaerationNetofoStDipl.-Ing.rKunzmannucytured2009AbstractTheongoingprooscenariostcesstheyofaglcommonobalizationtleadsptoonaensureshcanuge(DHTs).demandinforDHThighlyorks.scalablechurnappli-ofcations.andTheePabeer-to-Presult,eern(P2P)vteconhnologyllenablesonanP2Parbitraryumlargeproblemnopumvbverisoforkusersatosystemparticipatevand,connotributeparttoydistributednserviceserformedlikoferealizeconaretenwtanddistributionstructures,orokupcollab-erlaoration.ulativWitherformanceP2Pe,elltheparticipaniaddressnunstructuredtelligeenenctlyevistainingshiftedinfromthiscentotralizedtheinstanceshtoetheariousedgesinofccordingtheell-denedInyternet.TherebThiseshifteacisknosuppaortedthebvyAstherwidespreadarbitraryaevaailabilitbyTheofhpnecessaryoywhasherfulthisterminalsconcenandscalabilitbroadbofaerlanwdthenetresourceswoorks..IndetailedP2Pandsystems,maticaltheseofendcols,termiwnalsscalecreatetheaerpjustodesignedwscalabiliterfultonetvweP2Prinltsaersyandnetthewyork,Therefore,whiccorrecthyischighlydicult.scalabletext,sinceortannewtheusersparametersautomaticallynetaddandnewrate.reresults,saloeumorctoesthetoathetosystem.wTheomaierlanstructurgoal.ofyP2Pproactivoroutingvthaterlahysdeiswstoouteciencertaintlyofncurrendoanderlashare.distributedaresourcesqueamongyiusersginresourcesthebInpternet.withinHolimitedwumeverer,hops.themostfunctionalitapproacytooftheaodeploerlaystructureeddistributedsystemtablesheaInvilythesis,depeendstrateonthetheymainrobustnesstenancetheseofvitsyoasveerlaasylotopofologystored.theAvdisruptionyofBasedtahisimseomavheerlapyanalysisstructurestructuredcanprotocausewanshoythingthatfromsdegradedwpwitherformancenorblimitedoffunctionalitts,yasuparetotothethepyoininherenttoofP2PawtotalHocollapseevofr,thesystemssystem.erateThdynamicus,vironmencurrenandteresearcfrequenhjointacleaklesetheseoproblemserlaon(dieren).tmainlevael,olikerlaestructureoptimizedrapidlyself-organizationhangingscishemes,Ineciencontitoimpvterlaadaptycongurationmaindesigntenancetoandactualdatawtransfer,sizeandcshorturnloBasedokupthesedelawys.evStructureduP2PtnetvwexistingorksdicationsarrangeextensionsresourcesvstructuredP2Pprotocols.lowork,Resultingincreasingfromeouresanalysis,towoneneware(Vthgeneralusms.ablehms,tohinotroanalysisducetosolutions,col,whicVhCon-protrviderastructuredsignicanadvtlyalgorimorehstablereduceoysvrequirederlerhead.ameasuremenysimtopareologyelopinP2Pdynamicheninvi-vronmenframewts.thisThiseiducesonceptesseningtialfeaturesforstheelopopancederationokupoftanwhicyhelpP2Pfurthersystem.searcIndelaaddition,withoutathecorrectsignalingovvBasederlaouryts,structureandresultsulations,ineanableimprodevvaestructureddprotolowhicokupwtime,applyasadelaoice-oyser-IPdueoIP)toork.stalecludingowvwerlainyocon-anectionscareforeduced.realizMoreoservicvander,withwP2PeystedevviContents1.Intro..Non-DHTductiontenand38motivation.1.1.1..Denitionsastry.........................................29............................5.1.2..ConConclusiontribution..................Net.............OneHop.........estry.......and.....Load............7.1.3..OutlineGraphs.......3.4.2..................44.........3.1.1..................3.1.2..A.ork.........Kademlia......8.2..P.eer-to-P.eer32(P2P).overla.y.net.w.o.rks.9.2.1.3.1.5.ClassicationTof.P2P.o.v.erla.ys....Replication,.hing.........38.................40.cols............9.2.2.3.4.1.P2P.lo.okup.concepts..........................44................................11.2.2.1..Cen23tralizChorded.P2P.o.v.erla.ys......................25.Con.t.ddressable.w.(CAN)..............11.2.2.2.3.1.3.Unstructured.P2P.o.v.erla.ys......................3.1.4.......................13.2.2.3..Structur.e.d.P2P35oPv,erlaapys............................3.2..Republishing,.Cac..............16.2.2.4..Hierarc.hical3.3.P2Pbalancingo.v.erla.ys..........................3.4..proto................18.2.2.5..Comparison..........42.Skip...............................42.SkipNet..............20.3..Structur.e.d.P2P.lo.ok.u.p3.5.p.roto.cols.23.3.1..DHT-based.proto.cols......................vii#
tents4....Simul.ation.mo.dels96an.d.environment.47.4.1.usingMo.delingdetectithe.user.b6.2.1.2.eha.vior............6.1.3.2......v.oidance...................85.......n..47.4.2..Mo.deling.transmissio.n.time.in.ovv97erla.y.sim.ulations......6.2....W...6.2.1.1......P...(S-Chord)..50.4.2.1..Global.Net.w.ork.Porkositioning.(GNP)....Impro.....6.1.1.2........dv.....88.....Algorithm....52.4.2.2.ulationApplying.GNP93for.mo.deling.netorw.ork.transmissionissue...........99......536.1.4.4.4.2.3..Results....p...............recursiv.....b...........6.2.1.4....6.2.1.5........Hybrid................55.4.2.4.RelatedPredicting.in.ter-no.de.transmission.times....85.ed...........y.erns........57.4.3.6.1.2.SimChordulation.en.vironmen.t.and.GraphicalSymmetricalUserensIn.terface.(GUI)..90............58.4.4.andConclusion........Conclusion.............Repairing.d.ys.......Securit.(and.......6.1.4.2................A..........63.5..P.erfo.rmance,.robustness,.and.cost.ana.lysloi.s.65.5.1..Metrics....6.2.1..................e.lo.........and.selection.......105.lo.............Chord......Con.......65.5.1.1..Lo.okup112pathstrategylength.and.searc.h.duration..113.........................6.1.1.65W5.1.2..Robu.stness.of.the.o.v.erla.y.structure............6.1.1.1..v.stabilization..................66855.1.3.SecuritMaincotenanceco.v.erhe.ad................86.A.anced.stabilization.....................6.1.3..stabilization.tok68.5.2..Ev.aluating.the.Chord.proto.c.ol6.1.3.1............................90.Analysis.sim.results..............696.1.3.3.5.2.1..Num.b.er.of.P.articipan.ts............6.1.4..disrupted.partitione.o.erla...............6.1.4.1..y.s.their.on)....69.5.2.2..Ch.urn97RateReco.ery...........................6.1.4.3..v...........................10174Conclusion5.2.3..Design.parameters....................102.Optimized.okup.erformance.......................103.Related78ork5.3..Related.W.ork......................103.Iterativ.vs..e.okups...............103.Route.neigh.or..............81.5.4.6.2.1.3.Conclusionarallel.okups.......................109.Symmetrical.routing...........110.Chord..........................84.6.6.2.2.Optimizedroutingrobustness.and.p.erfo.rmance.85.6.1..Optimized.o.v.erla.y.robustnessviii