Bounding the bias of tree-like sampling in IP topologies

DOI10.3934/NHM.2008.3.323MaRDI QIDQ934211zbMATH OpenOpenAlexFDO

Authors Reuven Cohen, Mira Gonen, Avishai Wool

Publication date 29 July 2008

Published in Networks and Heterogeneous Media (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/nhm.2008.3.323

zbMATH Keywords

internet topology modelsnetwork computing

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Communication networks in operations research (90B18)

Recommendations

• On the bias of traceroute sampling
• On the bias of traceroute sampling
• Degree distribution of shortest path trees and bias of network sampling algorithms
• Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet
• Sampling networks by the union of \(m\) shortest path trees

Cited in

(5)

• Degree distribution of shortest path trees and bias of network sampling algorithms
• Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet
• On the bias of traceroute sampling
• On the bias of traceroute sampling
• Sampling networks by the union of \(m\) shortest path trees

This page was built for publication: Bounding the bias of tree-like sampling in IP topologies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q934211)