Dr. David Eckhoff

I am a Principal Scientist and the Director of the MoVES Lab at TUMCREATE, Singapore. My research focuses on future transportation technologies, simulation, the smart city, and privacy.

David Eckhoff, "Entwicklung von Anomaliedetektionsalgorithmen basierend auf Netflowdaten," Bachelor Thesis, Department of Computer Science, University of Erlangen-Nuremberg, September 2008. (Advisors: Tobias Limmer and Falko Dressler)

Abstract

Anomaly detection is an important tool to detect and respond to unknown malicious software in IP networks. Networks experiencing high traffic volume are not suited for real time detection using in depth packet analysis due to the required processing power. Flow analysis, i.e. analysing aggregated packet flows rather than packet content, presents a suitable alternative for real time anomaly detection in these high throughput networks. First an existing worm detection algorithm that classifies hosts based on the rate of new outbound connections is implemented and evaluated. Additionally the concept of aggregating hosts to subnets to perform an efficient analysis of the individual aggregated subnets based on various traffic properties to detect anomalies is proposed. It is then shown that worm detection based on the rate of outbound connections has several weaknesses. The second proposed approach detects several anomalies and is more suitable for realtime monitoring large networks.

Quick access

BibTeX BibTeX

Contact

David Eckhoff

BibTeX reference

@phdthesis{eckhoff2008entwicklung,
    author = {Eckhoff, David},
    school = {University of Erlangen-Nuremberg},
    title = {{Entwicklung von Anomaliedetektionsalgorithmen basierend auf Netflowdaten}},
    year = {2008},
    month = {September},
    type = {Bachelor Thesis},
    advisor = {Limmer, Tobias and Dressler, Falko},
    institution = {Department of Computer Science},
    location = {Erlangen, Germany},
   }
   
   

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