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!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1000-0801 |