Towards a statistical characterization of the competitiveness of oblivious routing
暂无分享,去创建一个
[1] Hans-Werner Braun,et al. The National Science Foundation Network , 1992 .
[2] Harald Räcke,et al. Minimizing Congestion in General Networks , 2002, FOCS.
[3] Gábor Rétvári,et al. On optimal multipath rate-adaptive routing , 2010, The IEEE symposium on Computers and Communications.
[4] Mikael Johansson,et al. Traffic matrix estimation on a large IP backbone: a comparison on real data , 2004, IMC '04.
[5] M. Dyer. Computing the volume of convex bodies : a case where randomness provably helps , 1991 .
[6] Edith Cohen,et al. Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.
[7] Ratul Mahajan,et al. Inferring link weights using end-to-end measurements , 2002, IMW '02.
[8] Harald Räcke,et al. Optimal hierarchical decompositions for congestion minimization in networks , 2008, STOC.