Energy-efficient and traffic-aware service function chaining orchestration in multi-domain networksShow others and affiliations
2019 (English)In: Future Generation Computer Systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 91, p. 347-360Article in journal (Refereed) Published
Abstract [en]
Service function chaining (SFC) provisioning is helpful not only for saving the capital expenditure (CAPEX) and operational expenditure (OPEX) of a network provider but also for reducing energy consumption in the substrate network. However, to the best of our knowledge, there has been little research on the problem of energy consumption for orchestrating online SFC requests in multi-domain networks. In this paper, we first formulate the problem of an energy-efficient online SFC request that is orchestrated across multiple clouds as an integer linear programming (ILP) model to find an optimal solution. Then, we analyze the complexity of this ILP model and prove that the problem is NP-hard. Additionally, we propose a low-complexity heuristic algorithm named energy-efficient online SFC request orchestration across multiple domains (EE-SFCO-MD) for near-optimally solving the mentioned problem. Finally, we conduct simulation experiments to evaluate the performance of our algorithm. Simulation results show that EE-SFCO-MD consumes less energy than existing approaches while the online SFC’s requirements are met and the privacy of each cloud is effectively guaranteed. The low computational complexity of the heuristic approach makes it applicable for quickly responding to online SFC requests.
Place, publisher, year, edition, pages
Elsevier, 2019. Vol. 91, p. 347-360
Keywords [en]
Service function chaining, Orchestration, Energy efficiency, Multi-domain networks
National Category
Computer and Information Sciences
Research subject
Pervasive Mobile Computing
Identifiers
URN: urn:nbn:se:ltu:diva-71011DOI: 10.1016/j.future.2018.09.037ISI: 000451790900029Scopus ID: 2-s2.0-85053801008OAI: oai:DiVA.org:ltu-71011DiVA, id: diva2:1251552
Note
Validerad;2018;Nivå 2;2018-09-27 (svasva)
2018-09-272018-09-272025-02-18Bibliographically approved