Recent measures on LANs have highlighted the self-similar nature of the traffic. A systematic procedure to design a 1D chaotic map, which generates a self-similar process characterised by a polynomial OFF time distribution, is considered and reviewed. This polynomial law allows the performance of a queue system to be investigated by extending the G/M/l theory to the case of discrete arrival and service processes. Analytical results are reported highlighting the impact of the traffic self-similar degree and simulations show the validity of the developed theory
Queue System Analytical Study with Self-Similar Chaos-Based Traffic
GIOVANARDI, Alessandra;ROVATTI, Riccardo;MAZZINI, Gianluca
2001
Abstract
Recent measures on LANs have highlighted the self-similar nature of the traffic. A systematic procedure to design a 1D chaotic map, which generates a self-similar process characterised by a polynomial OFF time distribution, is considered and reviewed. This polynomial law allows the performance of a queue system to be investigated by extending the G/M/l theory to the case of discrete arrival and service processes. Analytical results are reported highlighting the impact of the traffic self-similar degree and simulations show the validity of the developed theoryFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
