Traffic rate network tomography with higher‐order cumulants

DOI10.1002/NET.22127MaRDI QIDQ6179712zbMATH OpenOpenAlexFDO

Authors Hanoch Lev-Ari, Yariv Ephraim, Brian L. Mark

Publication date 18 December 2023

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/2012.07224

zbMATH Keywords

higher-order cumulantsinverse problemmean squared errornetwork tomographynetwork trafficPoisson model

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Abstract: Network tomography aims at estimating source-destination traffic rates from link traffic measurements. This inverse problem was formulated by Vardi in 1996 for Poisson traffic over networks operating under deterministic as well as random routing regimes. In this paper we expand Vardi's second-order moment matching rate estimation approach to higher-order cumulant matching with the goal of increasing the column rank of the mapping and consequently improving the rate estimation accuracy. We develop a systematic set of linear cumulant matching equations and express them compactly in terms of the Khatri-Rao product. Both least squares estimation and iterative minimum I-divergence estimation are considered. We develop an upper bound on the mean squared error (MSE) in least squares rate estimation from empirical cumulants. We demonstrate for the NSFnet that supplementing Vardi's approach with third-order empirical cumulant reduces its averaged normalized MSE relative to the theoretical minimum of the second-order moment matching approach by about 12%-18%. This minimum MSE is obtained when Vardi's second-order moment matching approach is based on the theoretical rather than the empirical moments.

Recommendations

• Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
• Network tomography for integer-valued traffic
• Network tomography: a review and recent developments
• Estimating Network Loss Rates Using Active Tomography
• Network tomography: recent developments

Cites work

• Bayesian Inference on Network Traffic Using Link Count Data
• Deblurring subject to nonnegativity constraints
• Finding the K Shortest Loopless Paths in a Network
• scientific article; zbMATH DE number 1099041 (Why is no real title available?)
• scientific article; zbMATH DE number 883145 (Why is no real title available?)
• scientific article; zbMATH DE number 3354369 (Why is no real title available?)
• Identifiability of flow distributions from link measurements with applications to computer networks
• Inertia characteristics of self-adjoint matrix polynomials
• Multicast-based inference of network-internal loss characteristics
• Network tomography for integer-valued traffic
• Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
• Network tomography: recent developments
• Passive Network Tomography for Erroneous Networks: A Network Coding Approach
• Time and lag recursive computation of cumulants from a state-space model
• Time-Varying Network Tomography: Router Link Data
• Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems

Cited in

(1)

• Mathematical statistical characterization of high-speed computer network traffic data

This page was built for publication: Traffic rate network tomography with higher‐order cumulants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179712)