A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining Game

Software-defined networking (SDN) and network function virtualization (NFV) technologies provide support for service function chain (SFC) deployment. As the scale of a network expands, SDN domains are maintained and managed by their respective network operators. When deploying an SFC in multiple dom...

Full description

Bibliographic Details
Main Authors: Guoyan Li, Yajuan Ren, Yi Liu
Format: Article
Language:English
Published: Hindawi Limited 2021-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2021/6669917
id doaj-e7ae3beff3b24ea9b1bce26dd102eb76
record_format Article
spelling doaj-e7ae3beff3b24ea9b1bce26dd102eb762021-02-15T12:53:08ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472021-01-01202110.1155/2021/66699176669917A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining GameGuoyan Li0Yajuan Ren1Yi Liu2School of Computer and Information Engineering, Tianjin Chengjian University, Tianjin 300384, ChinaSchool of Computer and Information Engineering, Tianjin Chengjian University, Tianjin 300384, ChinaSchool of Computer and Information Engineering, Tianjin Chengjian University, Tianjin 300384, ChinaSoftware-defined networking (SDN) and network function virtualization (NFV) technologies provide support for service function chain (SFC) deployment. As the scale of a network expands, SDN domains are maintained and managed by their respective network operators. When deploying an SFC in multiple domains, to protect the privacy of each domain is challenging. We propose a cross-domain SFC deployment scheme based on a bargaining game. We establish an effective cross-domain service chain system model and combine resource consumption cost and load balance to translate SFC deployment to an optimization problem. A bargaining game model is established so as to reasonably optimize these contradictory parameters. We solve the model by an improved imperialist competition algorithm and obtain the optimal node mapping relationship. Experimental results show that our method performs better than the current one in terms of network load balancing and mapping overhead and has better scalability.http://dx.doi.org/10.1155/2021/6669917
collection DOAJ
language English
format Article
sources DOAJ
author Guoyan Li
Yajuan Ren
Yi Liu
spellingShingle Guoyan Li
Yajuan Ren
Yi Liu
A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining Game
Mathematical Problems in Engineering
author_facet Guoyan Li
Yajuan Ren
Yi Liu
author_sort Guoyan Li
title A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining Game
title_short A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining Game
title_full A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining Game
title_fullStr A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining Game
title_full_unstemmed A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining Game
title_sort cross-domain service function chain deployment scheme based on bargaining game
publisher Hindawi Limited
series Mathematical Problems in Engineering
issn 1024-123X
1563-5147
publishDate 2021-01-01
description Software-defined networking (SDN) and network function virtualization (NFV) technologies provide support for service function chain (SFC) deployment. As the scale of a network expands, SDN domains are maintained and managed by their respective network operators. When deploying an SFC in multiple domains, to protect the privacy of each domain is challenging. We propose a cross-domain SFC deployment scheme based on a bargaining game. We establish an effective cross-domain service chain system model and combine resource consumption cost and load balance to translate SFC deployment to an optimization problem. A bargaining game model is established so as to reasonably optimize these contradictory parameters. We solve the model by an improved imperialist competition algorithm and obtain the optimal node mapping relationship. Experimental results show that our method performs better than the current one in terms of network load balancing and mapping overhead and has better scalability.
url http://dx.doi.org/10.1155/2021/6669917
work_keys_str_mv AT guoyanli acrossdomainservicefunctionchaindeploymentschemebasedonbargaininggame
AT yajuanren acrossdomainservicefunctionchaindeploymentschemebasedonbargaininggame
AT yiliu acrossdomainservicefunctionchaindeploymentschemebasedonbargaininggame
AT guoyanli crossdomainservicefunctionchaindeploymentschemebasedonbargaininggame
AT yajuanren crossdomainservicefunctionchaindeploymentschemebasedonbargaininggame
AT yiliu crossdomainservicefunctionchaindeploymentschemebasedonbargaininggame
_version_ 1714866558766940160