Identifiability of flow distributions from link measurements with applications to computer networks

DOI10.1088/0266-5611/23/5/004zbMath1311.90027OpenAlexW2149365817MaRDI QIDQ5424710

Harsh Singhal, George Michailidis

Publication date: 6 November 2007

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/58107

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Related Items (6)

Traffic rate network tomography with higher‐order cumulants ⋮ Graph reconstruction from path correlation data ⋮ Estimating Latent Processes on a Network From Indirect Measurements ⋮ An empirical approach to demographic inference with genomic data ⋮ A dynamic hierarchical Bayesian model for the estimation of day-to-day origin-destination flows in transportation networks ⋮ Network tomography for integer-valued traffic

This page was built for publication: Identifiability of flow distributions from link measurements with applications to computer networks