Traffic engineering in SDN/OSPF hybrid network

Proceedings - International Conference on Network Protocols, ICNP

Volumn , Issue , 2014, Pages 563-568

  Guo, Yingya ^a,b   Wang, Zhiliang ^a,b   Yin, Xia ^a,b   Shi, Xingang ^a,b   Wu, Jianping ^a,b  

^a TSINGHUA UNIVERSITY   (China)

^b TSINGHUA NATIONAL LABORATORY FOR INFORMATION SCIENCE AND TECHNOLOGY   (China)

Author keywords

hybrid network; OSPF; partial deployment; SDN; traffic engineering

Indexed keywords

CONTROLLERS; NETWORK ARCHITECTURE; ROUTERS; ROUTING PROTOCOLS; TRAFFIC CONGESTION;

FLOW SPLITTING RATIO; HYBRID NETWORK; NEAR-OPTIMAL PERFORMANCE; NETWORK CONGESTIONS; OSPF; PARTIAL DEPLOYMENT; SOFTWARE DEFINED NETWORKING (SDN); TRAFFIC ENGINEERING;

INTERNET PROTOCOLS;

EID: 84919983796     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2014.90     Document Type: Conference Paper

References (17)

1. B. Fortz and M. Thorup, "Optimizing ospf/is-is weights in a changing world," IEEE journal on selected areas in communications, vol. 20, no. 4, 2002
2. Y. Wang, Z. Wang, and L. Zhang, "Internet traffic engineering without full mesh overlaying," in INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, vol. 1. IEEE, 2001, pp. 565-571
3. B. Fortz and M. Thorup, "Internet traffic engineering by optimizing ospf weights," in INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, vol. 2. IEEE, 2000, pp. 519-528
4. B. Fortz and M. "Increasing internet capacity using local search," Computational Optimization and Applications, vol. 29, no. 1, pp. 13-48, 2004
5. M. Ericsson, M. G. C. Resende, and P. M. Pardalos, "A genetic algorithm for the weight setting problem in ospf routing," Journal of Combinatorial Optimization, vol. 6, no. 3, pp. 299-333, 2002
6. M. Píoro, A. Szentesi, J. Harmatos, A. Jüttner, P. Gajowniczek, and S. Kozdrowski, "On open shortest path first related network optimisation problems," Performance evaluation, vol. 48, no. 1, pp. 201-223, 2002
7. A. Sridharan, R. Guerin, and C. Diot, "Achieving near-optimal traffic engineering solutions for current ospf/is-is networks," IEEE/ACM Transactions on Networking (TON), vol. 13, no. 2, pp. 234-247, 2005
8. C.-Y. Hong, S. Kandula, R. Mahajan, M. Zhang, V. Gill, M. Nanduri, and R. Wattenhofer, "Achieving high utilization with software-driven wan," in Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM. ACM, 2013, pp. 15-26
9. S. Jain, A. Kumar, S. Mandal, J. Ong, L. Poutievski, A. Singh, S. Venkata, J. Wanderer, J. Zhou, M. Zhu et al., "B4: Experience with a globally-deployed software defined wan," in Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM. ACM, 2013, pp. 3-14
10. S. Vissicchio, L. Vanbever, and O. Bonaventure, "Opportunities and research challenges of hybrid software defined networks," ACM SIGCOMM Computer Communication Review, vol. 44, no. 2, pp. 70-75, 2014
11. S. Agarwal, M. Kodialam, and T. Lakshman, "Traffic engineering in software defined networks," in INFOCOM, 2013 Proceedings IEEE. IEEE, 2013, pp. 2211-2219
12. D. Xu, M. Chiang, and J. Rexford, "Deft: Distributed exponentiallyweighted flow splitting," in INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE. IEEE, 2007, pp. 71-79
13. D. Xu, M. Chiang, and J."Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering," IEEE/ACM Transactions on Networking (TON), vol. 19, no. 6, pp. 1717-1730, 2011
14. K. Xu, H. Liu, J. Liu, and M. Shen, "One more weight is enough: Toward the optimal traffic engineering with ospf," in Distributed Computing Systems (ICDCS), 2011 31st International Conference on. IEEE, 2011, pp. 836-846
15. M. Zhang, B. Liu, and B. Zhang, "Multi-commodity flow traffic engineering with hybrid mpls/ospf routing," in Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE. IEEE, 2009, pp. 1-6
16. N. Garg and J. Koenemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems," SIAM Journal on Computing, vol. 37, no. 2, pp. 630-652, 2007
17. R. Mahajan, N. Spring, D. Wetherall, and T. Anderson, "Inferring link weights using end-To-end measurements," in Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment. ACM, 2002, pp. 231-236