Exploring networks with traceroute-like probes: Theory and simulations
From MaRDI portal
Publication:2368960
DOI10.1016/J.TCS.2005.12.009zbMATH Open1088.68015DBLPjournals/tcs/DallAstaABVV06OpenAlexW2140668275WikidataQ56762579 ScholiaQ56762579MaRDI QIDQ2368960FDOQ2368960
Authors: Luca Dall'Asta, Ignacio Alvarez-Hamelin, Alain Barrat, Alexei Vazquez, A. Vespignani 
Publication date: 28 April 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11336/20027
Recommendations
- Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet
- Sampling networks by the union of \(m\) shortest path trees
- On the bias of traceroute sampling
- On the bias of traceroute sampling
- Relevance of massively distributed explorations of the internet topology: qualitative results
Cites Work
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- Metric structure of random networks
- A faster algorithm for betweenness centrality*
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- On the bias of traceroute sampling
- Relevance of massively distributed explorations of the internet topology: qualitative results
Cited In (18)
- Sampling networks by the union of \(m\) shortest path trees
- Perturbation results for distance-edge-monitoring numbers
- Where the Sidewalk Ends: Extending theInternet AS Graph Using Traceroutesfrom P2P Users
- Misleading stars: what cannot be measured in the internet?
- Monitoring the edges of a graph using distances
- Detection, understanding, and prevention of traceroute measurement artifacts
- Erdös-Gallai-type problems for distance-edge-monitoring numbers
- On the distance-edge-monitoring numbers of graphs
- Relevance of massively distributed explorations of the internet topology: qualitative results
- Network verification via routing table queries
- Monitoring the edges of product networks using distances
- Realizability problem of distance-edge-monitoring numbers
- Graph clustering
- Distance-edge-monitoring sets of networks
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
- Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet
- Monitoring the edges of a graph using distances with given girth
- Near-linear query complexity for graph inference
Uses Software
This page was built for publication: Exploring networks with traceroute-like probes: Theory and simulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368960)
