Schiller, Benjamin ; Strufe, Thorsten (2013)
Dynamic Network Analyzer - Building a Framework for the Graph-theoretic Analysis of Dynamic Networks.
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (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).
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2013 |
| Autor(en): | Schiller, Benjamin ; Strufe, Thorsten |
| Art des Eintrags: | Bibliographie |
| Titel: | Dynamic Network Analyzer - Building a Framework for the Graph-theoretic Analysis of Dynamic Networks |
| Sprache: | Deutsch |
| Publikationsjahr: | Juli 2013 |
| Buchtitel: | Summersim |
| Kurzbeschreibung (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). |
| Freie Schlagworte: | Networks, Graph theory, Measurements, Algorithm design and analysis |
| ID-Nummer: | TUD-CS-2013-0160 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik > Peer-to-Peer Netzwerke 20 Fachbereich Informatik |
| Hinterlegungsdatum: | 27 Jul 2016 16:32 |
| Letzte Änderung: | 17 Mai 2018 21:50 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum