A scatter search algorithm to configure service function chaining Online publication date: Mon, 26-Oct-2020
by Adel Bouridah; Hacene Belhadef
International Journal of Internet Technology and Secured Transactions (IJITST), Vol. 10, No. 6, 2020
Abstract: Network functions virtualisation (NFV) emerges to deal with the challenges of reducing both the capital expenses (CAPEX) and operational expenses (OPEX) of cloud providers. The NFV is done by implementing network functions and providing them as software commodities. Network services are provided by chaining a set of network functions together. The key problem will be how and where network functions should be placed in the network and how traffic is routed through them. This is the well-known service function chaining problem and it is known to be NP-hard so exhaustive search algorithms have no significant benefit in large-scale context. This paper proposes a scatter search-based solution to configure service function chain. The aim is to produce the optimal number and placement of the required virtual network functions with the dynamic traffic steering over them. This is done while respecting computing and network resources constraints.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Technology and Secured Transactions (IJITST):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook