File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: An adaptive resource-based probabilistic search algorithm for P2P networks

TitleAn adaptive resource-based probabilistic search algorithm for P2P networks
Authors
KeywordsP2P networks
Popularity
Probabilistic forwarding
Resource search
Issue Date2007
PublisherOxford University Press. The Journal's web site is located at http://ietcom.oxfordjournals.org/
Citation
Ieice Transactions On Communications, 2007, v. E90-B n. 7, p. 1631-1639 How to Cite?
AbstractA novel Adaptive Resource-based Probabilistic Search algorithm (ARPS) for P2P networks is proposed in this paper. ARPS introduces probabilistic forwarding for query messages according to 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. Furthermore, ARPS adapts well to the variation of popularity, resulting in high efficiency and flexibility. Copyright © 2007 The Institute of Electronics, Information and Communication Engineers.
Persistent Identifierhttp://hdl.handle.net/10722/73873
ISSN
2015 Impact Factor: 0.3
2015 SCImago Journal Rankings: 0.184
ISI Accession Number ID
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-06T06:55:35Z-
dc.date.available2010-09-06T06:55:35Z-
dc.date.issued2007en_HK
dc.identifier.citationIeice Transactions On Communications, 2007, v. E90-B n. 7, p. 1631-1639en_HK
dc.identifier.issn0916-8516en_HK
dc.identifier.urihttp://hdl.handle.net/10722/73873-
dc.description.abstractA novel Adaptive Resource-based Probabilistic Search algorithm (ARPS) for P2P networks is proposed in this paper. ARPS introduces probabilistic forwarding for query messages according to 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. Furthermore, ARPS adapts well to the variation of popularity, resulting in high efficiency and flexibility. Copyright © 2007 The Institute of Electronics, Information and Communication Engineers.en_HK
dc.languageengen_HK
dc.publisherOxford University Press. The Journal's web site is located at http://ietcom.oxfordjournals.org/en_HK
dc.relation.ispartofIEICE Transactions on Communicationsen_HK
dc.subjectP2P networksen_HK
dc.subjectPopularityen_HK
dc.subjectProbabilistic forwardingen_HK
dc.subjectResource searchen_HK
dc.titleAn adaptive resource-based probabilistic search algorithm for P2P networksen_HK
dc.typeArticleen_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.1093/ietcom/e90-b.7.1631en_HK
dc.identifier.scopuseid_2-s2.0-67650816221en_HK
dc.identifier.hkuros152501en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-67650816221&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volumeE90-Ben_HK
dc.identifier.issue7en_HK
dc.identifier.spage1631en_HK
dc.identifier.epage1639en_HK
dc.identifier.isiWOS:000247839600006-
dc.publisher.placeUnited Kingdomen_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

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats