• DocumentCode
    2898189
  • Title

    A Linear Algebraic Approach for Loss Tomography in Mesh Topologies Using Network Coding

  • Author

    Gui, Jiaqi ; Shah-Mansouri, Vahid ; Wong, Vincent W S

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada
  • fYear
    2010
  • fDate
    23-27 May 2010
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    Loss tomography aims to infer link loss rates using end-to-end measurements. We investigate active loss tomography on mesh topologies. When network coding is applied, based on the content of the received probe packet, a receiver should distinguish which paths have successfully transmitted a probe and which paths have not. We establish a lower bound on probe size which is necessary for obtaining such end-to-end observations. Furthermore, we propose a linear algebraic (LA) approach to developing consistent estimators of link loss rates. Our approach exploits the inherent correlation between the losses on links and the losses on different sets of paths, so that the estimators converge to the actual loss rates as the number of probes increases. We also prove that the identiflability of a link is a necessary and sufficient condition for the consistent estimation of its loss rate. Simulation results show that the LA approach achieves better estimation accuracy than the belief propagation (BP) algorithm, after sending reasonably sufficient probes.
  • Keywords
    linear algebra; network coding; telecommunication network topology; tomography; belief propagation algorithm; end-to-end measurements; estimation accuracy; linear algebraic approach; loss tomography; mesh topology; network coding; probe packet; Bandwidth; Belief propagation; Costs; Inference algorithms; Loss measurement; Monitoring; Network coding; Network topology; Probes; Tomography;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications (ICC), 2010 IEEE International Conference on
  • Conference_Location
    Cape Town
  • ISSN
    1550-3607
  • Print_ISBN
    978-1-4244-6402-9
  • Type

    conf

  • DOI
    10.1109/ICC.2010.5501840
  • Filename
    5501840