english Icono del idioma   español Icono del idioma  

Por favor, use este identificador para citar o enlazar este ítem: https://hdl.handle.net/20.500.12008/38599 Cómo citar
Título: Search for optimality in traffic matrix estimation : a rational approach by Cramer-Rao lower bounds
Autor: Bermolen, Paola
Vaton, Sandrine
Juva, I
Tipo: Preprint
Descriptores: Telecomunicaciones
Fecha de publicación: 2006
Resumen: In this paper we study the problem of traffic matrix estimation. The problem is ill-posed and thus some additional information has to be brought in to obtain an estimate. One common approach is to use the second moment statistics through a functional mean-variance relationship. We derive analytically the Fisher information matrix under this framework and obtain the Cramer-Rao lower bound (CRLB) for the variance of an estimator of the traffic matrix. Applications for the use of the CRLB are then demonstrated. From the bounds we can directly obtain confidence intervals for maximum likelihood estimates. Another use for the CRLB is the possibility to evaluate the efficiency of an estimator against the lower bound. A third possible application is to utilize the bounds in an approach to find the best placement for direct measurements of OD flows, so that it is optimal with regard to the traffic matrix estimation problem
Descripción: Trabajo presentado en la 2nd Conference on Next Generation Internet Design and Engineering, Valencia, España
Citación: Bermolen, P., Vaton, S., Juva, I. Search for optimality in traffic matrix estimation : a rational approach by Cramer-Rao lower bounds [Preprint] Publicado en Proceedings of the 2nd Conference on Next Generation Internet Design and Engineering, NGI '06. Valencia, España, 2006. doi 10.1109/NGI.2006.1678245
Licencia: Licencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0)
Aparece en las colecciones: Publicaciones académicas y científicas - Instituto de Ingeniería Eléctrica

Ficheros en este ítem:
Fichero Descripción Tamaño Formato   
BVJ06.pdf153,1 kBAdobe PDFVisualizar/Abrir


Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons Creative Commons