A stochastic Kaczmarz algorithm for network tomography

From MaRDI portal
Publication:462380

DOI10.1016/J.AUTOMATICA.2013.12.016zbMATH Open1298.93308arXiv1212.3696OpenAlexW2006668203MaRDI QIDQ462380FDOQ462380


Authors: Gugan Thoppe, D. Manjunath, Vivek Borkar Edit this on Wikidata


Publication date: 20 October 2014

Published in: Automatica (Search for Journal in Brave)

Abstract: We develop a stochastic approximation version of the classical Kaczmarz algorithm that is incremental in nature and takes as input noisy real time data. Our analysis shows that with probability one it mimics the behavior of the original scheme: starting from the same initial point, our algorithm and the corresponding deterministic Kaczmarz algorithm converge to precisely the same point. The motivation for this work comes from network tomography where network parameters are to be estimated based upon end-to-end measurements. Numerical examples via Matlab based simulations demonstrate the efficacy of the algorithm.


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




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: A stochastic Kaczmarz algorithm for network tomography

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