Routing betweenness centrality

@article{Dolev2010RoutingBC,
  title={Routing betweenness centrality},
  author={Shlomi Dolev and Yuval Elovici and Rami Puzis},
  journal={J. ACM},
  year={2010},
  volume={57},
  pages={25:1-25:27}
}
Betweenness-Centrality measure is often used in social and computer communication networks to estimate the potential monitoring and control capabilities a vertex may have on data flowing in the network. In this article, we define the Routing Betweenness Centrality (RBC) measure that generalizes previously well known Betweenness measures such as the Shortest Path Betweenness, Flow Betweenness, and Traffic Load Centrality by considering network flows created by arbitrary loop-free routing… 

Figures and Tables from this paper

Analysing connectivity patterns and centrality metrics for opportunistic networks

This paper has analysed metrics that can be used to simplify the centrality measure computation in opportunistic networks and investigated the relationship between node (ego) characteristics with centrality measures that are computed using novel network transformations.

Process-Driven Betweenness Centrality Measures

This work uses existing data sets, human paths through the Wikipedia network, human solutions of a game in the game’s state space, and passengers’ travels between US American airports in order to test the assumptions of the betweenness centrality for these processes, and derive several variants of a “process-driven betweennessCentrality” using information about the network process.

Effective co-betweenness centrality computation

This paper presents efficient algorithms for co-betweenness centrality computation of any set or sequence of vertices in weighted and unweighted networks and develops effective methods forCo- betweenness centralism computation of sets and sequences of edges.

Betweenness centrality and resistance distance in communication networks

It is shown that the total resistance distance (network criticality) of a graph has very useful interpretations in the context of communication networks; therefore, it is proposed to use network criticality as the main objective function, and guidelines to design the control loops to minimize networkcriticality are provided.

Pairwise Co-betweenness for Several Types of Network

This paper analyzes the pairwise co-betweenness of WS network model with the different reconnection probability which including rule, smallworld and random network, and obtains vertex-induced subgraph with the highest betweenness vertices, and the edge- induced subgraphwith the highest pairwiseCo- Betweenness edges.

Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks

A new measure is proposed that quantifies relative impact of nodes based on their topological connectivity, as well as their percolation states, that can be extended to include random walk based definitions and its computational complexity is shown to be of the same order as that of betweenness centrality.

Title Percolation Centrality : Quantifying Graph-Theoretic Impact ofNodes during Percolation in Networks

Percolation centrality is proposed, a new measure that quantifies relative impact of nodes based on their topological connectivity, as well as their percolation states, in networks and its computational complexity is shown to be of the same order as that of betweenness centrality.

Understanding Information Centrality Metric: A Simulation Approach

This paper creates a simulation of the flow of information in a network, and investigates the relation of information centrality as well as other network centralities, like betweenness, closeness and eigenvector along with the outcome of simulations with information flowing through walks rather than paths, trails or geodesics.

On the Distributed Computation of Load Centrality and its Application to DV Routing

This paper considers load centrality, a metric that usually converges to betweenness, and presents the first distributed and exact algorithm to compute it, and it is shown it is directly applicable-with minimal modifications-to any distance-vector routing protocol based on Bellman-Ford.

Saturated Betweenness Centrality Sets of Vertices in Graphs

An algorithm aiming to detect sets of vertices of minimal size that have a high level of control of flow of information is introduced that is based on the notion of saturated betweenness centrality set.
...

References

SHOWING 1-10 OF 44 REFERENCES

Centrality and network flow

Congestion and Centrality in Traffic Flow on Complex Networks

It is found that, even at low traffic densities, the dynamical measure of traffic density has a non-trivial dependence on the static centrality (quantified by "betweenness centrality"), where non-central vertices get a comparatively large portion of the traffic.

Fast algorithm for successive computation of group betweenness centrality.

A method for rapid computation of group betweenness centrality whose running time (after preprocessing) does not depend on network size and may assist in finding further properties of complex networks and may open a wide range of research opportunities.

A faster algorithm for betweenness centrality

New algorithms for betweenness are introduced in this paper and require O(n + m) space and run in O(nm) and O( nm + n2 log n) time on unweighted and weighted networks, respectively, where m is the number of links.

Better Approximation of Betweenness Centrality

A framework for unbiased approximation of betweenness is proposed that generalizes a previous approach by Brandes and yields significantly better approximation than before for many real world inputs and good approximations for the betweenness of unimportant nodes.

The centrality of groups and classes

This paper extends the standard network centrality measures of degree, closeness and betweenness to apply to groups and classes as well as individuals. The group centrality measures will enable

Finding the most prominent group in complex networks

Empirical evaluation suggests that the greedy algorithm results were negligibly below the optimal result and both algorithms performed better on scale-free networks: heuristic search was faster and the greedy algorithms produced more accurate results.