Distributed Algorithm to Locate Critical Nodes to Network Robustness based on Spectral Analysis

Details Distributed Algorithm to Locate Critical Nodes to Network Robustness based on Spectral Analysis Distributed Algorithm to Locate Critical Nodes to Network Robustness based on Spectral Analysis

2011-01-26

arxiv.org/abs/1101.5019v3

Computer Science

Networking and Internet Architecture

Proceedings of the 7th Latin American Network Operations and Management Symposium - LANOMS 2011, Quito, Ecuador, October 2011

Scientific paper

We propose an algorithm to locate the most critical nodes to network robustness. Such critical nodes may be thought of as those most related to the notion of network centrality. Our proposal relies only on a localized spectral analysis of a limited subnetwork centered at each node in the network. We also present a procedure allowing the navigation from any node towards a critical node following only local information computed by the proposed algorithm. Experimental results confirm the effectiveness of our proposal considering networks of different scales and topological characteristics.

Affiliated with

Also associated with

No associations

Rating

Distributed Algorithm to Locate Critical Nodes to Network Robustness based on Spectral Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distributed Algorithm to Locate Critical Nodes to Network Robustness based on Spectral Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Algorithm to Locate Critical Nodes to Network Robustness based on Spectral Analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-418732