Passer à la navigation principale Passer à la recherche Passer au contenu principal

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

  • Carleton University
  • Pennsylvania State University
  • Cisco Systems

Résultats de recherche: Contribution à un journal › Article publié dans une revue, révisé par les pairs › Revue par des pairs

36 Citations (Scopus)

Résumé

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.

langue originaleAnglais
Pages (de - à)890-903
Nombre de pages14
journalIEEE Transactions on Network and Service Management
Volume14
Numéro de publication4
Les DOIs
étatPublié - déc. 2017
Modification externeOui

Classification disciplinaire ASJC Scopus

  • Réseaux informatiques et communications
  • Ingénierie électrique et électronique

Empreinte digitale

Voici les principaux termes ou expressions associés à « A graph partitioning game theoretical approach for the VNF service chaining problem ». Ces libellés thématiques sont générés à partir du titre et du résumé de la publication. Ensemble, ils forment une empreinte digitale unique.

Citer cette ressource