Graption: A graph-based P2P traffic classification framework for the internet backbone

  • Authors:
  • Marios Iliofotou;Hyun-chul Kim;Michalis Faloutsos;Michael Mitzenmacher;Prashanth Pappu;George Varghese

  • Affiliations:
  • University of California, Riverside, CA, USA;Seoul National University, Gwanak-gu, Seoul, Korea;University of California, Riverside, CA, USA;Harvard University, Cambridge, MA, USA;Conviva, Inc., San Mateo, CA, USA;University of California, San Diego, San Diego, CA, USA

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Monitoring network traffic and classifying applications are essential functions for network administrators. Current traffic classification methods can be grouped in three categories: (a) flow-based (e.g., packet sizing/timing features), (b) payload-based, and (c) host-based. Methods from all three categories have limitations, especially when it comes to detecting new applications, and classifying traffic at the backbone. In this paper, we propose the use of Traffic Dispersion Graphs (TDGs) to remedy these limitations. Given a set of flows, a TDG is a graph with an edge between any two IP addresses that communicate; thus TDGs capture network-wide interactions. Using TDGs, we develop an application classification framework dubbed Graption (Graph-based classification). Our framework provides a systematic way to classify traffic by using information from the network-wide behavior and flow-level characteristics of Internet applications. As a proof of concept, we instantiate our framework to detect P2P traffic, and show that it can identify 90% of P2P flows with 95% accuracy in backbone traces, which are particularly challenging for other methods.