New methods for network traffic matrix estimation based on a probability model
Files
(Restricted Access)
Date
2011
Authors
Tian, H.
Sang, Y.
Shen, H.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the 17th IEEE International Conference on Networks, 2011, pp.270-274
Statement of Responsibility
Hui Tian, Yingpeng Sang and Hong Shen
Conference Name
17th IEEE International Conference on Networks (ICON) (14 Dec 2011 - 16 Dec 2011 : Singapore, Singapore)
Abstract
Traffic matrix is of great help in many network applications. However, it is very difficult, if not intractable, to estimate the traffic matrix for a large-scale network. This is because the estimation problem from limited link measurements is highly under-constrained. We propose a simple probability model for a large-scale practical network. The probability model is then generalized to a general model by including random traffic data. Traffic matrix estimation is then conducted under these two models by two minimization methods. It is shown that the Normalized Root Mean Square Errors of these estimates under our model assumption are very small. For a large-scale network, the traffic matrix estimation methods also perform well. The comparison of two minimization methods shown in the simulation results complies with the analysis.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© 2011 IEEE