The articulation points and bridges of a connected network are, respectively, the vertices and the edges whose removal disconnects the network. However, not all the articulation points (resp. bridges) are equal: from the graph theoretic perspective, there is no difference whether the removal of a vertex (resp. bridge) disconnects only one vertex from the rest of the network, or it cuts the network in two pieces. But in the monitoring of a huge network, it makes a difference. We present a real-time algorithm, analyzed in the (semi-)streaming model of computation, that is able to identify a core subset of the articulation points (resp. bridges), i.e. the ones whose removal has a big impact on the network: these are the critical nodes (resp. edges) of the network. We complement our work with an experimental evaluation of the algorithm against ten years of samples of the Autonomous System network, that confirms the effectiveness of our approach.

Real-time Analysis of Critical Nodes in Network Cores / Ausiello, Giorgio; D., Firmani; Laura, Luigi. - (2012), pp. 42-46. (Intervento presentato al convegno 8th IEEE International Wireless Communications and Mobile Computing Conference, IWCMC 2012 tenutosi a Limassol, Cyprus) [10.1109/IWCMC.2012.6314175].

Real-time Analysis of Critical Nodes in Network Cores

AUSIELLO, Giorgio;D. Firmani;LAURA, Luigi
2012

Abstract

The articulation points and bridges of a connected network are, respectively, the vertices and the edges whose removal disconnects the network. However, not all the articulation points (resp. bridges) are equal: from the graph theoretic perspective, there is no difference whether the removal of a vertex (resp. bridge) disconnects only one vertex from the rest of the network, or it cuts the network in two pieces. But in the monitoring of a huge network, it makes a difference. We present a real-time algorithm, analyzed in the (semi-)streaming model of computation, that is able to identify a core subset of the articulation points (resp. bridges), i.e. the ones whose removal has a big impact on the network: these are the critical nodes (resp. edges) of the network. We complement our work with an experimental evaluation of the algorithm against ten years of samples of the Autonomous System network, that confirms the effectiveness of our approach.
2012
8th IEEE International Wireless Communications and Mobile Computing Conference, IWCMC 2012
Clustering algorithms , Indexes , Topology , Partitioning algorithms , Vectors , Algorithm design and analysis , Kernel
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Real-time Analysis of Critical Nodes in Network Cores / Ausiello, Giorgio; D., Firmani; Laura, Luigi. - (2012), pp. 42-46. (Intervento presentato al convegno 8th IEEE International Wireless Communications and Mobile Computing Conference, IWCMC 2012 tenutosi a Limassol, Cyprus) [10.1109/IWCMC.2012.6314175].
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/759808
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
social impact