On the feasibility of utilizing correlations between user populations for traffic inference

Kun-chan Lan and John Heidemann
USC/Information Sciences Institute

Abstract

Previous studies of Internet traffic have shown that a very small percentage of flows consume most of the network bandwidth. It is important to understand the characteristics of such flows for traffic monitoring and modelling purposes. Several prior researchers have characterized such flows using different classification schemes: by size as elephant and mice; by duration as tortoise and dragonfly; and by burstiness as alpha and beta traffic. However, it is not clear how these different definitions of flows are related to each other. In our work, we study these ``heavy-hitter'' flows in four orthogonal dimensions, namely size, duration, rate and burstiness, and examine how they are correlated. This paper makes three contributions: First, we systematically characterize prior definitions for the properties of such heavy-hitter traffic. Second, we show that there are strong correlations between some combinations of size, rate and burstiness. Finally, we show that these correlations can be explained by transport and application-level protocol mechanisms.

Availability

This paper is available in several formats: abstract web page with pointers and cites, PDF, paper copies can be obtained by mail to the authors. Copyright terms for this paper appear below.

Reference

Lan05a
Kun-chan Lan and John Heidemann. On the feasibility of utilizing correlations between user populations for traffic inference. In Proceedings of the 30th IEEE International Conference on Local Computer Networks, pp. 132-139. Sydney, Australia, IEEE. November, 2005. <http://www.isi.edu/~johnh/PAPERS/Lan05a.html>.
@inproceedings{Lan05a,
	author = "Kun-chan Lan and John Heidemann",
	title = "On the feasibility of utilizing correlations between user populations for traffic inference",
	booktitle = "Proceedings of the 30th {IEEE} International Conference on Local Computer Networks",
	year = "2005",
	publisher = "{IEEE}",
	address = "Sydney, Australia",
	month = "November",
	pages = "132--139",
	url = "http://www.isi.edu/~johnh/PAPERS/Lan05a.html",
	pdfurl = "http://www.isi.edu/~johnh/PAPERS/Lan05a.pdf",
	myorganization = "USC/Information Sciences Institute",
}

Copyright

This paper is copyright © 2005 by its authors. Permission to make digital or hard copies of part or all of this work for personal use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that new copies bear this notice and the full citation on the first page. Abstracting with credit is permitted.

To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission of the authors.