An iterative tomogravity algorithm for the estimation of network traffic



Institute of Mathematical Statistics Lecture Notes - Monograph Series

An iterative tomogravity algorithm for the estimation of network traffic

Jiangang Fang, Yehuda Vardi, Cun-Hui Zhang

Source: Regina Liu, William Strawderman and Cun-Hui Zhang, eds., Complex Datasets and Inverse Problems: Tomography, Networks and Beyond (Beachwood, Ohio, USA: Institute of Mathematical Statistics, 2007), 12-23.

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.

Primary Subjects: 62P30, 62H12, 62G05, 62F10
Keywords: network traffic flow; network tomography; Kullback-Leiber distance; network gravity model; regularized estimation

Full-text: Open access

Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.lnms/1196794940
Digital Object Identifier: doi:10.1214/074921707000000030

2008 © Institute of Mathematical Statistics

Institute of Mathematical Statistics Lecture Notes - Monograph Series

Institute of Mathematical Statistics Lecture Notes - Monograph Series