A. Erramilli, R. P. Sing and P. Pruthi "Modeling packet traffic with chaotic maps" Royal Institute of Technology, ISRN KTH/IT/R-95/18--SE, Stockholm-Kista Sweden, August 1994 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Modeling And Queueing Performance Evaluation Of Vbr.. - Garroppo, Giordano, .. (1997) (Correct)
....map. The synthetic data are obtained by a two level quantization, with an adequately chosen threshold c, of the map state x(n) at step n. Recently, several deterministic maps (such as Bernoulli Shift, the Liebovitch Map and the Intermittency Map) have been proposed for traffic traces generation [8]. As far as broadband networks are concerned, a modified version of the Intermittency Map is particularly attractive since it generates sequences exhibiting the characteristics of the asymptotic self similar processes. The deterministic mapping that defines the Intermittency Map is the ....
....generated producing, by means of the map, the number of packets transmitted during each time interval, which can either be empty or contain k cells. The relevant property of the proposed map is that, unlike classical ON OFF models, the marginal distribution of OFF period length is heavy tailed [8] at least for values of c close to zero; the z parameter permits to control the decay of this marginal and the long term decay of the autocorrelation function. This characteristic of the generated sequence makes the model particularly suitable as the basic component of a LRD traffic generator. ....
A. Erramilli, R. P. Sing and P. Pruthi "Modeling packet traffic with chaotic maps" Royal Institute of Technology, ISRN KTH/IT/R-95/18--SE, Stockholm-Kista Sweden, August 1994
Heavy-Tailed ON/OFF Source Behavior and Self-Similar Traffic - Pruthi (1995) (4 citations) Self-citation (Erramilli Pruthi) (Correct)
....such ON OFF behavior. We are motivated in part by experiences in a number of other disciplines in which chaotic maps have been used as efficient generators of fractal processes. Our approach is based on earlier work on the application of deterministic chaotic maps to model traffic flows [5] 6][7][8] Specifically, we consider the simplest class of chaotic systems, known as one dimensional (1 D) chaotic maps, in which the evolution of a state variable x over discrete time n is described by a deterministic nonlinear transformation . We can model packet traffic sources using such maps by ....
....5. Section 6 concludes this paper and discusses some open issues. 2 Chaotic Maps as Traffic Source Models In this section we review the chaotic map formulation to model traffic sources. Consider a one dimensional map in which the state variable evolves over time according to the nonlinear map [6][7][8] EQ 1) Note that the formulation is completely deterministic, and a given initial condition fully defines a trajectory in the phase space. This is analogous to a realization of a stochastic process. We can now model a packet generation process by assuming that the source is in a passive or ....
[Article contains additional citation context not shown here]
A. Erramilli, R.P. Singh, and P. Pruthi, "Modeling Packet Traffic with Chaotic Maps," Royal Institute of Technology, ISRN KTH/IT/R-94/18--SE, Stockholm-Kista, Sweden, Aug. 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC