doi:10.5075/epfl-thesis-1479
nebis:1625822
fre
Robert, Stephan
ModÃ©lisation markovienne du trafic dans les rÃ©seaux de communication
Lausanne, EPFL
http://infoscience.epfl.ch/record/31957/files/EPFL_TH1479.pdf
The principal question we address in this work is the following: "Is Markov modelling appropriate to analyse data networks?". We will conclude that it is. The motivation for this question comes from the work of a research team at Bellcore who argue that the models used in teletraffic engineering are questionnable. Their argument is based on long measurements performed on their local network. Their results, with the major conclusion that the traffic is self-similar, have shaken the teletraffic community. After having exposed the principal characteristics of the Markovian model, we analyse measurements done on the EPFL network and on the Bellcore network. The results of the analysis lead us to suspect the suitability of Markovian models. Therefore, we study the interworking unit Ethernet/DQDB considering a network totally loaded. No hypothesis is made for the traffic profile, yet the study leads to strong conclusions and we therefore try to understand the queue behavior with the spectral analysis in order to better characterize the data traffic. The next step consists of reproducing the self-similarity observed in the data traffic with modulated Markov chains. Here, Courtois's theory of decomposability is used. We have shown that it is possible to reproduce self-similarity on a finite timescale, but that the number of parameters needed to manipulate in the modulated Markov remains large. In the next step, we propose a technique to reduce them drastically. A method of finding a Markov modulated chain as a function of the expectation, the local Hurst parameter and the domain where the process exhibits self-similarity has been developed. Finally, we analyse the statistical multiplexing in a new ATM architecture by comparing the multiplexing of VBR sources (with a modulated Markovian chains) on a CBR and on a VBR connection, using the above techniques.
2005-03-16T13:28:10Z
http://infoscience.epfl.ch/record/31957
http://infoscience.epfl.ch/record/31957
Text