TRAFFIC PATTERNS
Uniform Traffic  the simulator generates uniformly distributed traffic across
the network.
Uniform-Random Traffic  In random traffic, each source is equally likely to
send to each destination is the most commonly used traffic pattern in network
evaluation. Random traffic is very benign because, by making the traffic
uniformly distributed, it balances load even for topologies and routing
algorithms that normally have very poor load balance.
Multimedia Traffic  Throughout the past decade, new multimedia
applications emerged, establishing a trend of significant increase in traffic
volume. The traffic here is considered only for one application and the design
of the hardware is geared solely toward the particular application.
Transparent Traffic  Traffic here is created with the use of matrix
transpose or corner – turn operations.
Tornado Traffic  Digit permutations (Tornado Traffic) are a similar subset
of permutations in which the digits of the destination address are calculated
from the digits of the source address. Such permutations apply only to
networks in which the terminal addresses can be expressed as n-digit, radix-k
numbers, such as k-ary n-cube (torus) networks. The tornado pattern is
designed as an adversary for torus topologies, whereas neighbour traffic
measures a
topology’s ability to exploit locality.
Self-similar Traffic  Traffic that is bursty on many or all time scales can be
described statistically using the notion of self-similarity. Self-similarity is the
property we associate with fractals --- the object appears the same regardless
of the scale at which it is viewed. In some cases, self-similarity in network
traffic can be explained in terms of file system characteristics and user
behavior.