Identifying peer-to-peer communities in the network by connection graph analysis

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00224207" target="_blank" >RIV/68407700:21230/14:00224207 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/28943601:_____/14:#0000007

Výsledek na webu

<a href="http://onlinelibrary.wiley.com/doi/10.1002/nem.1862/abstract" target="_blank" >http://onlinelibrary.wiley.com/doi/10.1002/nem.1862/abstract</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1002/nem.1862" target="_blank" >10.1002/nem.1862</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Identifying peer-to-peer communities in the network by connection graph analysis

Popis výsledku v původním jazyce

In this paper we present a unified solution to identify peer-to-peer (P2P) communities operating in the network. We propose an algorithm that is able to progressively discover nodes cooperating in a P2P network and to identify that P2P network. Startingfrom a single known node, we can easily identify other nodes in the P2P 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 cooperating nodes in many P2P networks and present the real computational requirements of the algorithm on a large network. The use of standardized input data allows for easy deployment onto real networks.

Název v anglickém jazyce

Identifying peer-to-peer communities in the network by connection graph analysis

Popis výsledku anglicky

In this paper we present a unified solution to identify peer-to-peer (P2P) communities operating in the network. We propose an algorithm that is able to progressively discover nodes cooperating in a P2P network and to identify that P2P network. Startingfrom a single known node, we can easily identify other nodes in the P2P 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 cooperating nodes in many P2P networks and present the real computational requirements of the algorithm on a large network. The use of standardized input data allows for easy deployment onto real networks.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/VG20122014086" target="_blank" >VG20122014086: Aplikovaný výzkum metody pro efektivní management síťové bezpečnosti datových center, ochrany cloud serverů a služeb ověřený praktickým měřením</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2014

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 periodika

International Journal of Network Management

ISSN

1055-7148

e-ISSN

—

Svazek periodika

24

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

18

Strana od-do

235-252

Kód UT WoS článku

000339479100003

EID výsledku v databázi Scopus

—