File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Modeling random walk search algorithms in unstructured P2P networks with social information

TitleModeling random walk search algorithms in unstructured P2P networks with social information
Authors
Issue Date2009
Citation
Ieee International Conference On Communications, 2009 How to Cite?
AbstractRandom walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algorithms on the Internet. In this paper, we model the random walk algorithm in peer-to-peer networks when social information is available. We define the social relationship between two nodes as the knowledge about the resources the other node possesses. We mathematically show that the social information can benefit the searching by extending the existing random walk search model. ©2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/158604
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorXie, Jen_US
dc.contributor.authorLui, KSen_US
dc.date.accessioned2012-08-08T09:00:27Z-
dc.date.available2012-08-08T09:00:27Z-
dc.date.issued2009en_US
dc.identifier.citationIeee International Conference On Communications, 2009en_US
dc.identifier.issn0536-1486en_US
dc.identifier.urihttp://hdl.handle.net/10722/158604-
dc.description.abstractRandom walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algorithms on the Internet. In this paper, we model the random walk algorithm in peer-to-peer networks when social information is available. We define the social relationship between two nodes as the knowledge about the resources the other node possesses. We mathematically show that the social information can benefit the searching by extending the existing random walk search model. ©2009 IEEE.en_US
dc.languageengen_US
dc.relation.ispartofIEEE International Conference on Communicationsen_US
dc.titleModeling random walk search algorithms in unstructured P2P networks with social informationen_US
dc.typeConference_Paperen_US
dc.identifier.emailLui, KS:kslui@eee.hku.hken_US
dc.identifier.authorityLui, KS=rp00188en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/ICC.2009.5199194en_US
dc.identifier.scopuseid_2-s2.0-70449504406en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-70449504406&selection=ref&src=s&origin=recordpageen_US
dc.identifier.scopusauthoridXie, J=7402994697en_US
dc.identifier.scopusauthoridLui, KS=7103390016en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats