File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Locating Highly Connected Nodes in P2P Networks with Heterogeneous Structures

TitleLocating Highly Connected Nodes in P2P Networks with Heterogeneous Structures
Authors
KeywordsDeliberate Attack
Largest Component
Peer-To-Peer
Random Walks
Scale-Free
Issue Date2009
Citation
Tsinghua Science And Technology, 2009, v. 14 n. 4, p. 465-469 How to Cite?
AbstractPeer-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 Identifierhttp://hdl.handle.net/10722/155530
ISSN
2015 Impact Factor: 1.063
2015 SCImago Journal Rankings: 0.420
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.issued2009en_US
dc.identifier.citationTsinghua Science And Technology, 2009, v. 14 n. 4, p. 465-469en_US
dc.identifier.issn1007-0214en_US
dc.identifier.urihttp://hdl.handle.net/10722/155530-
dc.description.abstractPeer-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.languageengen_US
dc.relation.ispartofTsinghua Science and Technologyen_US
dc.subjectDeliberate Attacken_US
dc.subjectLargest Componenten_US
dc.subjectPeer-To-Peeren_US
dc.subjectRandom Walksen_US
dc.subjectScale-Freeen_US
dc.titleLocating Highly Connected Nodes in P2P Networks with Heterogeneous Structuresen_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.1016/S1007-0214(09)70103-8en_US
dc.identifier.scopuseid_2-s2.0-67651094020en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-67651094020&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume14en_US
dc.identifier.issue4en_US
dc.identifier.spage465en_US
dc.identifier.epage469en_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