IP Traffic Engineering
暂无分享,去创建一个
Eiji Oki | Roberto Rojas-Cessa | Christian Vogt | Mallikarjun Tatipamula | E. Oki | M. Tatipamula | R. Rojas-Cessa | Christian Vogt
[1] William J. Dally,et al. Worst-case Traffic for Oblivious Routing Functions , 2002, IEEE Comput. Archit. Lett..
[2] Albert G. Greenberg,et al. Resource management with hoses: point-to-cloud services for virtual private networks , 2002, TNET.
[3] Matthew Roughan,et al. Computation of IP traffic from link , 2003, SIGMETRICS 2003.
[4] Christophe Diot,et al. Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM 2002.
[5] Eiji Oki,et al. Optimization of IP Load-Balanced Routing for Hose Model , 2009, 2009 21st IEEE International Conference on Tools with Artificial Intelligence.
[6] Eiji Oki,et al. Performance of Optimal Routing by Pipe, Hose, and Intermediate Models , 2010, IEICE Trans. Commun..
[7] Eiji Oki,et al. Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model , 2010, IEEE Trans. Commun..
[8] Mikkel Thorup,et al. Traffic engineering with traditional IP routing protocols , 2002, IEEE Commun. Mag..
[9] Eiji Oki,et al. PSO: preventive start-time optimization of OSPF link weights to counter network failure , 2010, IEEE Communications Letters.
[10] M. Kodialam,et al. Oblivious Routing of Highly Variable Traffic in Service Overlays and IP Backbones , 2009, IEEE/ACM Transactions on Networking.
[11] Edith Cohen,et al. Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.
[12] Rajeev Rastogi,et al. Algorithms for provisioning virtual private networks in the hose model , 2001, SIGCOMM 2001.
[13] Mikkel Thorup,et al. Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..
[14] Eiji Oki,et al. F-TPR: fine two-phase IP routing scheme over shortest paths for hose model , 2009, IEEE Communications Letters.
[15] Eiji Oki,et al. Fine Two-Phase Routing with Traffic Matrix , 2009, 2009 Proceedings of 18th International Conference on Computer Communications and Networks.
[16] Marcin Bienkowski,et al. A practical algorithm for constructing oblivious routing schemes , 2003, SPAA '03.