Network delay inference from additive metrics
From MaRDI portal
Publication:3055890
DOI10.1002/rsa.20305zbMath1201.90048arXivmath/0604367MaRDI QIDQ3055890
Sebastien Roch, Shankar Bhamidi, Ram Rajagopal
Publication date: 10 November 2010
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0604367
68W40: Analysis of algorithms
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
65C40: Numerical analysis or methods applied to Markov chains
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Gibbs measures and phase transitions on sparse random graphs, Network delay inference from additive metrics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The performance of neighbor-joining methods of phylogenetic reconstruction
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- A few logs suffice to build (almost) all trees. II
- A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences
- Network tomography: recent developments
- Network delay inference from additive metrics
- Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
- Multicast-based inference of network-internal loss characteristics
- Time-Varying Network Tomography: Router Link Data
- Network Tomography Based on Additive Metrics
- Learning nonsingular phylogenies and hidden Markov models
