Open Access
VOL. 54 | 2007 An iterative tomogravity algorithm for the estimation of network traffic
Chapter Author(s) Jiangang Fang, Yehuda Vardi, Cun-Hui Zhang
Editor(s) Regina Liu, William Strawderman, Cun-Hui Zhang
IMS Lecture Notes Monogr. Ser., 2007: 12-23 (2007) DOI: 10.1214/074921707000000030

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.

Information

Published: 1 January 2007
First available in Project Euclid: 4 December 2007

MathSciNet: MR2459176

Digital Object Identifier: 10.1214/074921707000000030

Subjects:
Primary: 62F10 , 62G05 , 62H12 , 62P30

Keywords: Kullback-Leiber distance , network gravity model , Network tomography , network traffic flow , regularized estimation

Rights: Copyright © 2007, Institute of Mathematical Statistics

Back to Top