Design of Virtual Network Mapping Algorithm Based on K-Best Perfect Matchings of Bipartite Graph
To improve the feasibility of virtual node mapping，grounded on feasibility test theorem and node rank indicators used to measure node availability，the virtual network mapping iterative algorithm based on K-best perfect matchings of bipartite graph was proposed，aiming at reducing mapping cost.Experim...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2014-02-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.3969/j.issn.1000-0801.2014.02.009/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841529254989266944 |
|---|---|
| author | Jianjun Yu Chunming Wu |
| author_facet | Jianjun Yu Chunming Wu |
| author_sort | Jianjun Yu |
| collection | DOAJ |
| description | To improve the feasibility of virtual node mapping，grounded on feasibility test theorem and node rank indicators used to measure node availability，the virtual network mapping iterative algorithm based on K-best perfect matchings of bipartite graph was proposed，aiming at reducing mapping cost.Experiment shows that the proposed algorithm increases virtual network construction request acceptance ratio and benefit cost ratio，and hence can improve profit of physical network service provider. |
| format | Article |
| id | doaj-art-4f3500316d154f00b4056c55334559ee |
| institution | Kabale University |
| issn | 1000-0801 |
| language | zho |
| publishDate | 2014-02-01 |
| publisher | Beijing Xintong Media Co., Ltd |
| record_format | Article |
| series | Dianxin kexue |
| spelling | doaj-art-4f3500316d154f00b4056c55334559ee2025-01-15T03:20:32ZzhoBeijing Xintong Media Co., LtdDianxin kexue1000-08012014-02-0130707559623620Design of Virtual Network Mapping Algorithm Based on K-Best Perfect Matchings of Bipartite GraphJianjun YuChunming WuTo improve the feasibility of virtual node mapping，grounded on feasibility test theorem and node rank indicators used to measure node availability，the virtual network mapping iterative algorithm based on K-best perfect matchings of bipartite graph was proposed，aiming at reducing mapping cost.Experiment shows that the proposed algorithm increases virtual network construction request acceptance ratio and benefit cost ratio，and hence can improve profit of physical network service provider.http://www.telecomsci.com/zh/article/doi/10.3969/j.issn.1000-0801.2014.02.009/virtual node mappingnode rankfeasibility test theoremK-best perfect matchings of bipartite graph |
| spellingShingle | Jianjun Yu Chunming Wu Design of Virtual Network Mapping Algorithm Based on K-Best Perfect Matchings of Bipartite Graph Dianxin kexue virtual node mapping node rank feasibility test theorem K-best perfect matchings of bipartite graph |
| title | Design of Virtual Network Mapping Algorithm Based on K-Best Perfect Matchings of Bipartite Graph |
| title_full | Design of Virtual Network Mapping Algorithm Based on K-Best Perfect Matchings of Bipartite Graph |
| title_fullStr | Design of Virtual Network Mapping Algorithm Based on K-Best Perfect Matchings of Bipartite Graph |
| title_full_unstemmed | Design of Virtual Network Mapping Algorithm Based on K-Best Perfect Matchings of Bipartite Graph |
| title_short | Design of Virtual Network Mapping Algorithm Based on K-Best Perfect Matchings of Bipartite Graph |
| title_sort | design of virtual network mapping algorithm based on k best perfect matchings of bipartite graph |
| topic | virtual node mapping node rank feasibility test theorem K-best perfect matchings of bipartite graph |
| url | http://www.telecomsci.com/zh/article/doi/10.3969/j.issn.1000-0801.2014.02.009/ |
| work_keys_str_mv | AT jianjunyu designofvirtualnetworkmappingalgorithmbasedonkbestperfectmatchingsofbipartitegraph AT chunmingwu designofvirtualnetworkmappingalgorithmbasedonkbestperfectmatchingsofbipartitegraph |