An iterative tomogravity algorithm for the estimation of network traffic
Abstract
This paper introduces an iterative tomogravity algorithm for the estimation of a network traffic matrix based on one snapshot observation of the link loads in the network. The proposed method does not require complete observation of the total load on individual edge links or proper tuning of a penalty parameter as existing methods do. Numerical results are presented to demonstrate that the iterative tomogravity method controls the estimation error well when the link data is fully observed and produces robust results with moderate amount of missing link data.
Cite
@article{arxiv.0708.0945,
title = {An iterative tomogravity algorithm for the estimation of network traffic},
author = {Jiangang Fang and Yehuda Vardi and Cun-Hui Zhang},
journal= {arXiv preprint arXiv:0708.0945},
year = {2007}
}
Comments
Published at http://dx.doi.org/10.1214/074921707000000030 in the IMS Lecture Notes Monograph Series (http://www.imstat.org/publications/lecnotes.htm) by the Institute of Mathematical Statistics (http://www.imstat.org)