Revealing Cooperating Hosts by Connection Graph Analysis

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Revealing Cooperating Hosts by Connection Graph Analysis

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Revealing Cooperating Hosts by Connection Graph Analysis

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2013

Kód důvěrnosti údajů

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

Název statě ve sborníku

Security and Privacy in Communication Networks

ISBN

978-3-642-36882-0

ISSN

1867-8211

e-ISSN

—

Počet stran výsledku

15

Strana od-do

241-255

Název nakladatele

Springer

Místo vydání

Berlin

Místo konání akce

Padua

Datum konání akce

3. 9. 2012

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—