TU Berlin

Main document

Literature Database Entry


Simon Regnet, "Multithreading Optimization of the Monitoring-Framework Vermont," Master's Thesis, Department of Computer Science, Friedrich–Alexander University of Erlangen–Nuremberg (FAU), September 2010. (Advisors: Tobias Limmer and Falko Dressler)


It is important to analyze traffic in a computer network. Vermont is an open-source monitoring framework. It is mainly used to create flow data of captured network traffic. This flow data can be analyzed to detect anomalies in the network, like port scanners or other attacks. The architecture of vermont is based on modules. Each module has its own task and mutexes, communicates with other modules. Some of the modules are running in their own thread. So the communication between mdoules is also a communication between threads. This communication has to be synchronized. The current version of Vermont is using and semaphores to synchronize these threads. However, there are lock-free algorithms which are more efficient in this case. This thesis implements several lock-free queue implementations in Vermont and Vermont., performs a thorough performance evaluation. It shows the better performance of the lock-free algorithms compared to current lock-based version of

Quick access

BibTeX BibTeX


Simon Regnet

BibTeX reference

    author = {Regnet, Simon},
    title = {{Multithreading Optimization of the Monitoring-Framework Vermont}},
    advisor = {Limmer, Tobias and Dressler, Falko},
    institution = {Department of Computer Science},
    location = {Erlangen, Germany},
    month = {9},
    school = {Friedrich--Alexander University of Erlangen--Nuremberg (FAU)},
    type = {Master's Thesis},
    year = {2010},

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.