# 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… Expand

#### 131 Citations

Analysing connectivity patterns and centrality metrics for opportunistic networks

- Computer Science
- 2017 International Conference on Communication, Computing and Digital Systems (C-CODE)
- 2017

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. Expand

Process-Driven Betweenness Centrality Measures

- Computer Science
- ENIC
- 2017

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. Expand

Effective co-betweenness centrality computation

- Computer Science
- WSDM
- 2014

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. Expand

Betweenness centrality and resistance distance in communication networks

- Computer Science
- IEEE Network
- 2010

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. Expand

Pairwise Co-betweenness for Several Types of Network

- Computer Science
- J. Networks
- 2015

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. Expand

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

- Physics, Medicine
- PloS one
- 2013

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. Expand

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

- 2013

A number of centrality measures are available to determine the relative importance of a node in a complex network, and betweenness is prominent among them. However, the existing centrality measures… Expand

Understanding Information Centrality Metric: A Simulation Approach

- Computer Science, Mathematics
- ArXiv
- 2018

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. Expand

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

- Computer Science
- IEEE INFOCOM 2018 - IEEE Conference on Computer Communications
- 2018

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. Expand

A Centrality Entropy Maximization Problem in Shortest Path Routing Networks

- Computer Science
- Comput. Networks
- 2016

This paper investigates an interesting case of the inverse shortest path problem using the concept of network centrality, and a heuristic approach is proposed to obtain a centrality distribution that maximizes the entropy. Expand

#### References

SHOWING 1-10 OF 52 REFERENCES

Centrality and network flow

- Mathematics, Computer Science
- Soc. Networks
- 2005

A key claim made in this paper is that centrality measures can be regarded as generating expected values for certain kinds of node outcomes given implicit models of how traffic flows, and that this provides a new and useful way of thinking about centrality. Expand

Congestion and Centrality in Traffic Flow on Complex Networks

- Mathematics, Physics
- Adv. Complex Syst.
- 2003

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. Expand

A measure of betweenness centrality based on random walks

- Computer Science, Mathematics
- Soc. Networks
- 2005

A betweenness measure is proposed that relaxes this assumption that information spreads only along those shortest paths, including contributions from essentially all paths between nodes, not just the shortest, although it still gives more weight to short paths. Expand

Fast algorithm for successive computation of group betweenness centrality.

- Mathematics, Medicine
- Physical review. E, Statistical, nonlinear, and soft matter physics
- 2007

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. Expand

A faster algorithm for betweenness centrality

- Mathematics
- 2001

Motivated by the fast‐growing need to compute centrality indices on large, yet very sparse, networks, new algorithms for betweenness are introduced in this paper. They require O(n + m) space and run… Expand

A Graph-theoretic perspective on centrality

- Mathematics, Computer Science
- Soc. Networks
- 2006

This paper develops a unified framework for the measurement of centrality and shows centrality to be intimately connected with the cohesive subgroup structure of a network. Expand

Centrality in valued graphs: A measure of betweenness based on network flow

- Mathematics
- 1991

A new measure of centrality, C,, is introduced. It is based on the concept of network flows. While conceptually similar to Freeman’s original measure, Ca, the new measure differs from the original in… Expand

Better Approximation of Betweenness Centrality

- Mathematics, Computer Science
- ALENEX
- 2008

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. Expand

The centrality of groups and classes

- Sociology
- 1999

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… Expand

Finding the most prominent group in complex networks

- Computer Science
- AI Commun.
- 2007

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. Expand