TU Darmstadt / ULB / TUbiblio

Dynamic Network Analyzer - Building a Framework for the Graph-theoretic Analysis of Dynamic Networks

Schiller, Benjamin and Strufe, Thorsten (2013):
Dynamic Network Analyzer - Building a Framework for the Graph-theoretic Analysis of Dynamic Networks.
In: Summersim, [Conference or Workshop Item]

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 re-computing 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).

Item Type: Conference or Workshop Item
Erschienen: 2013
Creators: Schiller, Benjamin and Strufe, Thorsten
Title: Dynamic Network Analyzer - Building a Framework for the Graph-theoretic Analysis of Dynamic Networks
Language: German
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 re-computing 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).

Title of Book: Summersim
Uncontrolled Keywords: Networks, Graph theory, Measurements, Algorithm design and analysis
Divisions: 20 Department of Computer Science > Peer-to-Peer Netzwerke
20 Department of Computer Science
Date Deposited: 27 Jul 2016 16:32
Identification Number: TUD-CS-2013-0160
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details