Better network traffic identification through the independent combination of techniques

  • Authors:
  • Arthur Callado;Judith Kelner;Djamel Sadok;Carlos Alberto Kamienski;Stênio Fernandes

  • Affiliations:
  • Quixadá Campus, Federal University of Ceará, Quixadá, Brazil;Informatics Center, Federal University of Pernambuco, Recife, Brazil;Informatics Center, Federal University of Pernambuco, Recife, Brazil;Mathematics, Computer and Cognition Center, Federal University of ABC, Santo André, Brazil;Federal Institute for Education in Science and Technology - Alagoas, Brazil

  • Venue:
  • Journal of Network and Computer Applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Traffic identification is currently an important challenge for network management and dimensioning. In recent years, some new algorithms and the different uses of known techniques have been proposed, yet the results are so far limited in scope and frequently disappointing. Furthermore, existing results cannot be directly compared, since networks and traffic profiles differ significantly among collected traces. When submitted to an analysis, considering different networks, data granularities and baselines, most algorithms perform well in one or two scenarios. However, no algorithm has proven better than the others in the majority of the scenarios. Summarizing four years of research in traffic identification, this work shows that the identification abilities of algorithms vary for different situations and proposes a new methodology for traffic identification through the combination of any set of algorithms for traffic identification. Four different combination mechanisms (and many variations) are validated against four different network scenarios that are commonly used in the literature. Combination shows promising results, mainly because it revealed to be robust against bias towards any scenario, which happens in previous identification algorithms.