File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/S1007-0214(09)70103-8
- Scopus: eid_2-s2.0-67651094020
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Locating Highly Connected Nodes in P2P Networks with Heterogeneous Structures
Title | Locating Highly Connected Nodes in P2P Networks with Heterogeneous Structures |
---|---|
Authors | |
Keywords | Deliberate Attack Largest Component Peer-To-Peer Random Walks Scale-Free |
Issue Date | 2009 |
Citation | Tsinghua Science And Technology, 2009, v. 14 n. 4, p. 465-469 How to Cite? |
Abstract | Peer-to-peer (P2P) networks aggregate enormous storage and processing resources while minimizing entry and scaling costs. Gnutella-like P2P networks are complex heterogeneous networks, in which the underlying overlay topology has a power-law node degree distribution. While scale-free networks have great robustness against random failures, they are vulnerable to deliberate attacks where highly connected nodes are eliminated. Since high degree nodes play an important role in maintaining the connectivity, this paper presents an algorithm based on random walks to locate high degree nodes in P2P networks. Simulations demonstrate that the algorithm performs well in various scenarios and that heterogeneous P2P networks are very sensitive to deliberate attacks. © 2009 Tsinghua University Press. |
Persistent Identifier | http://hdl.handle.net/10722/155530 |
ISSN | 2023 Impact Factor: 5.2 2023 SCImago Journal Rankings: 1.580 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, H | en_US |
dc.contributor.author | Zhang, L | en_US |
dc.contributor.author | Shan, X | en_US |
dc.contributor.author | Li, VOK | en_US |
dc.date.accessioned | 2012-08-08T08:33:57Z | - |
dc.date.available | 2012-08-08T08:33:57Z | - |
dc.date.issued | 2009 | en_US |
dc.identifier.citation | Tsinghua Science And Technology, 2009, v. 14 n. 4, p. 465-469 | en_US |
dc.identifier.issn | 1007-0214 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/155530 | - |
dc.description.abstract | Peer-to-peer (P2P) networks aggregate enormous storage and processing resources while minimizing entry and scaling costs. Gnutella-like P2P networks are complex heterogeneous networks, in which the underlying overlay topology has a power-law node degree distribution. While scale-free networks have great robustness against random failures, they are vulnerable to deliberate attacks where highly connected nodes are eliminated. Since high degree nodes play an important role in maintaining the connectivity, this paper presents an algorithm based on random walks to locate high degree nodes in P2P networks. Simulations demonstrate that the algorithm performs well in various scenarios and that heterogeneous P2P networks are very sensitive to deliberate attacks. © 2009 Tsinghua University Press. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | Tsinghua Science and Technology | en_US |
dc.subject | Deliberate Attack | en_US |
dc.subject | Largest Component | en_US |
dc.subject | Peer-To-Peer | en_US |
dc.subject | Random Walks | en_US |
dc.subject | Scale-Free | en_US |
dc.title | Locating Highly Connected Nodes in P2P Networks with Heterogeneous Structures | en_US |
dc.type | Article | en_US |
dc.identifier.email | Li, VOK:vli@eee.hku.hk | en_US |
dc.identifier.authority | Li, VOK=rp00150 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1016/S1007-0214(09)70103-8 | en_US |
dc.identifier.scopus | eid_2-s2.0-67651094020 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-67651094020&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 14 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.spage | 465 | en_US |
dc.identifier.epage | 469 | en_US |
dc.identifier.scopusauthorid | Zhang, H=9045330800 | en_US |
dc.identifier.scopusauthorid | Zhang, L=11040255900 | en_US |
dc.identifier.scopusauthorid | Shan, X=7101712454 | en_US |
dc.identifier.scopusauthorid | Li, VOK=7202621685 | en_US |
dc.identifier.issnl | 1007-0214 | - |