Literature Database Entry

erlacher2012monitoring


Felix Erlacher, "Monitoring Support for Efficient Web 2.0 and overlay Network Detection," Master's Thesis, Institute of Computer Science, University of Innsbruck, October 2012. (Advisors: Falko Dressler and Christoph Sommer)

Abstract

One important goal when dealing with network traffic is its categorization. In the field of network security for example firewalls try to block certain categories of traffic for security reasons or network monitoring tools categorize traffic to provide information to intrusion detection systems. Until recently it was sufficient for categorization to associate parts of the traffic to a specific protocol and the protocol to a specific layer. But current trends show that modern web applications tend to make use of so called overlay structures. Protocols like HTTP, which originally belong to the application layer, are used as transport protocols and thus can not be associated to the application layer anymore. The traditional way of using port numbers to identify a specific protocol and to classify network connections is not effective in the Web 2.0. Thus, the need for new techniques for categorizing traffic can be identified. Given the definition of a specific Web 2.0 protocol, monitoring tools like Vermont can be extended to search for these characteristics in the payload of flows. When identified, the flows are marked correspondingly and can further be processed. In the tests, Google Maps was used as a sample Web 2.0 application. The performed tests show that all of the overlay portion of the Google Maps traffic can be detected – with no false positives or false negatives. The impact on the performance of Vermont is minimal.

Quick access

BibTeX BibTeX

Contact

Felix Erlacher

BibTeX reference

@phdthesis{erlacher2012monitoring,
    author = {Erlacher, Felix},
    advisor = {Dressler, Falko and Sommer, Christoph},
    title = {{Monitoring Support for Efficient Web 2.0 and overlay Network Detection}},
    institution = {Institute of Computer Science},
    year = {2012},
    month = {October},
    school = {University of Innsbruck},
    type = {Master's Thesis},
   }
   
   

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.