Exploring networks with traceroute-like probes: Theory and simulations

DOI10.1016/J.TCS.2005.12.009MaRDI QIDQ2368960zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

Internet explorationTopology inferenceTraceroute

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

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

• A faster algorithm for betweenness centrality*
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• Metric structure of random networks
• On the bias of traceroute sampling
• Relevance of massively distributed explorations of the internet topology: qualitative results
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence

Cited in

(19)

• Detection, understanding, and prevention of traceroute measurement artifacts
• Relevance of massively distributed explorations of the internet topology: qualitative results
• Near-linear query complexity for graph inference
• Graph clustering
• Where the Sidewalk Ends: Extending theInternet AS Graph Using Traceroutesfrom P2P Users
• Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet
• Monitoring the edges of a graph using distances with given girth
• On the distance-edge-monitoring numbers of graphs
• Erdös-Gallai-type problems for distance-edge-monitoring numbers
• Distance-edge-monitoring sets of networks
• Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
• Perturbation results for distance-edge-monitoring numbers
• Monitoring the edges of product networks using distances
• Realizability problem of distance-edge-monitoring numbers
• The distance-edge-monitoring numbers of subdivision graphs
• Optimal uniform shortest path sampling
• Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
• Network verification via routing table queries
• Sampling networks by the union of \(m\) shortest path trees

Describes a project that uses

Uses Software

• BRITE

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)