Traffic Engineering in Software Defined Networks: A Survey

• Autorzy: Abbasi M. R. , Guleria A. , Devi M. S.
• Języki publikacji: EN

Abstrakty

EN

An important technique to optimize a network and improve network robustness is traffic engineering. As traffic demand increases, traffic engineering can reduce service degradation and failure in the network. To allow a network to adapt to changes in the traffic pattern, the research community proposed several traffic engineering techniques for the traditional networking architecture. However, the traditional network architecture is difficult to manage. Software Defined Networking (SDN) is a new networking model, which decouples the control plane and data plane of the networking devices. It promises to simplify network management, introduces network programmability, and provides a global view of network state. To exploit the potential of SDN, new traffic engineering methods are required. This paper surveys the state of the art in traffic engineering techniques with an emphasis on traffic engineering for SDN. It focuses on some of the traffic engineering methods for the traditional network architecture and the lessons that can be learned from them for better traffic engineering methods for SDN-based networks. This paper also explores the research challenges and future directions for SDN traffic engineering solutions.

Słowa kluczowe

EN

application awareness; software defined networking; traffic engineering

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2016
• Tom: nr 4
• Strony: 3--14
• Opis fizyczny: Bibliogr. 45 poz., rys., tab.

Twórcy

autor

Abbasi M. R.

• Department of Computer Science & Application, Panjab University, 160014 Chandigarh, India

autor

Guleria A.

• Computer Center Panjab University 160014 Chandigarh, India

autor

Devi M. S.

• Department of Computer Science & Application, Panjab University, 160014 Chandigarh, India

Bibliografia

• [1] B. Nunes, M. Mendonca, X.-N. Nguyen, K. Obraczka, and T. Turletti, “A survey of software-defined networking: Past, present, and future of programmable networks”, IEEE Commun. Surv. & Tutor., vol. 16, no. 3, pp. 1617–1634, 2014.
• [2] B. Fortz and M. Thorup, “Internet traffic engineering by optimizing OSPF weights”, in Proc. 19th IEEE Ann. Joint Conf. of the IEEE Comp. & Commun. Soc. INFOCOM 2000, Tel Aviv, Israel, 2000, vol. 2, pp. 519–528.
• [3] X. Xiao, A. Hannan, B. Bailey, and L. M. Ni, “Traffic engineering with MPLS in the Internet”, Network, vol. 14, no. 2, pp. 28–33, 2000.
• [4] O. N. Foundation, “OpenFlow – open networking foundation” [Online]. Available: https://www.opennetworking.org/sdn-resources/openflow (accessed Aug. 23, 2016).
• [5] K. Ishiguro, A. Lindem, A. Davey, and V. Manral, “Traffic engineering extensions to OSPF Version 3”, RFC 5329, IETF Trust, 2008 [Online]. Available: https://tools.ietf.org/html/rfc5329
• [6] T. Li and H. Smit, “IS-IS extensions for Traffic Engineering”, RFC 5305, IETF Trust, 2008 [Online]. Available: https://tools.ietf.org/html/rfc5305
• [7] B. Fortz, J. Rexford, and M. Thorup, “Traffic engineering with traditional IP routing protocols”, Commun. Mag., vol. 40, no. 10, pp. 118–124, 2002.
• [8] D. Thale and C. Hopps, “Multipath issues in unicast and multicast next-hop selection”, RFC 2991, IETF Trust, 2000 [Online]. Available: https://tools.ietf.org/html/rfc2991
• [9] D. Zhang and D. Ionescu, “QoS performance analysis in deployment of DiffServ-aware MPLS Traffic Engineering”, in Proc. 8th ACIS Int. Conf. on Software Engin., Artif. Intell., Netw., & Parallel/Distrib. Comput. SNPD 2007, Qingdao, China, 2007, vol. 3, pp. 963–967.
• [10] F. Le Faucheur et al., “Multi-Protocol Label Switching (MPLS) Support of Differentiated Services”, RFC 3270, IEFT Trust, 2002 [Online]. Available: https://tools.ietf.org/rfc/rfc3270.txt
• [11] I. F. Akyildiz et al., “A new traffic engineering manager for DiffServ/MPLS networks: design and implementation on an IP QoS Testbed”, Computer Commun., vol. 26, no. 4, pp. 388–403, 2003.
• [12] I. Gojmerac, T. Ziegler, F. Ricciato, and P. Reichl, “Adaptive multipath routing for dynamic traffic engineering”, in Proc. Global Telecommun. Conf. GLOBECOM’03, San Francisco, CA, USA, 2003, vol. 6, pp. 3058–3062.
• [13] I. Poese, B. Frank, G. Smaragdakis, S. Uhlig, A. Feldmann, and B. Maggs, “Enabling content-aware traffic engineering”, ACM SIGCOMM Comp. Commun. Rev., vol. 42, no. 5, pp. 21–28, 2012.
• [14] M. Zhang, C. Yi, B. Liu, and B. Zhang, “GreenTE: Power-aware traffic engineering”, in Proc. 18th IEEE Int. Conf. on Netw. Protocols ICNP 2010, Kyoto, Japan, 2010, pp. 21–30.
• [15] E. Amaldi, A. Capone, L. G. Gianoli, and L. Mascetti, “A MILPbased heuristic for energy-aware traffic engineering with shortest path routing”, in Network Optimization, J. Pahl, T. Reiners, and S. Voß , Eds. LNCS, vol. 6701, pp. 464–477. Springer, 2011.
• [16] N. Vasić and Dejan Kostić, “Energy-aware traffic engineering”, in Proc. of the 1st Int. Conf. on Energy-Effic. Comput. & Netw. e-Energy’10, Passau, Germany, 2010, pp. 169–178.
• [17] L. Zhang and D. Clark, “Oscillating behavior of network traffic: A case study simulation”, Internetworking: Res. and Exper., vol. 1, no. 2, pp. 101–112, 1990.
• [18] S. Jain et al., “B4: Experience with a globally-deployed software defined WAN”, ACM SIGCOMM Comp. Commun. Rev., vol. 43, no. 4, pp. 3–14, 2013.
• [19] M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat, “Hedera: Dynamic Flow Scheduling for Data Center Networks”, in Proc. 7th USENIX Symp. on Netw. Syst. Design & Implemen. NSDI’10, San Jose, CA, USA, 2010, vol. 10, pp. 19–19.
• [20] A. R. Curtis, J. C. Mogul, J. Tourrilhes, P. Yalagandula, P. Sharma, and S. Banerjee, “DevoFlow: scaling flow management for highperformance networks”, ACM SIGCOMM Comp. Commun. Rev., vol. 41, no. 4, pp. 254–265, 2011.
• [21] A. R. Curtis, W. Kim, and P. Yalagandula, “Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection”, in Proc. 30th IEEE Int. Conf. Comp. Commun. IEEE INFOCOM 2011, Shanghai, China, 2011, pp. 1629–163.
• [22] T. Benson, A. Anand, A. Akella, and M. Zhang, “MicroTE: Fine grained traffic engineering for data centers”, in Proc. 7th Conf. on Emerg. Networking Experim. & Technol. Co-NEXT’11, Tokyo, Japan, 2011, p. 8.
• [23] R. Trestian, G.-M. Muntean, and K. Katrinis, “MiceTrap: Scalable traffic engineering of datacenter mice flows using OpenFlow”, in IFIP/IEEE Int. Symp. on Integr. Netw. Managem. IM 2013, Ghent, Belgium, 2013, pp. 904–907.
• [24] S. Valenti, D. Rossi, A. Dainotti, A. Pescape, A. Finamore, and `M. Mellia, “Reviewing traffic classification”, in Data Traffic Monitoring and Analysis, E. Biersack, C. Callegari, and M. Matijasevic, Eds. LNCS, vol. 7754, pp. 123–147. Springer, 2013.
• [25] Z. A. Qazi et al., “Application-awareness in SDN”, ACM SIGCOMM Comp. Commun. Rev., vol. 43, no. 4, pp. 487–488, 2013.
• [26] H. Farhadi and A. Nakao, “Rethinking flow classification in SDN”, in Proc. IEEE Int. Conf. on Cloud Engin. IC2E 2014, Boston, MA, USA, 2014, pp. 598–603.
• [27] A. Bieszczad, B. Pagurek, and T. White, “Mobile agents for network management”, Commun. Surveys, vol. 1, no. 1, pp. 2–9, 1998.
• [28] P. O. Skobelev, O. N. Granichin, D. S. Budaev, V. B. Laryukhin, and I. V. Mayorov, “Multi-agent tasks scheduling system in software defined networks”, J. of Physics: Conf. Series, vol. 510, no. 1, p. 012006, 2014 (doi: 10.1088/1742-6596/510/1/012006).
• [29] M. Jarschel, F. Wamser, T. Hohn, T. Zinner, and P. Tran-Gia, “SDNbased pplication-aware networking on the example of YouTube video streaming”, in Proc. 2nd Eur. Worksh. on Softw. Defined Netw. EWSDN 2013, Berlin, Germany, 2013, pp. 87–92.
• [30] P. Georgopoulos, Y. Elkhatib, M. Broadbent, M. Mu, and N. Race, “Towards network-wide QoE fairness using openflow-assisted adaptive video streaming”, in roc. ACM SIGCOMM Worksh. on Future Human-Centric Multim. Netw. FhMN 2013, Hong Kong, China, 2013, pp. 15–20.
• [31] H. Nam, K.-H. Kim, J. Y. Kim, and H. Schulzrinne, “Towards QoEaware video streaming using SDN”, in Proc. Global Commun. Conf. GLOBECOM 2014, Austin, TX, USA, 2014, pp. 1317–1322.
• [32] K. T. Dinh, S. Kukliński, W. Kujawa, and M. Ulaski, “MSDNTE: Multipath Based Traffic Engineering for SDN”, in Intelligent Information and Database Systems. Asian Conference on Intelligent Information and Database Systems, N. T. Nguyen, B. Trawiński, and R. Kosala, Eds. Springer, 2016, pp. 630–639.
• [33] D. Eppstein, “Finding the k-shortest paths”, SIAM J. Comput., vol. 28, pp. 652–673. 1999.
• [34] S. Knight, H. X. Nguyen, N. Falkner, R. Bowden, and M. Roughan, “The Internet topology zoo”, IEEE J. on Selec. Areas in Commun., vol. 29, no. 9, pp. 1765–1775, 2011.
• [35] S. Sharma, D. Staessens, D. Colle, M. Pickavet, and P. Demeester, “Enabling fast failure recovery in OpenFlow networks”, in Proc. 8th Int. Worksh. on the Des. of Reliable Commun. Netw. DRCN 2011, Kraków, Poland, 2011, pp. 164–171.
• [36] D. Staessens, S. Sharma, D. Colle, M. Pickavet, and P. Demeester, “Software defined networking: Meeting carrier grade requirements”, in Proc. 18th IEEE Worksh. on Local & Metropolitan Area Networks LANMAN 2011, Chapel Hill, NC, USA, 2011, pp. 1–6.
• [37] H. H. Liu, S. Kandula, R. Mahajan, M. Zhang, and D. Gelernter, “Traffic engineering with forward fault correction”, ACM SIGCOMM Comp. Commun. Rev., vol. 44, no. 4, pp. 527–538, 2014.
• [38] H. Kim, J. R. Santos, Y. Turner, M. Schlansker, J. Tourrilhes, and N. Feamster, “Coronet: Fault tolerance for software defined networks”, in Proc. 20th IEEE Int. Conf. on Network Prot. ICNP 2012, Austin, TX, USA, 2012, pp. 1–2.
• [39] R. Bolla, R. Bruschi, F. Davoli, and F. Cucchietti, “Energy efficiency in the future Internet: A survey of existing approaches and trends in energy-aware fixed network infrastructures”, Commun. Surveys & Tutor., vol. 13, no. 2, pp. 223–244, 2011.
• [40] F. Giroire, J. Moulierac, and T. K. Phan, “Optimizing rule placement in software-defined networks for energy-aware routing”, in Proc. Global Commun. Conf. GLOBECOM 2014, IEEE, Austin, TX, USA, 2014, pp. 2523–2529.
• [41] F. Pop, C. Dobre, D. Comaneci, and J. Kołodziej, “Adaptive scheduling algorithm for media-optimized traffic management in software defined networks”, Computing, vol. 98, no. 1-2, pp. 147–168, 2016 (doi: 10.1007/s00607-014-0406-9).
• [42] M. Rifai, D. Lopez-Pacheco, and G. Urvoy-Keller, “Coarse-grained scheduling with software-defined networking switches”, in Proc. 2015 ACM Conf. on Spec. Interest Group on Data Commun. SIGCOMM’15, London, UK, 2015, pp. 95–96. 2015.
• [43] B. Y. Ke, P.-. Tien, and Y.-L. Hsiao, “Parallel prioritized flow scheduling for software defined data center network”, in Proc. 14th Int. Conf. on High Perform. Switch. & Rout. IEEE HPSR 2013, Taipei, Taiwan, 2013, pp. 217–218.
• [44] Y. Liu, Y. Li, Y. Wang, and J. Yuan, “Optimal scheduling for multi-flow update in Software-Defined Networks”, J. of Network & Computer Applications, vol. 54, no. C, pp. 11–19, 215 (doi: 10.1016/j.jnca.2015.04.009).
• [45] R. Mahajan and R. Wattenhofer, “On consistent updates in software defined networks”, in Proc. 12th ACM Worksh. on Hot Topics in Netw. HotNets-XII, College Park, MD, USA, 2013, p. 20.

Uwagi

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę (zadania 2017).