Abstract
In this paper, we explore a novel approach to perform a probabilistic fast analysis of web communications. Instead of relying on pattern matching algorithms, we look at simple network and transport level parameters and try to infer what happens at the application level. Our approach provides the ability to perform a trade-off between analysis speed and precision that could prove useful for some traffic analysis applications.
This work is funded by IST DIADEM Firewall and GET DDOS projects.
Chapter PDF
Similar content being viewed by others
References
Fielding, R., et al.: HTTP 1.1, RFC 2616. Internet Engineering Task Force (June 1999)
Krishnamurthy, B., et al.: PRO-COW: Protocol Compliance on the Web. In: USITS 2001 (2001)
Donelson Smith, F., et al.: What TCP/IP protocol headers can Tell Us About the Web. In: CM SIGMETRICS/Performance 2001 (June 2001)
Reed, D.: IPFilter v 4.1.3 (2004), available at http://coombs.anu.edu.au/~avalon/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paul, O., Kiba, JE. (2005). Tradeoffs for Web Communications Fast Analysis. In: Boutaba, R., Almeroth, K., Puigjaner, R., Shen, S., Black, J.P. (eds) NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. NETWORKING 2005. Lecture Notes in Computer Science, vol 3462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422778_132
Download citation
DOI: https://doi.org/10.1007/11422778_132
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25809-4
Online ISBN: 978-3-540-32017-3
eBook Packages: Computer ScienceComputer Science (R0)