کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
453086 694713 2010 14 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Blind maximum likelihood estimation of traffic matrices under long-range dependent traffic
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
Blind maximum likelihood estimation of traffic matrices under long-range dependent traffic
چکیده انگلیسی

A new method, based on the maximum likelihood principle, through the numerical Expectation–Maximization algorithm, is proposed to estimate traffic matrices when traffic exhibits long-range dependence. The methods proposed so far in the literature do not account for long-range dependence. The method proposed in the present paper also provides an estimate of the Hurst parameter. Simulation results show that: (i) the estimate of the traffic matrix is more efficient than those obtained via existing techniques; (ii) the estimation error of the traffic matrix is lower for larger values of the true traffic intensity; (iii) the estimate of the Hurst parameter is slightly negatively biased.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Networks - Volume 54, Issue 15, 28 October 2010, Pages 2626–2639
نویسندگان
, , ,