The Boolean Solution to the Congested IP Link Location Problem: Theory and Practice

Like other problems in network tomography or traffic matrix estimation, the location of congested IP links from end-to-end measurements requires solving a system of equations that relate the measurement outcomes with the variables representing the status of the IP links. In most networks, this system of equations does not have a unique solution. To overcome this critical problem, current methods use the unrealistic assumption that all IP links have the same prior probability of being congested. We find that this assumption is not needed, because these probabilities can be uniquely identified from a small set of measurements by using properties of Boolean algebra. We can then use the learnt probabilities as priors to find rapidly the congested links at any time, with an order of magnitude gain in accuracy over existing algorithms. We validate our results both by simulation and real implementation in the PlanetLab network.

Published in:
IEEE Infocom
Presented at:
IEEE INFOCOM 2007, Anchorage, Alaska, 6-12 May 2007

 Record created 2007-01-31, last modified 2018-03-18

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)