Efficient Resource Allocation and Link Recovery Mechanism for Resilient SDN/NFV-based Communications
碩士 === 國立臺灣科技大學 === 電子工程系 === 107 === It is crucial to achieve high reliability and low latency concurrently for networked applications such as smart grid, data center, and intellengent factory. Software-Defined Networking (SDN) and Network Function Virtualization (NFV) are two novel network technol...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2019
|
Online Access: | http://ndltd.ncl.edu.tw/handle/8rm6z6 |
id |
ndltd-TW-107NTUS5427022 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-107NTUS54270222019-05-16T01:40:46Z http://ndltd.ncl.edu.tw/handle/8rm6z6 Efficient Resource Allocation and Link Recovery Mechanism for Resilient SDN/NFV-based Communications 基於虛擬化軟體定義網路之高效能資源配置與鏈結回復機制 Chia-Wei Huang 黃佳威 碩士 國立臺灣科技大學 電子工程系 107 It is crucial to achieve high reliability and low latency concurrently for networked applications such as smart grid, data center, and intellengent factory. Software-Defined Networking (SDN) and Network Function Virtualization (NFV) are two novel network technologies that are proposed to break the obstacle of network architecture. SDN put the control plane to a central controller to control network traffic flexibly. NFV virtualize the traditional network function machine into software which installed in the specific machine and could plan network resource flexibly and dynamically. However, they has some bottlenecks. Firstly, in SDN, traditional link recovery mechanism will cost much time and the other faster mechanisms will occupy too many memories in switches. Therefore, to find a fast mechanism with low memory cost is very difficult. Second, in NFV, how to allocate virtualized resources to end users is also a difficult problem. Consequently, Many researches has proposed some algorithms to solve Virtual Network Embedding (VNE) problem. Nevertheless, the efficient algorithm to solve VNE problem is still not proposed. In our thesis, for the first bottleneck, we present a link recovery mechanism which enhances the reliability of the network, maintains low communication latency, and reduces memory utilizations of the switching devices by introducing Segment Routing. The results of our link recovery mechanism could achieve low recovery time and low memory utilization. In the second bottleneck, we propose an efficient VNE algorithm which uses node-rankng approach with global resources and adopts genetic algorithm path splitting method. We also use the link cost function to evaluate the network performance, and the results shows that our VNE algorithm outperforms other works. Chung-An Shen 沈中安 2019 學位論文 ; thesis 44 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣科技大學 === 電子工程系 === 107 === It is crucial to achieve high reliability and low latency concurrently for networked applications such as smart grid, data center, and intellengent factory. Software-Defined Networking (SDN) and Network Function Virtualization (NFV) are two novel network technologies that are proposed to break the obstacle of network architecture. SDN put the control plane to a central controller to control network traffic flexibly. NFV virtualize the traditional network function machine into software which installed in the specific machine and could plan network resource flexibly and dynamically. However, they has some bottlenecks. Firstly, in SDN, traditional link recovery mechanism will cost much time and the other faster mechanisms will occupy too many memories in switches. Therefore, to find a fast mechanism with low memory cost is very difficult. Second, in NFV, how to allocate virtualized resources to end users is also a difficult problem. Consequently, Many researches has proposed some algorithms to solve Virtual Network Embedding (VNE) problem. Nevertheless, the efficient algorithm to solve VNE problem is still not proposed. In our thesis, for the first bottleneck, we present a link recovery mechanism which enhances the reliability of the network, maintains low communication latency, and reduces memory utilizations of the switching devices by introducing Segment Routing. The results of our link recovery mechanism could achieve low recovery time and low memory utilization. In the second bottleneck, we propose an efficient VNE algorithm which uses node-rankng approach with global resources and adopts genetic algorithm path splitting method. We also use the link cost function to evaluate the network performance, and the results shows that our VNE algorithm outperforms other works.
|
author2 |
Chung-An Shen |
author_facet |
Chung-An Shen Chia-Wei Huang 黃佳威 |
author |
Chia-Wei Huang 黃佳威 |
spellingShingle |
Chia-Wei Huang 黃佳威 Efficient Resource Allocation and Link Recovery Mechanism for Resilient SDN/NFV-based Communications |
author_sort |
Chia-Wei Huang |
title |
Efficient Resource Allocation and Link Recovery Mechanism for Resilient SDN/NFV-based Communications |
title_short |
Efficient Resource Allocation and Link Recovery Mechanism for Resilient SDN/NFV-based Communications |
title_full |
Efficient Resource Allocation and Link Recovery Mechanism for Resilient SDN/NFV-based Communications |
title_fullStr |
Efficient Resource Allocation and Link Recovery Mechanism for Resilient SDN/NFV-based Communications |
title_full_unstemmed |
Efficient Resource Allocation and Link Recovery Mechanism for Resilient SDN/NFV-based Communications |
title_sort |
efficient resource allocation and link recovery mechanism for resilient sdn/nfv-based communications |
publishDate |
2019 |
url |
http://ndltd.ncl.edu.tw/handle/8rm6z6 |
work_keys_str_mv |
AT chiaweihuang efficientresourceallocationandlinkrecoverymechanismforresilientsdnnfvbasedcommunications AT huángjiāwēi efficientresourceallocationandlinkrecoverymechanismforresilientsdnnfvbasedcommunications AT chiaweihuang jīyúxūnǐhuàruǎntǐdìngyìwǎnglùzhīgāoxiàonéngzīyuánpèizhìyǔliànjiéhuífùjīzhì AT huángjiāwēi jīyúxūnǐhuàruǎntǐdìngyìwǎnglùzhīgāoxiàonéngzīyuánpèizhìyǔliànjiéhuífùjīzhì |
_version_ |
1719179090261442560 |