A graph partitioning game theoretical approach for the VNF service chaining problem

Aris Leivadeas, George Kesidis, Matthias Falkner, Ioannis Lambadaris

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Network function virtualization along with network service chaining and forwarding graphs envision a reduction in the respective cost that end users, service providers, and network operators are experiencing, while providing complete and high quality services. The allocation of these service chains in a pool of available cloud or data center resources is a challenging problem that can affect the overall performance of the offered network services. Furthermore, a number of challenges associated with the hardware capabilities and the available resources of the cloud infrastructure, along with possible collocation constraints between the components of the service chain, can exponentially increase the complexity of resource allocation. This paper examines how to improve the overall allocation performance of deploying service chains in a cloud environment satisfying server affinity, collocation, and latency constraints. The proposed method is inspired by a partitioning game, where the various components of a service chain are split in a set of partitions executed as virtual machines/containers in appropriate servers. We mathematically prove that a Nash equilibrium exists for our partitioning game corresponding to an optimal solution. By implementing the partitioning game as an iterative refinement process, we also experimentally validate that the proposed algorithm converges to the optimal solution.

Original languageEnglish (US)
Pages (from-to)890-903
Number of pages14
JournalIEEE Transactions on Network and Service Management
Volume14
Issue number4
DOIs
StatePublished - Dec 2017

Fingerprint

Servers
Resource allocation
Containers
Hardware
Costs
Network function virtualization
Virtual machine

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Leivadeas, Aris ; Kesidis, George ; Falkner, Matthias ; Lambadaris, Ioannis. / A graph partitioning game theoretical approach for the VNF service chaining problem. In: IEEE Transactions on Network and Service Management. 2017 ; Vol. 14, No. 4. pp. 890-903.
@article{8f45986bbd6f4961b685a39173388693,
title = "A graph partitioning game theoretical approach for the VNF service chaining problem",
abstract = "Network function virtualization along with network service chaining and forwarding graphs envision a reduction in the respective cost that end users, service providers, and network operators are experiencing, while providing complete and high quality services. The allocation of these service chains in a pool of available cloud or data center resources is a challenging problem that can affect the overall performance of the offered network services. Furthermore, a number of challenges associated with the hardware capabilities and the available resources of the cloud infrastructure, along with possible collocation constraints between the components of the service chain, can exponentially increase the complexity of resource allocation. This paper examines how to improve the overall allocation performance of deploying service chains in a cloud environment satisfying server affinity, collocation, and latency constraints. The proposed method is inspired by a partitioning game, where the various components of a service chain are split in a set of partitions executed as virtual machines/containers in appropriate servers. We mathematically prove that a Nash equilibrium exists for our partitioning game corresponding to an optimal solution. By implementing the partitioning game as an iterative refinement process, we also experimentally validate that the proposed algorithm converges to the optimal solution.",
author = "Aris Leivadeas and George Kesidis and Matthias Falkner and Ioannis Lambadaris",
year = "2017",
month = "12",
doi = "10.1109/TNSM.2017.2732699",
language = "English (US)",
volume = "14",
pages = "890--903",
journal = "IEEE Transactions on Network and Service Management",
issn = "1932-4537",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

A graph partitioning game theoretical approach for the VNF service chaining problem. / Leivadeas, Aris; Kesidis, George; Falkner, Matthias; Lambadaris, Ioannis.

In: IEEE Transactions on Network and Service Management, Vol. 14, No. 4, 12.2017, p. 890-903.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A graph partitioning game theoretical approach for the VNF service chaining problem

AU - Leivadeas, Aris

AU - Kesidis, George

AU - Falkner, Matthias

AU - Lambadaris, Ioannis

PY - 2017/12

Y1 - 2017/12

N2 - Network function virtualization along with network service chaining and forwarding graphs envision a reduction in the respective cost that end users, service providers, and network operators are experiencing, while providing complete and high quality services. The allocation of these service chains in a pool of available cloud or data center resources is a challenging problem that can affect the overall performance of the offered network services. Furthermore, a number of challenges associated with the hardware capabilities and the available resources of the cloud infrastructure, along with possible collocation constraints between the components of the service chain, can exponentially increase the complexity of resource allocation. This paper examines how to improve the overall allocation performance of deploying service chains in a cloud environment satisfying server affinity, collocation, and latency constraints. The proposed method is inspired by a partitioning game, where the various components of a service chain are split in a set of partitions executed as virtual machines/containers in appropriate servers. We mathematically prove that a Nash equilibrium exists for our partitioning game corresponding to an optimal solution. By implementing the partitioning game as an iterative refinement process, we also experimentally validate that the proposed algorithm converges to the optimal solution.

AB - Network function virtualization along with network service chaining and forwarding graphs envision a reduction in the respective cost that end users, service providers, and network operators are experiencing, while providing complete and high quality services. The allocation of these service chains in a pool of available cloud or data center resources is a challenging problem that can affect the overall performance of the offered network services. Furthermore, a number of challenges associated with the hardware capabilities and the available resources of the cloud infrastructure, along with possible collocation constraints between the components of the service chain, can exponentially increase the complexity of resource allocation. This paper examines how to improve the overall allocation performance of deploying service chains in a cloud environment satisfying server affinity, collocation, and latency constraints. The proposed method is inspired by a partitioning game, where the various components of a service chain are split in a set of partitions executed as virtual machines/containers in appropriate servers. We mathematically prove that a Nash equilibrium exists for our partitioning game corresponding to an optimal solution. By implementing the partitioning game as an iterative refinement process, we also experimentally validate that the proposed algorithm converges to the optimal solution.

UR - http://www.scopus.com/inward/record.url?scp=85044400499&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85044400499&partnerID=8YFLogxK

U2 - 10.1109/TNSM.2017.2732699

DO - 10.1109/TNSM.2017.2732699

M3 - Article

AN - SCOPUS:85044400499

VL - 14

SP - 890

EP - 903

JO - IEEE Transactions on Network and Service Management

JF - IEEE Transactions on Network and Service Management

SN - 1932-4537

IS - 4

ER -