Network Tomography: A novel algorithm for probing path selection
暂无分享,去创建一个
[1] A. Swami,et al. Topological Constraints on Identifying Additive Link Metrics via End-to-end Paths Measurements , 2012 .
[2] J. Y. Yen,et al. Finding the K Shortest Loopless Paths in a Network , 2007 .
[3] Qiang Zheng,et al. Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.
[4] Ibrahim Matta,et al. BRITE: A Flexible Generator of Internet Topologies , 2000 .
[5] B. Henderson-Sellers,et al. The theoretical extension of two versions of cyclomatic complexity to multiple entrylexit modules , 1994, Software Quality Journal.
[6] Jin Cao,et al. Network Tomography: Identifiability and Fourier Domain Estimation , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[7] B. Henderson Sellers,et al. Modularization and McCabe's cyclomatic complexity , 1992 .
[8] Ibrahim Matta,et al. BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.
[9] Robert Nowak,et al. Internet tomography , 2002, IEEE Signal Process. Mag..
[10] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.