| Autor: |
Natu, Maitreya, Sadaphal, Vaishali, Patil, Sangameshwar, Mehrotra, Ankit |
| Zdroj: |
Distributed Computing & Networking (9783642176784); 2011, p239-250, 12p |
| Abstrakt: |
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We present techniques to identify frequently occurring sub-graphs within this temporal sequence of communication graphs. We argue that identification of such frequently occurring sub-graphs can provide many useful insights about the functioning of the system. We demonstrate how the existing frequent sub-graph discovery algorithms can be modified for the domain of communication graphs in order to provide computationally light-weight and accurate solutions. We present two algorithms for extracting frequent communication sub-graphs and present a detailed experimental evaluation to prove the correctness and efficiency of the proposed algorithms. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
