Literature Database Entry

regnet2009evaluierung

Simon Regnet, "Evaluierung und Implementierung eines Detektors von Peer-to-Peer Netzwerkverkehr," Bachelor Thesis, Department of Computer Science, Friedrich–Alexander University of Erlangen–Nuremberg (FAU), May 2009. (Advisors: Tobias Limmer and Falko Dressler)

Abstract

It is emanated that most of the internet traffic today is produced by peer-to-peer protocols. The file sharing network Napster was the first popular representative of this kind of protocols. It was developed to share own files with other people around the world. However it was used to download copyrighted material such as music or movies. The concerned industries proceeded against the use of Napster with success. Therefore the operators of Napster had to shutdown their server. This caused the breakdown of the whole network. But other peer-to-peer protocols have been established. Developers invented new features so that the use of these protocols can be disguised. Many of the current detection techniques like deep packet inspection or port detection can't recognize the use of them. Therefore another technique to detect the use of peer-to-peer protocols will be discussed in this thesis. It is based on the recognition of specific behavior in their connections. A former thesis already created nine criteria to detect peer-to-peer protocols due to their connection behavior. This thesis can be seen as a continuation of it. It evaluates these criteria and shows an implementation as a module for the Vermont project which uses them. This module will be compared to the intrusion detection and prevention system Snort. So it can be determined if it is able to use this module for peer-to-peer detection.

Quick access

BibTeX BibTeX

Contact

Simon Regnet

BibTeX reference

@phdthesis{regnet2009evaluierung,
    author = {Regnet, Simon},
    title = {{Evaluierung und Implementierung eines Detektors von Peer-to-Peer Netzwerkverkehr}},
    advisor = {Limmer, Tobias and Dressler, Falko},
    institution = {Department of Computer Science},
    location = {Erlangen, Germany},
    month = {5},
    school = {Friedrich--Alexander University of Erlangen--Nuremberg (FAU)},
    type = {Bachelor Thesis},
    year = {2009},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.

Last modified: 2024-04-18