A method is proposed to estimate traffic matrices in the presence of long-range dependent traffic, while the methods proposed sofar for that task have been designed for short-range dependent traffic. The method employs the traffic measurements on links and provides the maximum likelihood estimate of both the traffic matrix and the Hurst parameter. It is “blind”, i.e. it does not exploit any model neither for the traffic intensity values (e.g. the gravity model) nor for the meanvariance relationship (e.g. the power-law model). In the application to a sample network the error on traffic intensities decays rapidly with the traffic intensity down to below 30%. The estimation error of the Hurst parameter can be reduced to a few percentage points with a proper choice of the measurement interval.
Blind maximum-likelihood estimation of traffic matrices in long range dependent tr / Conti, Pier Luigi; De Giovanni, Livia; Naldi, Maurizio. - STAMPA. - (2009), pp. 141-154. - LECTURE NOTES IN COMPUTER SCIENCE.
Blind maximum-likelihood estimation of traffic matrices in long range dependent tr
CONTI, Pier Luigi;
2009
Abstract
A method is proposed to estimate traffic matrices in the presence of long-range dependent traffic, while the methods proposed sofar for that task have been designed for short-range dependent traffic. The method employs the traffic measurements on links and provides the maximum likelihood estimate of both the traffic matrix and the Hurst parameter. It is “blind”, i.e. it does not exploit any model neither for the traffic intensity values (e.g. the gravity model) nor for the meanvariance relationship (e.g. the power-law model). In the application to a sample network the error on traffic intensities decays rapidly with the traffic intensity down to below 30%. The estimation error of the Hurst parameter can be reduced to a few percentage points with a proper choice of the measurement interval.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.