• DocumentCode
    1999724
  • Title

    Network Tomography via Compressed Sensing

  • Author

    Firooz, Mohammad H. ; Roy, Sumit

  • Author_Institution
    Electr. Eng. Dept., Univ. of Washington, Seattle, WA, USA
  • fYear
    2010
  • fDate
    6-10 Dec. 2010
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    In network tomography, we seek to infer link parameters inside a network (such as link delays) by sending end-to-end probes between (external) boundary nodes. The main challenge here is to estimate link-level attributes from end-to-end measurements. In this paper, based on the idea of combinatorial compressed sensing, we specify conditions on network routing matrix under which it is possible to estimate link delays from measurements of end-to-end delay. Moreover, we provide an upper-bound on the estimation error.
  • Keywords
    combinatorial mathematics; delay estimation; matrix algebra; signal reconstruction; telecommunication network routing; boundary nodes; combinatorial compressed sensing; end-to-end delay; link delay estimation; link-level attribute estimation; network routing matrix; network tomography; upper-bound; Bipartite graph; Compressed sensing; Delay; Peer to peer computing; Routing; Tomography;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
  • Conference_Location
    Miami, FL
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-5636-9
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2010.5684036
  • Filename
    5684036