博文
Hierachical for keyword search
(2005-01-18 12:16:08)
<Makingpeer-to-peekeywordsearchingfeasibleusingmulti-levelpartitioning>NodesaregroupedtoformLlevels.Queriesarefirstsenttotheroot,androotbroadcastittoeverygroupinlowerlevel.Nodesalwaysbroadcastthequerytolowerlevelnodes.Atthelastlevel:partitionbykeywords.Means:eachnodepublishesitskeywordstoothernodes.(HashlikeDHT)SowhenqueryarrivesthelevelL,useDHTtolocatenodes.Resultfromlowerlevelmergedtoroot....[阅读全文]
阅读 () ┆ 评论 (1)
Their idea
(2005-01-17 11:46:25)

Nodesareclusterd.Clusterhasaclusterrange:CR.Everynodeisassignedandistancevalue:DV.whichisthedistancetothecenter.Thecenternode'sDVis0.ThenetworkisconnectedwithGnutellaprotocol.Butmaintainatreestructureasshowninthegraph.Whennodejoinsthenetwok.Ithasaneighbourlist.While,itchooseonefromthenighbourlistwhosedegreeislessthanthemaximumdegreeandwhoseDV<CR.Itconnecttothisnighbour,andtheneibhourassginthisn...[阅读全文]
阅读 () ┆ 评论 (1)
Advice to a Beginning Graduate
(2005-01-14 20:20:17)
AdvicetoaBeginningGraduateStudentManuelBlumCarnegieMellonUniversity
or
WhatisResearch?
or
The4R'sofGraduateSchool:
Reading,Rithmetic,Research,andWriting29-AUG-01.Updated28-AUG-02.
ManuelBlum
Outlineofthetalk:READING,STUDYING,THINKING,
STARTINGOFFonthePhD,
DEEPintheMIDDLEofthePhD,
WRITINGitallup.
YOU
READING:
Booksarenotscrolls.
Scrollsmustber...[阅读全文]
阅读 () ┆ 评论 (1)
Skipnet
(2005-01-14 15:41:21)

DHThas2disadvantages:nocontroloverwheredataisstoredandnoguaranteethatroutingpathsremainwithinanadministrativedomain.Skipnetprovidecontrolleddataplacementandguaranteedroutinglocality.Itmaintain2addressspaces:astringnameIDspace,anumericIDspace.Nodesorganizedsimilartoskiplist.Askiplistisalinkedlistsomenodesaresupplementaedwithpointersthatskipovermanylistlements.Eachnodelinkedathigherlevelwithprobabil...[阅读全文]
阅读 () ┆ 评论 (0)
some terms
(2005-01-13 10:30:12)
Recall:therecallofaqueryisdefinedasthe#ofresultsreturneddivededbythe#ofresultsacturallyavailableinthenetwork.[阅读全文]
阅读 () ┆ 评论 (0)
Superpeer hierachical structur
(2005-01-12 22:08:15)


<Structuredsuperpeers:LeveragingHeterogeneitytoprovideconstant-timelookup>Use2Chordrings.Thesuperpeersintheinnerringandtakechargeofanarcoftheoutring.Thesuperpeermaitainsacompleteothersuperpeertableandalocalpeertable.Thequeryissenttothesuperpeer.Ifitcannotresolvethequery,itforwardthequerytosuperpeerinchargeofthekeyarc.andthatsuperpeerwillforwardthequerytothesuccssorofthekey.[阅读全文]
阅读 () ┆ 评论 (0)
Schedule
(2005-01-12 21:57:01)
Monday(1-3)C
Tuesday(10-11)TAmeeting
Wendesday(12-2)F
Thursday(6-8:30)mobilenetwork
TAoffice:0025600023000swim2swamRosenGoodrichWeekDescriptionHoursPageSectionPageSection1Introduction(handout)½771.6-1.8ReviewofDiscreteMath(SetsandFunctions)1½11.1-1.8C++Programming(self-taught)03014.1Counting:ProductRule,SumRule,Inclusion-ExclusionPrinciple,TreeDiagrams1½3134.22...[阅读全文]
阅读 () ┆ 评论 (0)
Add structure to Gnutella
(2005-01-12 19:03:17)
Insteadofflooding,useDHTbasedbroadcasttopropagatequery.ThemembershipisalsomaintainedwithDHTway.Butqueryarebroadcast,contentneednotbehashedtoakey.<shouldwebuildGnutellaonastructuredoverlay?>[阅读全文]
阅读 () ┆ 评论 (1)
one hop lookup
(2005-01-11 22:40:14)
DHTbased:Everynodemaintainsafullroutingtablecontaininginformationabouteveryothernodeintheoverly.Nodeintheoverlayisassignedanid.TheidspaceformsaChordring.Everynodesendskeep-alivetoitspredecessorandsuccessor.Useahierarchytoformdisseminationtrees.Dividethe128-bitcircularidspaceintokintervalscalledslices.Everyslicehasasliceleader.Thesliceisfurtherdividedintounits,andeachunithasaunitleader.Whennodedete...[阅读全文]
阅读 () ┆ 评论 (3)
Gnutella
(2005-01-08 11:09:24)
Gnutellaimprovments:1.Hierarchy:Ultrapeerandleaf.Leafconnectto1ultrapeer,andreportitsHashresourcesummary.Ultrapeerconnectmanyleavesandmultipleotherultrapeers.Ultrapeershieldleaffromflooding.2.Routingamoungultrapeers:lasthoprouting.Routingtableareonlyexchangedbetweendirectconnnetedneighbours.Sothelasthop(whenhop=TTL)queryissenttotherelatednodes.Allotherqueriesarefloodedasbefore.Thisiseffective:save...[阅读全文]
阅读 () ┆ 评论 (0)
[<<]
[上一页]
[6]
[7]
[8]
[下一页]
[首页]
[尾页]