CAIDA Home
 papers | presentations | animations | visualizations | bibliography  
 www.caida.org > publications : papers : 1995 : : pmi
    visit     contact     search:
CAIDA: Cooperative Association for Internet Data Analysis
A parametrizable methodology for Internet traffic flow profiling

-----summary of contents-----
Abstract for "A parametrizable methodology for Internet traffic flow profiling" authored by K. Claffy, G. Polyzos and H.-W. Braun
|  View full paper:    PDF  |

-----end summary of contents-----

A Parametrizable methodology for Internet traffic flow profiling

K. Claffy and H.-W. Braun
National Laboratory for Applied Network Research - NLANR
San Diego Supercomputer Center,
University of California, San Diego

G. Polyzos
University of California, San Diego

We present a parametrizable methodology for profiling Internet traffic flows at a variety of granularities. Our methodology differs from many previous studies that have concentrated on end-point definitions of flows in terms of state derived from observing the explicit opening and closing of TCP connections.

Instead, our model defines flows based on traffic satisfying various temporal and spatial locality conditions, as observed at internal points of the network. This approach to flow characterization helps address some central problems in networking based on the Internet model. Among them are route caching, resource reservation at multiple service levels, usage based accounting, and the integration of IP traffic over an ATM fabric. We first define the parameter space and then concentrate on metrics characterizing both individual flows as well as the aggregate flow profile. We consider various granularities of the definition of a flow, such as by destination network, host-pair, or host and port quadruple. We include some measurements based on case studies we undertook, which yield significant insights into some aspects of Internet traffic, including demonstrating (i) the brevity of a significant fraction of IP flows at a variety of traffic aggregation granularities, (ii) that the number of host-pair IP flows is not significantly larger than the number of destination network flows, and (iii) that schemes for caching traffic information could significantly benefit from using application information.

|  View full paper:    PDF  |

Cooperative Association for Internet Data Analysis (CAIDA)
  Last Modified: Thurs Mar-2-2006 23:25:9 PDT
  Maintained by: Alex Ma
  Page URL: http://www.caida.org/publications/papers/1995/pmi/index.xml