File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Probabilistic search in P2P networks with high node degree variation

TitleProbabilistic search in P2P networks with high node degree variation
Authors
Issue Date2007
Citation
Ieee International Conference On Communications, 2007, p. 1710-1715 How to Cite?
AbstractA novel Adaptive Resource-based Probabilistic Search algorithm (ARPS) for P2P networks is proposed in this paper. ARPS introduces weighted probabilistic forwarding for query messages according to the node degree distribution and the popularity of the resource being searched. A mechanism is introduced to estimate the popularity and adjust the forwarding probability accordingly such that a tradeoff between search performance and cost can be made. Using computer simulations, we compare the performance of ARPS with several other search algorithms. It is shown that ARPS performs well under various P2P scenarios. ARPS guarantees a success rate above a certain level under all circumstances, and enjoys high and popularity-invariant search success rate. © 2007 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/99522
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorZhang, Hen_HK
dc.contributor.authorZhang, Len_HK
dc.contributor.authorShan, Xen_HK
dc.contributor.authorLi, VOKen_HK
dc.date.accessioned2010-09-25T18:33:51Z-
dc.date.available2010-09-25T18:33:51Z-
dc.date.issued2007en_HK
dc.identifier.citationIeee International Conference On Communications, 2007, p. 1710-1715en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/99522-
dc.description.abstractA novel Adaptive Resource-based Probabilistic Search algorithm (ARPS) for P2P networks is proposed in this paper. ARPS introduces weighted probabilistic forwarding for query messages according to the node degree distribution and the popularity of the resource being searched. A mechanism is introduced to estimate the popularity and adjust the forwarding probability accordingly such that a tradeoff between search performance and cost can be made. Using computer simulations, we compare the performance of ARPS with several other search algorithms. It is shown that ARPS performs well under various P2P scenarios. ARPS guarantees a success rate above a certain level under all circumstances, and enjoys high and popularity-invariant search success rate. © 2007 IEEE.en_HK
dc.languageengen_HK
dc.relation.ispartofIEEE International Conference on Communicationsen_HK
dc.titleProbabilistic search in P2P networks with high node degree variationen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailLi, VOK:vli@eee.hku.hken_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICC.2007.286en_HK
dc.identifier.scopuseid_2-s2.0-38549107158en_HK
dc.identifier.hkuros134244en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-38549107158&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1710en_HK
dc.identifier.epage1715en_HK
dc.identifier.scopusauthoridZhang, H=9045330800en_HK
dc.identifier.scopusauthoridZhang, L=11040255900en_HK
dc.identifier.scopusauthoridShan, X=7101712454en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK
dc.identifier.citeulike2765701-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats