Topology Discovery of Sparse Random Graphs With Few Participants

Topology Discovery of Sparse Random Graphs With Few Participants

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 discover...

Full description

Bibliographic Details
Main Authors: Anandkumar, Animashree, Hassidim, Avinatan, Kelner, Jonathan Adam
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Association for Computing Machinery 2012
Online Access:http://hdl.handle.net/1721.1/71202
https://orcid.org/0000-0002-4257-4198

Internet

http://hdl.handle.net/1721.1/71202
https://orcid.org/0000-0002-4257-4198

Similar Items