Virtual network mapping strategy and competitive analysis based on cost constraint

The approximation algorithm of single virtual network mapping solution aimed to minimize the mapping cost based on convex quadratic programming relaxation was designed. Then aiming for dynamic arrival construction request of the single virtual network,the mapping scheme was achieved based on physica...

Full description

Saved in:
Bibliographic Details
Main Authors: Jianjun YU, Chunming WU
Format: Article
Language:zho
Published: Beijing Xintong Media Co., Ltd 2016-02-01
Series:Dianxin kexue
Subjects:
Online Access:http://www.telecomsci.com/zh/article/doi/10.3969/j.issn.1000-0801.2016.02.007/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1841529774827110400
author Jianjun YU
Chunming WU
author_facet Jianjun YU
Chunming WU
author_sort Jianjun YU
collection DOAJ
description The approximation algorithm of single virtual network mapping solution aimed to minimize the mapping cost based on convex quadratic programming relaxation was designed. Then aiming for dynamic arrival construction request of the single virtual network,the mapping scheme was achieved based on physical network resource pricing strategy by shadow price,applying above-mentioned approximation algorithm. And then completed the competitive algorithm design based on virtual network admission control strategy by mapping cost constraint and provided the competitive analysis of this algorithm. Experiment results show that the proposed algorithm increases the effective utilization of physical network resources,hence it can improve the virtual network construction request acceptance ratio and the long-term profit of physical network service provider.
format Article
id doaj-art-21ba5a101f30448580772094af0fc9bf
institution Kabale University
issn 1000-0801
language zho
publishDate 2016-02-01
publisher Beijing Xintong Media Co., Ltd
record_format Article
series Dianxin kexue
spelling doaj-art-21ba5a101f30448580772094af0fc9bf2025-01-15T03:15:17ZzhoBeijing Xintong Media Co., LtdDianxin kexue1000-08012016-02-0132475459610105Virtual network mapping strategy and competitive analysis based on cost constraintJianjun YUChunming WUThe approximation algorithm of single virtual network mapping solution aimed to minimize the mapping cost based on convex quadratic programming relaxation was designed. Then aiming for dynamic arrival construction request of the single virtual network,the mapping scheme was achieved based on physical network resource pricing strategy by shadow price,applying above-mentioned approximation algorithm. And then completed the competitive algorithm design based on virtual network admission control strategy by mapping cost constraint and provided the competitive analysis of this algorithm. Experiment results show that the proposed algorithm increases the effective utilization of physical network resources,hence it can improve the virtual network construction request acceptance ratio and the long-term profit of physical network service provider.http://www.telecomsci.com/zh/article/doi/10.3969/j.issn.1000-0801.2016.02.007/virtual network mappingmapping costconvex quadratic programming relaxationadmission controlcompetitive algorithm
spellingShingle Jianjun YU
Chunming WU
Virtual network mapping strategy and competitive analysis based on cost constraint
Dianxin kexue
virtual network mapping
mapping cost
convex quadratic programming relaxation
admission control
competitive algorithm
title Virtual network mapping strategy and competitive analysis based on cost constraint
title_full Virtual network mapping strategy and competitive analysis based on cost constraint
title_fullStr Virtual network mapping strategy and competitive analysis based on cost constraint
title_full_unstemmed Virtual network mapping strategy and competitive analysis based on cost constraint
title_short Virtual network mapping strategy and competitive analysis based on cost constraint
title_sort virtual network mapping strategy and competitive analysis based on cost constraint
topic virtual network mapping
mapping cost
convex quadratic programming relaxation
admission control
competitive algorithm
url http://www.telecomsci.com/zh/article/doi/10.3969/j.issn.1000-0801.2016.02.007/
work_keys_str_mv AT jianjunyu virtualnetworkmappingstrategyandcompetitiveanalysisbasedoncostconstraint
AT chunmingwu virtualnetworkmappingstrategyandcompetitiveanalysisbasedoncostconstraint