File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICC.2009.5199194
- Scopus: eid_2-s2.0-70449504406
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Modeling random walk search algorithms in unstructured P2P networks with social information
| Title | Modeling random walk search algorithms in unstructured P2P networks with social information |
|---|---|
| Authors | |
| Issue Date | 2009 |
| Citation | Ieee International Conference On Communications, 2009 How to Cite? |
| Abstract | Random 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 Identifier | http://hdl.handle.net/10722/158604 |
| ISSN | 2020 SCImago Journal Rankings: 0.451 |
| References |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Xie, J | en_US |
| dc.contributor.author | Lui, KS | en_US |
| dc.date.accessioned | 2012-08-08T09:00:27Z | - |
| dc.date.available | 2012-08-08T09:00:27Z | - |
| dc.date.issued | 2009 | en_US |
| dc.identifier.citation | Ieee International Conference On Communications, 2009 | en_US |
| dc.identifier.issn | 0536-1486 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10722/158604 | - |
| dc.description.abstract | Random 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.language | eng | en_US |
| dc.relation.ispartof | IEEE International Conference on Communications | en_US |
| dc.title | Modeling random walk search algorithms in unstructured P2P networks with social information | en_US |
| dc.type | Conference_Paper | en_US |
| dc.identifier.email | Lui, KS:kslui@eee.hku.hk | en_US |
| dc.identifier.authority | Lui, KS=rp00188 | en_US |
| dc.description.nature | link_to_subscribed_fulltext | en_US |
| dc.identifier.doi | 10.1109/ICC.2009.5199194 | en_US |
| dc.identifier.scopus | eid_2-s2.0-70449504406 | en_US |
| dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-70449504406&selection=ref&src=s&origin=recordpage | en_US |
| dc.identifier.scopusauthorid | Xie, J=7402994697 | en_US |
| dc.identifier.scopusauthorid | Lui, KS=7103390016 | en_US |
| dc.identifier.issnl | 0536-1486 | - |