Customizable real-time service graph mapping algorithm in carrier grade networks

Németh, B., Czentye, J., Vaszkun, G., Csikor, L. and Sonkoly, B. (2015) Customizable real-time service graph mapping algorithm in carrier grade networks. In: IEEE Conference on Network Function Virtualization and Software Defined Networks Demo Track (NFV-SDN), San Francisco, CA, USA, 18-21 Nov 2015, pp. 30-32. ISBN 9781467368841 (doi: 10.1109/NFV-SDN.2015.7387400)

Abstract

Today the notion of Service Function Chaining (SFC) returns to the focus of technological development in the area of network management and design. Researchers focus on exploiting the advantages of Network Function Virtualization (NFV) and Software Defined Networking (SDN) to bring SFC to a brand new level of fast and flexible, modern end-to- end service orchestration. The core of SFC architecture is the orchestration algorithm, which has ultimate decision making responsibility over compute and networking resource reservation. There are many sophisticated solutions for this task with long running times, so those cannot be executed real-time for every new request arriving within a few seconds. There is a lack of very fast (meta)heuristic orchestration algorithms to deal with enormous amount of service request. The goal of this paper is to demonstrate novel approaches to designing, evaluating and fine- tuning of real-time parameterizable orchestration algorithms for carrier grade networks.

• Item Type: Conference Proceedings
• Additional Information: This work was conducted within the framework of the FP7 UNIFY project, which is partially funded by the Commission of the European Union.
• Keywords: Software defined networking.
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Csikor, Dr Levente
• Authors: Németh, B., Czentye, J., Vaszkun, G., Csikor, L., and Sonkoly, B.
• College/School: College of Science and Engineering > School of Computing Science
• ISBN: 9781467368841