Link Delay Estimation via Expander Graphs

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In network tomography, we seek to infer the status of parameters (such as delay) for links inside a network through end-to-end probing between (external) boundary nodes along chosen routes. In this work, we apply concepts from compressed sensing to establish conditions on the routing matrix under which it is possible to estimate link delay from end-to-end measurements and also provide an upper-bound on the estimation error. Further, we investigate choice of the appropriate set of paths within a given network with defined boundary nodes, so as to minimize the number of probes needed for estimation. Simulation results show that the proposed algorithm will, with high probability, achieve forty percent reduction in overhead required compared to probing between every available pair of boundary nodes.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Link Delay Estimation via Expander Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Link Delay Estimation via Expander Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Link Delay Estimation via Expander Graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-388896

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.