Research Article
Revealing Cooperating Hosts by Connection Graph Analysis
@INPROCEEDINGS{10.1007/978-3-642-36883-7_15, author={Jan Jusko and Martin Rehak}, title={Revealing Cooperating Hosts by Connection Graph Analysis}, proceedings={Security and Privacy in Communication Networks. 8th International ICST Conference, SecureComm 2012, Padua, Italy, September 3-5, 2012. Revised Selected Papers}, proceedings_a={SECURECOMM}, year={2013}, month={2}, keywords={}, doi={10.1007/978-3-642-36883-7_15} }- Jan Jusko
Martin Rehak
Year: 2013
Revealing Cooperating Hosts by Connection Graph Analysis
SECURECOMM
Springer
DOI: 10.1007/978-3-642-36883-7_15
Abstract
In this paper we present an algorithm that is able to progressively discover nodes cooperating in a P2P network. Starting from a single known node, we can easily identify other nodes in the peer-to-peer 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 nodes in the network and then progressively discover other nodes through the analysis of their mutual contacts. We show that our method is able to discover all cooperating nodes in many P2P networks. 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.
