• DocumentCode
    573843
  • Title

    Identifying Skype nodes by NetFlow-based graph analysis

  • Author

    Jusko, Jan ; Rehak, Martin

  • Author_Institution
    Fac. of Electr. Eng., Czech Tech. Univ. in Prague, Prague, Czech Republic
  • fYear
    2012
  • fDate
    27-31 Aug. 2012
  • Firstpage
    636
  • Lastpage
    641
  • Abstract
    In this paper we present an algorithm that is able to progressively discover nodes of a Skype overlay P2P network. Starting from a single, known Skype node, we can easily identify other Skype nodes in the 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 Skype nodes in the network and then progressively discover other nodes through the analysis of their mutual contacts. We show that our results are comparable to the methods using more complex data analytics. 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.
  • Keywords
    graph theory; peer-to-peer computing; IPFIX; NetFlow based graph analysis; Skype nodes; Skype overlay P2P network; data analytics; higher speed networks; mutual contacts; node discovery; peer-to-peer computing; Detection algorithms; Image edge detection; Logic gates; Peer to peer computing; Protocols;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications and Mobile Computing Conference (IWCMC), 2012 8th International
  • Conference_Location
    Limassol
  • Print_ISBN
    978-1-4577-1378-1
  • Type

    conf

  • DOI
    10.1109/IWCMC.2012.6314278
  • Filename
    6314278