Exploring networks with traceroute-like probes: Theory and simulations

DOI10.1016/j.tcs.2005.12.009zbMath1088.68015OpenAlexW2140668275WikidataQ56762579 ScholiaQ56762579MaRDI QIDQ2368960

Alessandro Vespignani, Ignacio Alvarez-Hamelin, Alexei Vazquez, Alain Barrat, Luca Dall'Asta

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)

Related Items (8)

Near-Linear Query Complexity for Graph Inference ⋮ 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 ⋮ Misleading stars: what cannot be measured in the internet? ⋮ Graph clustering ⋮ Monitoring the edges of a graph using distances ⋮ Network verification via routing table queries

Uses Software

• BRITE

Cites Work

• Unnamed Item
• Metric structure of random networks
• Relevance of massively distributed explorations of the internet topology: qualitative results
• A faster algorithm for betweenness centrality*
• Emergence of Scaling in Random Networks
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• On the bias of traceroute sampling

This page was built for publication: Exploring networks with traceroute-like probes: Theory and simulations