On 3/20/06, Daniel Stutzbach <[EMAIL PROTECTED]> wrote: > ... > Resiliency depends on other features of the graph. If the small world > is also a power-law graph, for example, it is vulnerable to attacks on > the high-degree peers. The fact that the graph is a small world is > irrelevant.
true. thanks for mentioning this as the high degree node attacks are indeed a great way to cripple any of the power law networks. i suppose this highlights a prejudice of mine: that nodes within unstructured graphs scale according to capability (and thus high degrees and power laws emerge from aggregate node behavior) and this in turn is more resilient than highly structured networks which assign identifier space in a much more homogeneous and fragile manner. _______________________________________________ p2p-hackers mailing list p2p-hackers@zgp.org http://zgp.org/mailman/listinfo/p2p-hackers _______________________________________________ Here is a web page listing P2P Conferences: http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences
