An Identification Problem for Multiterminal Networks: Solving for the Traffic Matrix from Input-Output Measurements

DOI10.1080/15427951.2006.10129123zbMATH Open1120.65005OpenAlexW2061180976MaRDI QIDQ5755207

Laura Felicia Matusevich, F. Alberto Grünbaum

Publication date: 20 August 2007

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2006.10129123

zbMATH Keywords

numerical examplesMarkov chainrandom walkinversion formulasmultiterminal networkend-to-end measurementsrandom routing strategy

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40)

Related Items (2)

A parallel low rank matrix optimization method for recovering Internet traffic network data via link flow measurement ⋮ Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs

This page was built for publication: An Identification Problem for Multiterminal Networks: Solving for the Traffic Matrix from Input-Output Measurements

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