odflows-sigm04 - Structural Analysis of Network Traffic...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Structural Analysis of Network Traffic Flows Anukool Lakhina, Konstantina Papagiannaki, Mark Crovella, Christophe Diot, Eric D. Kolaczyk, and Nina Taft ABSTRACT Network traffic arises from the superposition of Origin-Destination (OD) flows. Hence, a thorough understanding of OD flows is essen- tial for modeling network traffic, and for addressing a wide variety of problems including traffic engineering, traffic matrix estimation, capacity planning, forecasting and anomaly detection. However, to date, OD flows have not been closely studied, and there is very little known about their properties. We present the first analysis of complete sets of OD flow time- series, taken from two different backbone networks (Abilene and Sprint-Europe). Using Principal Component Analysis (PCA), we find that the set of OD flows has small intrinsic dimension. In fact, even in a network with over a hundred OD flows, these flows can be accurately modeled in time using a small number (10 or less) of independent components or dimensions. We also show how to use PCA to systematically decompose the structure of OD flow timeseries into three main constituents: com- mon periodic trends, short-lived bursts, and noise. We provide in- sight into how the various constitutents contribute to the overall structure of OD flows and explore the extent to which this decom- position varies over time. A. Lakhina and M. Crovella are with the Depart- ment of Computer Science, Boston University; email: anukool,crovella @cs.bu.edu . K. Papagiannaki and C. Diot are with Intel Research, Cambridge, UK; email: dina.papagiannaki,christophe.diot @intel.com . E. D. Kolaczyk is with the Department of Mathe- matics and Statistics, Boston University; email: ko- laczyk@math.bu.edu . N. Taft is with Intel Research, Berkeley; email: nina.taft@intel.com . This work was performed while M. Crovella was at Laboratoire dInformatique de Paris 6 (LIP6), with support from Centre National de la Recherche Scientifique (CNRS), France and Sprint Labs. Part of this work was also done while A. Lakhina, K. Papagiannaki and N. Taft were at Sprint Labs and A. Lakhina was at Intel Research, Cambridge. This work was supported in part by a grant from Sprint Labs, ONR award N000140310043 and NSF grants ANI-9986397 and CCR-0325701. Permission to make digital or hard copies of all or part 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. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee....
View Full Document

This note was uploaded on 10/26/2011 for the course CS 7260 taught by Professor Staff during the Spring '08 term at Georgia Institute of Technology.

Page1 / 12

odflows-sigm04 - Structural Analysis of Network Traffic...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online