All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in 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>

  • Alternative codes found

    RIV/28943601:_____/14:#0000007

  • Result on the web

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

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/VG20122014086" target="_blank" >VG20122014086: Applied research of a metod of an efficient management of network security of data centers, servers and cloud services verified by practical measurements</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2014

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    International Journal of Network Management

  • ISSN

    1055-7148

  • e-ISSN

  • Volume of the periodical

    24

  • Issue of the periodical within the volume

    4

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    18

  • Pages from-to

    235-252

  • UT code for WoS article

    000339479100003

  • EID of the result in the Scopus database