TUD Logo

TUD Home » ... » Faculty of Computer Science » Research » Academic Talks

Faculty of Computer Science

Academic Talks

Search


Keywords:
extended search

Modeling Cafe:
Percolation in complex networks due to failure and attack

Academic talk by Bivas Mitra (ZIH, Abt. Innovative Methoden des Computing)

22nd Oct 2007, 2.00 PM, INF E009

The effect of percolation in complex graphs is an important problem in computer networks. Removal of a significant fraction of nodes may disintegrate the network into small disconnected components. The number of removed nodes required to break down the network heavily depends upon the nature of the disrupting events. The disrupting events may be categorized as random failure and attacks targeted toward the ‘important’ nodes. Our study of percolation in networks focuses upon the two subproblems
1. network robustness in face of disrupting events,
2. topology change due to node removal.
We propose an analytical framework to assess the robustness of complex networks in face of various disrupting events. As a practical application of our theory, we examine the robustness of superpeer networks for user churn and targeted attack. In superpeer networks, superpeer nodes with higher bandwidth and connectivity connect to each other forming an upper level in the network hierarchy. On the other hand, each superpeer is connected with a set of client peers which form a lower level of the network hierarchy. We formally model the superpeer networks with the help of bimodal degree distributions and churn/attack with the help of graph dynamics. Furthermore, we calculate the degree distribution resulting from changes in the superpeer network structure due to failure and attack. The results obtained from the theoretical analysis are validated through simulation.



current announcements


Subscribe to the talk announcements news feed: RSS

Last modified: 26th Sep 2022, 11.47 PM
Author: Webmaster