Long-tail traffic

telecommunication traffic that exhibits a Long-tail distribution

Uses your system voice; voice and rate in settings.

Q6672024Snapshot

≈ 4 min read

Names in other languages

  • فارسیتوزیع احتمال دنباله بلند
  • EnglishLong-tail traffic

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

A long-tailed or heavy-tailed distribution is one that assigns relatively high probabilities to regions far from the mean or median. A more formal mathematical definition is given below. In the context of teletraffic engineering, several quantities of interest have been shown to have a long-tailed distribution.

For example, if we consider the sizes of files transferred from a web server, then, to a good degree of accuracy, the distribution is heavy-tailed, that is, there are a large number of small files transferred but, crucially, the number of very large files transferred remains a major component of the volume downloaded. Many processes are technically long-range dependent but not self-similar.

The differences between these two phenomena are subtle. Heavy-tailed refers to a probability distribution, and long-range dependent refers to a property of a time series and so these should be used with care and a distinction should be made. The terms are distinct, although superpositions of samples from heavy-tailed distributions aggregate to form long-range dependent time series.

Additionally, there is Brownian motion, which is self-similar but not long-range dependent. P(a)= \left ( \frac{\mu^a}{a!} \right )e^{-\mu}, where a is the number of call arrivals and \mu is the mean number of call arrivals in time T. For this reason, pure-chance traffic is also known as Poisson traffic.

The number of call departures in a given time also has a Poisson distribution, i.e.: P(d)=\left(\frac{\lambda^d}{d!}\right)e^{-\lambda}, where d is the number of call departures and \lambda is the mean number of call departures in time T. The intervals, T, between call arrivals and departures are intervals between independent, identically distributed random events. It can be shown that these intervals have a negative exponential distribution, i.e.: P[T \ge \ t]=e^{\frac{-t}{h}}, where h is the Mean Holding Time (MHT).

Information on the fundamentals of statistics and probability theory can be found in the external links section. Any pure random process has H = 0.5 Phenomena with H > 0.5 typically have a complex process structure.

A distribution is said to be heavy-tailed if: P[X>x] \sim x^{- \alpha},\ \text{as} \ x \to \infty, 0 This means that regardless of the distribution for small values of the random variable, if the asymptotic shape of the distribution is hyperbolic, it is heavy-tailed. The simplest heavy-tail distribution is the Pareto distribution, which is hyperbolic over its entire range.

Complementary distribution functions for the exponential and Pareto distributions are shown below. Shown on the left is a graph of the distributions shown on linear axes, spanning a large domain. To its right is a graph of the complementary distribution functions over a smaller domain, and with a logarithmic range.

If the logarithm of the range of an exponential distribution is taken, the resulting plot is linear. In contrast, that of the heavy-tail distribution is still curvilinear. These characteristics can be clearly seen on the graph above to the right.

A characteristic of long-tail distributions is that if the logarithm of both the range and the domain is taken, the tail of the long-tail distribution is approximately linear over many orders of magnitude. In the graph above left, the condition for the existence of a heavy-tail distribution, as previously presented, is not met by the curve labelled "Gamma-Exponential Tail".

The probability mass function of a heavy-tail distribution is given by: p(x)= \alpha k^{\alpha} x^{- \alpha -1},\ \alpha ,k>0,\ x \ge k and its cumulative distribution function is given by: F(x)=P[X \le \ x]=1- \left(\frac{k}{x}\right)^{\alpha} where k represents the smallest value the random variable can take. Readers interested in a more rigorous mathematical treatment of the subject are referred to the external links section.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1351321419 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

15 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.