File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Performance evaluation of adaptive probabilistic search in P2P networks

TitlePerformance evaluation of adaptive probabilistic search in P2P networks
Authors
KeywordsGenerating Function
P2p Networks
Probabilistic Forwarding
Qos
Issue Date2008
PublisherOxford University Press. The Journal's web site is located at http://ietcom.oxfordjournals.org/
Citation
Ieice Transactions On Communications, 2008, v. E91-B n. 4, p. 1172-1175 How to Cite?
AbstractThe overall performance of P2P-based file sharing applications is becoming increasingly important. Based on the Adaptive Resource-based Probabilistic Search algorithm (ARPS), which was previously proposed by the authors, a novel probabilistic search algorithm with QoS guarantees is proposed in this letter. The algorithm relies on generating functions to satisfy the user's constraints and to exploit the power-law distribution in the node degree. Simulation results demonstrate that it performs well under various P2P scenarios. The proposed algorithm provides guarantees on the search performance perceived by the user while minimizing the search cost. Furthermore, it allows different QoS levels, resulting in greater flexibility and scalability. Copyright © 2008 The Institute of Electronics, Information and Communication Engineers.
Persistent Identifierhttp://hdl.handle.net/10722/155529
ISSN
2015 Impact Factor: 0.3
2015 SCImago Journal Rankings: 0.184
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorZhang, Hen_US
dc.contributor.authorZhang, Len_US
dc.contributor.authorShan, Xen_US
dc.contributor.authorLi, VOKen_US
dc.date.accessioned2012-08-08T08:33:57Z-
dc.date.available2012-08-08T08:33:57Z-
dc.date.issued2008en_US
dc.identifier.citationIeice Transactions On Communications, 2008, v. E91-B n. 4, p. 1172-1175en_US
dc.identifier.issn0916-8516en_US
dc.identifier.urihttp://hdl.handle.net/10722/155529-
dc.description.abstractThe overall performance of P2P-based file sharing applications is becoming increasingly important. Based on the Adaptive Resource-based Probabilistic Search algorithm (ARPS), which was previously proposed by the authors, a novel probabilistic search algorithm with QoS guarantees is proposed in this letter. The algorithm relies on generating functions to satisfy the user's constraints and to exploit the power-law distribution in the node degree. Simulation results demonstrate that it performs well under various P2P scenarios. The proposed algorithm provides guarantees on the search performance perceived by the user while minimizing the search cost. Furthermore, it allows different QoS levels, resulting in greater flexibility and scalability. Copyright © 2008 The Institute of Electronics, Information and Communication Engineers.en_US
dc.languageengen_US
dc.publisherOxford University Press. The Journal's web site is located at http://ietcom.oxfordjournals.org/en_US
dc.relation.ispartofIEICE Transactions on Communicationsen_US
dc.subjectGenerating Functionen_US
dc.subjectP2p Networksen_US
dc.subjectProbabilistic Forwardingen_US
dc.subjectQosen_US
dc.titlePerformance evaluation of adaptive probabilistic search in P2P networksen_US
dc.typeArticleen_US
dc.identifier.emailLi, VOK:vli@eee.hku.hken_US
dc.identifier.authorityLi, VOK=rp00150en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1093/ietcom/e91-b.4.1172en_US
dc.identifier.scopuseid_2-s2.0-67651040829en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-67651040829&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volumeE91-Ben_US
dc.identifier.issue4en_US
dc.identifier.spage1172en_US
dc.identifier.epage1175en_US
dc.identifier.isiWOS:000255647900025-
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridZhang, H=9045330800en_US
dc.identifier.scopusauthoridZhang, L=11040255900en_US
dc.identifier.scopusauthoridShan, X=7101712454en_US
dc.identifier.scopusauthoridLi, VOK=7202621685en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats