Traffic-Oblivious Routing for Guaranteed Bandwidth Performance
暂无分享,去创建一个
[1] Leslie G. Valiant,et al. A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..
[2] Christophe Diot,et al. Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM 2002.
[3] Subhash Suri,et al. Designing Least-Cost Nonblocking Broadband Networks , 1997, J. Algorithms.
[4] P.J. Winzer. Randomized load balancing and T-WDM ring networks (Abstract only) , 2005 .
[5] Albert G. Greenberg,et al. A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.
[6] Sudipta Sengupta,et al. Efficient and robust routing of highly variable traffic , 2005 .
[7] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[8] Murali S. Kodialam,et al. A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[9] Murali S. Kodialam,et al. Preconfiguring IP-Over-Optical Networks to Handle Router Failures and Unpredictable Traffic , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[10] Ratul Mahajan,et al. Measuring ISP topologies with rocketfuel , 2002, TNET.
[11] Edith Cohen,et al. Optimal oblivious routing in polynomial time , 2004, J. Comput. Syst. Sci..
[12] Scott Shenker,et al. Internet indirection infrastructure , 2004, IEEE/ACM Transactions on Networking.
[13] Scott Shenker,et al. Internet indirection infrastructure , 2004, TNET.