Sampling networks by the union of m shortest path trees

DOI10.1016/J.COMNET.2009.10.023MaRDI QIDQ969033zbMATH OpenOpenAlexFDO

Authors Huijuan Wang, Piet Van Mieghem

Publication date 11 May 2010

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2009.10.023

zbMATH Keywords

network samplingsampling biasshortest path treeweighted and unweighted networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Exploring networks with traceroute-like probes: Theory and simulations
• Degree distribution of shortest path trees and bias of network sampling algorithms
• scientific article; zbMATH DE number 5524713
• Bounding the bias of tree-like sampling in IP topologies
• On the bias of traceroute sampling

Cited in

(9)

• Graph sampling for Internet topologies using normalized Laplacian spectral features
• Degree distribution of shortest path trees and bias of network sampling algorithms
• Exploring networks with traceroute-like probes: Theory and simulations
• Effects of sampling on growth mechanisms of complex networks
• Shortest path tree sampling for landmark selection in large networks
• Complex network metrology
• Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet
• Optimal uniform shortest path sampling
• Bounding the bias of tree-like sampling in IP topologies

Describes a project that uses

Uses Software

• PlanetLab

This page was built for publication: Sampling networks by the union of \(m\) shortest path trees

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