The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. The rest of the nodes are hidden, and do not provide any information for topology discovery. We consider topology discovery under two routing models: (a) the participants exchange messages along the shortest paths and obtain end-to-end measurements, and (b) additionally, the participants exchange messages along thearXiv:1102.5063v3 fatcat:g45iw6rj6vh7fcnfnbbtoi2efe