Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Energy-efficient and traffic-aware service function chaining orchestration in multi-domain networks
Key Lab of Optical Fiber Sensing and Communications (Ministry of Education), University of Electronic Science and Technology of China, Chengdu, China. Center for Cyber Security, University of Electronic Science and Technology of China, Chengdu, China.
Key Lab of Optical Fiber Sensing and Communications (Ministry of Education), University of Electronic Science and Technology of China, Chengdu, China.
Key Lab of Optical Fiber Sensing and Communications (Ministry of Education), University of Electronic Science and Technology of China, Chengdu, China. Center for Cyber Security, University of Electronic Science and Technology of China, Chengdu, China.
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.ORCID iD: 0000-0003-1902-9877
Show others and affiliations
2019 (English)In: Future generations 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
Media and Communication Technology
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)

Available from: 2018-09-27 Created: 2018-09-27 Last updated: 2019-03-27Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Vasilakos, Athanasios

Search in DiVA

By author/editor
Vasilakos, Athanasios
By organisation
Computer Science
In the same journal
Future generations computer systems
Media and Communication Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 4568 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf