Tradeoffs for web communications fast analysis

Authors:
Olivier Paul;Jean-Etienne Kiba
Affiliations:
GET/INT LOR Department, Evry cedex, France;GET/INT LOR Department, Evry cedex, France
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 2
Cited 0

What TCP/IP protocol headers can tell us about the web

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
PRO-COW: Protocol compliance on the web-a longitudinal study

USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3

Quantified Score

Hi-index	0.00

Visualization

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.