The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Tingkah laku serupa diri mencirikan trafik dalam banyak rangkaian komunikasi dunia sebenar. Trafik ini secara tradisinya dimodelkan sebagai proses rawak serupa kendiri tertib kedua masa diskret. Proses serupa diri dikenal pasti melalui trend pereputan polinom bagi fungsi autokovarians. Dalam kerja ini kami menumpukan pada dua kriteria untuk membina sistem huru-hara yang mampu menjana trajektori yang serupa. Kriteria pertama mengaitkan keserupaan diri dengan trend pereputan polinom bagi fungsi autokovarians. Yang kedua mengaitkan persamaan diri dengan berat-kesesuaian pengagihan masa persinggahan di negeri ON dan/atau OFF. Satu keluarga sistem huru-hara masa diskret kemudiannya dirangka di antara peta Pseudo-Markov affine sekeping yang boleh dikira. Peta ini boleh dibina supaya pengkuantitian trajektori mereka meniru proses trafik dengan parameter Hurst yang berbeza dan beban purata. Beberapa simulasi dilaporkan menunjukkan bagaimana, mengikut teori, reka bentuk peta dapat menyesuaikan spesifikasi tersebut.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Alessandra GIOVANARDI, Gianluca MAZZINI, Riccardo ROVATTI, "Criteria to Design Chaotic Self-Similar Traffic Generators" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 9, pp. 2155-2164, September 2001, doi: .
Abstract: A self-similar behavior characterizes the traffic in many real-world communication networks. This traffic is traditionally modeled as an ON/OFF discrete-time second-order self-similar random process. The self-similar processes are identified by means of a polynomially decaying trend of the autocovariance function. In this work we concentrate on two criteria to build a chaotic system able to generate self-similar trajectories. The first criterion relates self-similarity with the polynomially decaying trend of the autocovariance function. The second one relates self-similarity with the heavy-tailedness of the distributions of the sojourn times in the ON and/or OFF states. A family of discrete-time chaotic systems is then devised among the countable piecewise affine Pseudo-Markov maps. These maps can be constructed so that the quantization of their trajectories emulates traffic processes with different Hurst parameters and average load. Some simulations are reported showing how, according to the theory, the map design is able to fit those specifications.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_9_2155/_p
Salinan
@ARTICLE{e84-a_9_2155,
author={Alessandra GIOVANARDI, Gianluca MAZZINI, Riccardo ROVATTI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Criteria to Design Chaotic Self-Similar Traffic Generators},
year={2001},
volume={E84-A},
number={9},
pages={2155-2164},
abstract={A self-similar behavior characterizes the traffic in many real-world communication networks. This traffic is traditionally modeled as an ON/OFF discrete-time second-order self-similar random process. The self-similar processes are identified by means of a polynomially decaying trend of the autocovariance function. In this work we concentrate on two criteria to build a chaotic system able to generate self-similar trajectories. The first criterion relates self-similarity with the polynomially decaying trend of the autocovariance function. The second one relates self-similarity with the heavy-tailedness of the distributions of the sojourn times in the ON and/or OFF states. A family of discrete-time chaotic systems is then devised among the countable piecewise affine Pseudo-Markov maps. These maps can be constructed so that the quantization of their trajectories emulates traffic processes with different Hurst parameters and average load. Some simulations are reported showing how, according to the theory, the map design is able to fit those specifications.},
keywords={},
doi={},
ISSN={},
month={September},}
Salinan
TY - JOUR
TI - Criteria to Design Chaotic Self-Similar Traffic Generators
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2155
EP - 2164
AU - Alessandra GIOVANARDI
AU - Gianluca MAZZINI
AU - Riccardo ROVATTI
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2001
AB - A self-similar behavior characterizes the traffic in many real-world communication networks. This traffic is traditionally modeled as an ON/OFF discrete-time second-order self-similar random process. The self-similar processes are identified by means of a polynomially decaying trend of the autocovariance function. In this work we concentrate on two criteria to build a chaotic system able to generate self-similar trajectories. The first criterion relates self-similarity with the polynomially decaying trend of the autocovariance function. The second one relates self-similarity with the heavy-tailedness of the distributions of the sojourn times in the ON and/or OFF states. A family of discrete-time chaotic systems is then devised among the countable piecewise affine Pseudo-Markov maps. These maps can be constructed so that the quantization of their trajectories emulates traffic processes with different Hurst parameters and average load. Some simulations are reported showing how, according to the theory, the map design is able to fit those specifications.
ER -