On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Finding the most prominent group in complex networks
AI Communications - Network Analysis in Natural Sciences and Engineering
Reformulating the monitor placement problem: optimal network-wide sampling
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Incremental deployment of network monitors based on Group Betweenness Centrality
Information Processing Letters
Locating network monitors: Complexity, heuristics, and coverage
Computer Communications
Modeling betweenness for question answering
ESAIR '10 Proceedings of the third workshop on Exploiting semantic annotations in information retrieval
Betweenness centrality and resistance distance in communication networks
IEEE Network: The Magazine of Global Internetworking
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Some results on approximate 1-median selection in metric spaces
Theoretical Computer Science
The Trilemma of Network Analysis
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Fast approximation of betweenness centrality through sampling
Proceedings of the 7th ACM international conference on Web search and data mining
Effective co-betweenness centrality computation
Proceedings of the 7th ACM international conference on Web search and data mining
Betweenness estimation in OLSR-based multi-hop networks for distributed filtering
Journal of Computer and System Sciences
Crowdsourcing tasks to social networks in BPEL4People
World Wide Web
| Hi-index | 0.02 |
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(n2m) 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(n2m) time, supports computations of RBC of sequences in O(kn) time and computations of RBC of sets in O(n3n) time, where k in the number of vertices in the sequence or the set.