Graph-based P2P Traffic Classification at the Internet Backbone

被引：0

作者：

Iliofotou, Marios ^{[1
]}

Kim, Hyun-chul ^{[2
,3
]}

Faloutsos, Michalis ^{[1
]}

Mitzenmacher, Michael ^{[5
]}

Pappu, Prashanth ^{[6
]}

Varghese, George ^{[4
]}

机构：

[1] Univ Calif Riverside, Riverside, CA 92521 USA

[2] Seoul Natl Univ, Seoul 151, South Korea

[3] CAIDA, La Jolla, CA 92093 USA

[4] Univ Calif San Diego, La Jolla, CA 92093 USA

[5] Harvard Univ, Cambridge, MA 02138 USA

[6] Conviva Inc, Foster City, CA 94404 USA

来源：

IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS | 2009年

关键词：

NETWORKS;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Monitoring network traffic and classifying applications are essential functions for network administrators. I this paper, we consider the use of Traffic Dispersion Graph (TDGs) to classify network traffic. 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 harness the power of network-wide behavior, flow-level characteristics, and data mining techniques. As a proof of concept, we instantiate our framework to detect P2P applications, and show that it can identify P2P traffic with recall and precision greater than 90% in backbone traces, which are particularly challenging for other methods.

引用

页码：37 / +

页数：2