Literature Database Entry

estgfaeller2015ipfix


Wolfgang Estgfaeller, "IPFIX Payload Aggregation for HTTP/1.1 Dialogs," Master's Thesis, Institute of Computer Science, University of Innsbruck, August 2015. (Advisors: Falko Dressler and Felix Erlacher)

Abstract

Recent trends show an increasing amount of HTTP in internet traffic, among other things because many applications are using HTTP as their transport protocol instead of TCP. This creates a demand to monitor HTTP like other common transport protocols. To cope with today’s high data rates flow-based monitoring techniques like IPFIX are used. However, IPFIX does not yet involve the aggregation of HTTP information. This work is enhancing IPFIX to include HTTP information and is thereby laying the foundation for other network monitoring tools like Intrusion Detection Systems to efficiently process the resulting flow records. The implemented mechanism is able to observe TCP streams and detect HTTP messages in these streams. HTTP requests and responses, which belong to each other and thus form a dialog unit, are combined and exported as a single bidirectional IPFIX record. IPFIX information elements can now be used to aggregate HTTP information. The evaluation shows, that firstly, the implemented parsing mechanism can even deal with complex HTTP traffic and performs better then other well-known tools. And secondly, even in 10 Gbit/s networks the performance of the tool is still reasonably well.

Quick access

BibTeX BibTeX

Contact

Wolfgang Estgfaeller

BibTeX reference

@phdthesis{estgfaeller2015ipfix,
    author = {Estgfaeller, Wolfgang},
    advisor = {Dressler, Falko and Erlacher, Felix},
    title = {{IPFIX Payload Aggregation for HTTP/1.1 Dialogs}},
    institution = {Institute of Computer Science},
    year = {2015},
    month = {August},
    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.