By Topic

Reducing traffic traces using a polynomial approximation for traffic classification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sean Sanders ; School of Electrical and Computer Engineering, Georgia Institute of Technology, USA ; Troy Nunnally ; Henry L. Owen

Piecewise polynomials have been used to visually link and classify network traffic. The advantage of using piecewise polynomials to approximate traffic is that significantly less storage space is required when compared to traditional packet captures. However, when representing discrete data with continuous approximations, error is introduced. We analyze this error through the creation and examination of polynomials for client, server, and bidirectional traffic, where each polynomial represents a single TCP connection. An application of the piecewise polynomial technique is traffic classification. In this initial work, we use traffic attributes of packet length and arrival time to represent Instant Messaging, Video, and Basic Web Page traffic. We then examine the error introduced by using polynomials to represent each of these traffic types. The initial results also show that this technique can reduce standard packet trace sizes by up to four orders of magnitude. An understanding of the error involved and the amount of memory saved by using this technique is a necessary step toward an automated process for traffic classification that utilizes piecewise polynomial approximations.

Published in:

Southeastcon, 2011 Proceedings of IEEE

Date of Conference:

17-20 March 2011