By Topic

New methods for network traffic matrix estimation based on a probability model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hui Tian ; Sch. of Electron. & Inf. Eng., Beijing Jiaotong Univ., Beijing, China ; Yingpeng Sang ; Hong Shen

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.

Published in:

Networks (ICON), 2011 17th IEEE International Conference on

Date of Conference:

14-16 Dec. 2011