Affiliation:
1. Ben-Gurion University of the Negev, Beer-Sheva, Israel
Abstract
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 strategies.
We present algorithms for computing RBC of all the individual vertices in the network and algorithms for computing the RBC of a given group of vertices, where the RBC of a group of vertices represents their potential to collaboratively monitor and control data flows in the network. Two types of collaborations are considered: (i) conjunctive—the group is a sequences of vertices controlling traffic where all members of the sequence process the traffic in the order defined by the sequence and (ii) disjunctive—the group is a set of vertices controlling traffic where at least one member of the set processes the traffic. The algorithms presented in this paper also take into consideration different sampling rates of network monitors, accommodate arbitrary communication patterns between the vertices (traffic matrices), and can be applied to groups consisting of vertices and/or edges.
For the cases of routing strategies that depend on both the source and the target of the message, we present algorithms with time complexity of
O
(
n
2
m
) where
n
is the number of vertices in the network and
m
is the number of edges in the routing tree (or the routing directed acyclic graph (DAG) for the cases of multi-path routing strategies). The time complexity can be reduced by an order of
n
if we assume that the routing decisions depend solely on the target of the messages.
Finally, we show that a preprocessing of
O
(
n
2
m
) time, supports computations of RBC of sequences in
O
(
kn
) time and computations of RBC of sets in
O
(
n
3
n
) time, where
k
in the number of vertices in the sequence or the set.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference39 articles.
1. Anthonisse J. M. 1971. The rush in a directed graph. Tech. rep. BN 9/71 Stichting Mathematisch Centrum Amsterdam The Netherlands. Anthonisse J. M. 1971. The rush in a directed graph. Tech. rep. BN 9/71 Stichting Mathematisch Centrum Amsterdam The Netherlands.
2. Emergence of Scaling in Random Networks
3. Scale-free characteristics of random networks: the topology of the world-wide web
4. Betweenness centrality in large complex networks. The;Barthélemy M.;Europ. Phys. J. B -- Condensed Matter,2004
5. Robustness and Vulnerability of Scale-Free Random Graphs
Cited by
122 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献