# Topology discovery of sparse random graphs with few participants

@inproceedings{Anandkumar2011TopologyDO, title={Topology discovery of sparse random graphs with few participants}, author={Anima Anandkumar and Avinatan Hassidim and Jonathan A. Kelner}, booktitle={SIGMETRICS '11}, year={2011} }

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 the…

## 7 Citations

Topology discovery of sparse random graphs with few participants

- Computer ScienceRandom Struct. Algorithms
- 2013

A lower bound on the number of participants required by any algorithm to reconstruct the original random graph up to a given edit distance is obtained and it is demonstrated that while consistent discovery is tractable for sparse random graphs using a small number of Participants, in general, there are graphs which cannot be discovered by any algorithms even with a significant number of participant.

Curvature-based Analysis of Network Connectivity in Private Backbone Infrastructures

- Computer ScienceProceedings of the ACM on Measurement and Analysis of Computing Systems
- 2022

A new method for assessing the characteristics of network path connectivity that is based on concepts from Riemannian geometry and also relies on an array of carefully crafted visualizations, including a novel manifold view of a network's delay space.

Active Learning of Multiple Source Multiple

- Computer Science
- 2014

A lower bound is provided on the number of 2-by-2's required by any active learning algorithm and two greedy algorithms are proposed, which follow the framework of multiple hypoth esis testing and Generalized Binary Search.

OCCAM: An Optimization Based Approach to Network Inference

- Computer SciencePERV
- 2019

This work proposes and empirically evaluates the first method that infers the complete network topology, rather than just logical routing trees from sources, and is a significant advance in network tomography.

NetSense: Optimizing Network Configuration for Sensing

- Computer Science
- 2013

Abstract : The unifying goal of this project was to characterize and optimize the interplay between network topology, communication protocols, and estimation performance. The first part of the…

Reconstruction of C&C Channel for Structured P2P Botnet

- Computer ScienceArXiv
- 2019

The topologies of C&C channel of P2P botnets are reconstructed for an easier containment of P&C botnets and for helping the investigator with his guessing in the detection of command issuing sources.

Interactive Algorithms for Unsupervised Machine Learning

- Computer Science
- 2015

This thesis develops interactive learning algorithms for three unsupervised problems: subspace learning, clustering, and tree metric learning, and proposes statistically and computationally appealing interactive algorithms for both the matrix completion problem, where the data points lie on a low dimensional subspace, and the matrix approximation problem,Where one must approximate the principal components of a collection of points.

## References

SHOWING 1-10 OF 52 REFERENCES

Approximate Discovery of Random Graphs

- Computer Science, MathematicsSAGA
- 2007

It is shown that for a random graph Gn,p with p = ne/n, for arbitrarily small choices of e > 0, in any constant cardinality subset of the nodes the pairwise distances are all identical with high probability.

Network Discovery and Verification

- Computer ScienceIEEE Journal on Selected Areas in Communications
- 2006

This work formalizes the map of the Internet problem as a combinatorial optimization problem and considers it for two different models characterized by different types of measurements, giving several upper and lower bounds on the competitive ratio and the approximation ratio in both models.

Efficient and dynamic routing topology inference from end-to-end measurements

- Computer ScienceTNET
- 2010

This paper proposes a general framework for designing topology inference algorithms based on additive metrics that can flexibly fuse information from multiple measurements to achieve better estimation accuracy and develops computationally efficient (polynomial-time) topology inferred algorithms.

Distance Realization Problems with Applications to Internet Tomography

- Computer Science, MathematicsJ. Comput. Syst. Sci.
- 2001

This paper studies a class of problems, called distance realization problems, which arise in the study of Internet data traffic models, and shows that this weak realization problem is NP-complete and that its optimum solutions can be approximated to within a factor of 2.

On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs

- Computer Science
- 2009

This work puts the observations of Lakhina et al. on a rigorous footing, and extends them to nearly arbitrary degree distributions, and proves that traceroute sampling finds power-law degree distributions in both Δ-regular and Poisson-distributed random graphs.

The Diameter of Sparse Random Graphs

- MathematicsCombinatorics, Probability and Computing
- 2010

These new results complete the determination of the diameter of the random graph G(n, p) to an accuracy of the order of its standard deviation (or better), for all functions p = p(n).

Optimally reconstructing weighted graphs using queries

- Computer Science, MathematicsSODA '10
- 2010

The first polynomial time algorithm with query complexity that matches the information theoretic lower bound for the query complexity of reconstructing a graph with n vertices and m edges is given.

Measuring ISP topologies with rocketfuel

- Computer ScienceTNET
- 2004

New Internet mapping techniques that have enabled us to measure router-level ISP topologies are presented, finding that these maps are substantially more complete than those of earlier Internet mapping efforts.

Estimating source-destination traffic intensities from link data

- Mathematics, Computer Science
- 1996

The node-to-node traffic intensity estimates are derived algorithmically, taking advantage of the fact that the first and second moment equations give rise to a linear inverse problem with positivity restrictions that can be approached by an EM algorithm, resulting in a particularly simple solution to a hard problem.

The many facets of internet topology and traffic

- Computer ScienceNetworks Heterog. Media
- 2006

This paper summary of recent advances in Internet research related to inferring and modeling the router-level topologies of individual service providers, and estimating the intra-AS traffic matrix is summarized.