Paper Info
Title
Identifying Skype nodes by NetFlow-based graph analysis
Abstract
In this paper we present an algorithm that is able to progressively discover nodes of a Skype overlay P2P network. Starting from a single, known Skype node, we can easily identify other Skype nodes in the network, through the analysis of widely available and standardized IPFIX (NetFlow) data. Instead of relying on the analysis of content characteristics or packet properties, we monitor connections of known Skype nodes in the network and then progressively discover other nodes through the analysis of their mutual contacts. We show that our results are comparable to the methods using more complex data analytics. The use of standardized input data allows for easy deployment onto real networks. Moreover, because this approach requires only short processing times, it scales very well in larger and higher speed networks.
Year
DOI
Venue
2012
10.1109/IWCMC.2012.6314278
IWCMC
Keywords
Field
DocType
skype nodes,skype overlay p2p network,netflow based graph analysis,data analytics,node discovery,higher speed networks,graph theory,peer-to-peer computing,ipfix,mutual contacts
Graph theory,Software deployment,Computer science,NetFlow,Network packet,Computer network,Complex data type,Power graph analysis,Overlay,Analytics,Distributed computing
Conference
ISSN
ISBN
Citations 
2376-6492
978-1-4577-1378-1
0
PageRank 
References 
Authors
0.34
9
2
Name
Order
Citations
PageRank
Jan Jusko132.41
Martin Rehak225128.57