Literature Database Entry

lochschmied2005signaling

Alexander Lochschmied, "Signaling Pathways in Secured Network Environments," Master's Thesis, Department of Computer Science, Friedrich–Alexander University of Erlangen–Nuremberg (FAU), July 2005. (Advisor: Falko Dressler)

Abstract

Die rasant steigende Nutzung von Netzwerken, insbesondere des Internets, mit der damit verbundenen Zunahme vom immer ausgefeilteren und immer leichter durchführbaren Angriffen auf die Netze, stellt eine ernste Gefahr dar. Um die Sicherheit zu erhöhen werden große Anstrengungen unternommen um kleine Teilnetze zu sichern. Dabei werden oft Systeme eingesetzt, die nicht mit anderen Systemen zur Sicherung kooperieren bzw. nicht in der Lage sind, Hochgeschwindigkeitsnetze zu schützen. Das Ziel dieser Arbeit war es, ein skalierbares System zu analysieren, das adaptiv die Bedrohungen bekämpfen kann, so dass eine Art Immunsystem im Netz aufgebaut wird, das die verbreiteten Insellösungen zur Sicherung von Teilnetzen entlastet. Dazu wurde ein Simulationsmodell erstellt um das Verhalten bewerten zu können. In dem System existieren zwei Regelkreise. Je nach aktueller Last und Angrsituation, wird das Verhalten einer Firewall und eines IPFIX-Device adaptiv, durch ein optimal ausgelastetes Intrusion Detection System (IDS), geregelt. Das System ist, auch wegen der guten Skalierbarkeit, in der Lage mit hohen Datenraten umzugehen ohne dass der Schutzmechanismus eingeschränkt wird.

Quick access

BibTeX BibTeX

Contact

Alexander Lochschmied

BibTeX reference

@phdthesis{lochschmied2005signaling,
    author = {Lochschmied, Alexander},
    title = {{Signaling Pathways in Secured Network Environments}},
    advisor = {Dressler, Falko},
    institution = {Department of Computer Science},
    location = {Erlangen, Germany},
    month = {7},
    school = {Friedrich--Alexander University of Erlangen--Nuremberg (FAU)},
    type = {Master's Thesis},
    year = {2005},
   }
   
   

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