Dynamic network analyzer building a framework for the graph-theoretic analysis of dynamic networks

Authors:
Benjamin Schiller;Thorsten Strufe
Affiliations:
P2P Networks - TU Darmstadt;P2P Networks - TU Darmstadt
Venue:
Proceedings of the 2013 Summer Computer Simulation Conference
Year:
2013

Citing 3
Cited 0

Models and issues in data stream systems

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis

IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Pregel: a system for large-scale graph processing

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the rise of online social networks and other highly dynamic system, the need for the analysis of their structural properties has grown in the last years. While the re-computation of graph-theoretic metrics is feasible for investigating a small set of static system snapshots, this approach is unfit for the application in highly dynamic systems where we aim at frequent property updates. Based on the concept of data streams, new algorithms have been developed that update the computed properties based on changes instead of recomputing them regularly. While there exists a plethora of frameworks and libraries for the analysis of static networks, there is currently no framework for the graph-theoretic analysis and development of new algorithms for dynamic networks. In this paper, we discuss a set of requirements a framework must meet to implement the general workflow for analyzing dynamic networks. We then introduce the architecture of a first prototype for such a framework, the Dynamic Network Analyzer (DNA).