Revealing Cooperating Hosts by Connection Graph Analysis

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00200151" target="_blank" >RIV/68407700:21230/13:00200151 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007/978-3-642-36883-7_15" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-642-36883-7_15</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-36883-7_15" target="_blank" >10.1007/978-3-642-36883-7_15</a>

Result language
angličtina
Original language name
Revealing Cooperating Hosts by Connection Graph Analysis
Original language description
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, itscales very well in larger and higher speed networks.
Czech name
—
Czech description
—

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)