A Hybrid Reliable Heuristic Mapping Method Based on Survivable Virtual Networks for Network Virtualization
The reliable mapping of virtual networks is one of the hot issues in network virtualization researches. Unlike the traditional protection mechanisms based on redundancy and recovery mechanisms, we take the solution of the survivable virtual topology routing problem for reference to ensure that the r...
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2015/316801 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849402169382404096 |
|---|---|
| author | Qiang Zhu Hui-Qiang Wang Guang-Sheng Feng Hong-Wu Lv Zhen-Dong Wang Xiu-Xiu Wen Wei Jiang |
| author_facet | Qiang Zhu Hui-Qiang Wang Guang-Sheng Feng Hong-Wu Lv Zhen-Dong Wang Xiu-Xiu Wen Wei Jiang |
| author_sort | Qiang Zhu |
| collection | DOAJ |
| description | The reliable mapping of virtual networks is one of the hot issues in network virtualization researches. Unlike the traditional protection mechanisms based on redundancy and recovery mechanisms, we take the solution of the survivable virtual topology routing problem for reference to ensure that the rest of the mapped virtual networks keeps connected under a single node failure condition in the substrate network, which guarantees the completeness of the virtual network and continuity of services. In order to reduce the cost of the substrate network, a hybrid reliable heuristic mapping method based on survivable virtual networks (Hybrid-RHM-SVN) is proposed. In Hybrid-RHM-SVN, we formulate the reliable mapping problem as an integer linear program. Firstly, we calculate the primary-cut set of the virtual network subgraph where the failed node has been removed. Then, we use the ant colony optimization algorithm to achieve the approximate optimal mapping. The links in primary-cut set should select a substrate path that does not pass through the substrate node corresponding to the virtual node that has been removed first. The simulation results show that the acceptance rate of virtual networks, the average revenue of mapping, and the recovery rate of virtual networks are increased compared with the existing reliable mapping algorithms, respectively. |
| format | Article |
| id | doaj-art-832458fa033c45c8bd68fd5a9ff11517 |
| institution | Kabale University |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2015-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-832458fa033c45c8bd68fd5a9ff115172025-08-20T03:37:37ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2015-01-01201510.1155/2015/316801316801A Hybrid Reliable Heuristic Mapping Method Based on Survivable Virtual Networks for Network VirtualizationQiang Zhu0Hui-Qiang Wang1Guang-Sheng Feng2Hong-Wu Lv3Zhen-Dong Wang4Xiu-Xiu Wen5Wei Jiang6College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, ChinaCollege of Computer Science and Technology, Harbin Engineering University, Harbin 150001, ChinaCollege of Computer Science and Technology, Harbin Engineering University, Harbin 150001, ChinaCollege of Computer Science and Technology, Harbin Engineering University, Harbin 150001, ChinaFaculty of Information Engineering, Jiangxi University of Science and Technology, Ganzhou 341000, ChinaCollege of Computer Science and Technology, Harbin Engineering University, Harbin 150001, ChinaCollege of Computer Science and Technology, Harbin Engineering University, Harbin 150001, ChinaThe reliable mapping of virtual networks is one of the hot issues in network virtualization researches. Unlike the traditional protection mechanisms based on redundancy and recovery mechanisms, we take the solution of the survivable virtual topology routing problem for reference to ensure that the rest of the mapped virtual networks keeps connected under a single node failure condition in the substrate network, which guarantees the completeness of the virtual network and continuity of services. In order to reduce the cost of the substrate network, a hybrid reliable heuristic mapping method based on survivable virtual networks (Hybrid-RHM-SVN) is proposed. In Hybrid-RHM-SVN, we formulate the reliable mapping problem as an integer linear program. Firstly, we calculate the primary-cut set of the virtual network subgraph where the failed node has been removed. Then, we use the ant colony optimization algorithm to achieve the approximate optimal mapping. The links in primary-cut set should select a substrate path that does not pass through the substrate node corresponding to the virtual node that has been removed first. The simulation results show that the acceptance rate of virtual networks, the average revenue of mapping, and the recovery rate of virtual networks are increased compared with the existing reliable mapping algorithms, respectively.http://dx.doi.org/10.1155/2015/316801 |
| spellingShingle | Qiang Zhu Hui-Qiang Wang Guang-Sheng Feng Hong-Wu Lv Zhen-Dong Wang Xiu-Xiu Wen Wei Jiang A Hybrid Reliable Heuristic Mapping Method Based on Survivable Virtual Networks for Network Virtualization Discrete Dynamics in Nature and Society |
| title | A Hybrid Reliable Heuristic Mapping Method Based on Survivable Virtual Networks for Network Virtualization |
| title_full | A Hybrid Reliable Heuristic Mapping Method Based on Survivable Virtual Networks for Network Virtualization |
| title_fullStr | A Hybrid Reliable Heuristic Mapping Method Based on Survivable Virtual Networks for Network Virtualization |
| title_full_unstemmed | A Hybrid Reliable Heuristic Mapping Method Based on Survivable Virtual Networks for Network Virtualization |
| title_short | A Hybrid Reliable Heuristic Mapping Method Based on Survivable Virtual Networks for Network Virtualization |
| title_sort | hybrid reliable heuristic mapping method based on survivable virtual networks for network virtualization |
| url | http://dx.doi.org/10.1155/2015/316801 |
| work_keys_str_mv | AT qiangzhu ahybridreliableheuristicmappingmethodbasedonsurvivablevirtualnetworksfornetworkvirtualization AT huiqiangwang ahybridreliableheuristicmappingmethodbasedonsurvivablevirtualnetworksfornetworkvirtualization AT guangshengfeng ahybridreliableheuristicmappingmethodbasedonsurvivablevirtualnetworksfornetworkvirtualization AT hongwulv ahybridreliableheuristicmappingmethodbasedonsurvivablevirtualnetworksfornetworkvirtualization AT zhendongwang ahybridreliableheuristicmappingmethodbasedonsurvivablevirtualnetworksfornetworkvirtualization AT xiuxiuwen ahybridreliableheuristicmappingmethodbasedonsurvivablevirtualnetworksfornetworkvirtualization AT weijiang ahybridreliableheuristicmappingmethodbasedonsurvivablevirtualnetworksfornetworkvirtualization AT qiangzhu hybridreliableheuristicmappingmethodbasedonsurvivablevirtualnetworksfornetworkvirtualization AT huiqiangwang hybridreliableheuristicmappingmethodbasedonsurvivablevirtualnetworksfornetworkvirtualization AT guangshengfeng hybridreliableheuristicmappingmethodbasedonsurvivablevirtualnetworksfornetworkvirtualization AT hongwulv hybridreliableheuristicmappingmethodbasedonsurvivablevirtualnetworksfornetworkvirtualization AT zhendongwang hybridreliableheuristicmappingmethodbasedonsurvivablevirtualnetworksfornetworkvirtualization AT xiuxiuwen hybridreliableheuristicmappingmethodbasedonsurvivablevirtualnetworksfornetworkvirtualization AT weijiang hybridreliableheuristicmappingmethodbasedonsurvivablevirtualnetworksfornetworkvirtualization |