Study on Transmission Performance Enhancement Using Adaptive Path Selection in Software Defined Networks
碩士 === 國立臺北教育大學 === 資訊科學系碩士班 === 103 === Routing Control is a useful feature in Software Defined Networks (SDNs). A routing path with high bandwidth and low packet loss rate can enhance the transmission throughput. So, identifying the best transmission routing path is an important issue in the SDN e...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/55101876021332089278 |
id |
ndltd-TW-103NTPT0394026 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-103NTPT03940262016-07-16T04:11:58Z http://ndltd.ncl.edu.tw/handle/55101876021332089278 Study on Transmission Performance Enhancement Using Adaptive Path Selection in Software Defined Networks 在軟體定義網路中以調適性路徑選擇提升傳輸效能之研究 Shih-Chang Wu 吳石昌 碩士 國立臺北教育大學 資訊科學系碩士班 103 Routing Control is a useful feature in Software Defined Networks (SDNs). A routing path with high bandwidth and low packet loss rate can enhance the transmission throughput. So, identifying the best transmission routing path is an important issue in the SDN environments. However, because of the dynamic nature of the traffic in a network, the best transmission path should be dynamically and adaptively determined. In addition, many network factors such as packet delay and packet loss will also affect the transmission performance. Thus, in this study, an adaptive path selection scheme based on considering the bandwidth, packet delay, and packet loss of all the links in the network is proposed. Moreover, because of the different transmission mechanisms in TCP and UDP traffics, different schemes are proposed for these two traffic types.This study proposes two schemes for determining the routing path to maximize the throughput. In Scheme 1, at first, all the paths between source and destination are derived, and then the TCP transmission mechanism and the UDP throughput formula are utilized to develop the metric formulation for path selection. However, finding all paths is a NP problem, which incurs high computational complexity. To reduce the computation cost, formulation for determine the link weights is developed in Scheme 2. In our design, a low link weight implies the link can achieve high transmission performance. Thus, the Bellman-Ford algorithm is used to derive the minimum weight path, which should have the best transmission performance. Our simulation results show that the transmission paths derived by Scheme 1 and Scheme 2 are similar, and they are either the best or the second best transmission paths that achieve the highest throughput. Yeong-Sheng Chen 陳永昇 2015 學位論文 ; thesis 47 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺北教育大學 === 資訊科學系碩士班 === 103 === Routing Control is a useful feature in Software Defined Networks (SDNs). A routing path with high bandwidth and low packet loss rate can enhance the transmission throughput. So, identifying the best transmission routing path is an important issue in the SDN environments. However, because of the dynamic nature of the traffic in a network, the best transmission path should be dynamically and adaptively determined. In addition, many network factors such as packet delay and packet loss will also affect the transmission performance. Thus, in this study, an adaptive path selection scheme based on considering the bandwidth, packet delay, and packet loss of all the links in the network is proposed. Moreover, because of the different transmission mechanisms in TCP and UDP traffics, different schemes are proposed for these two traffic types.This study proposes two schemes for determining the routing path to maximize the throughput. In Scheme 1, at first, all the paths between source and destination are derived, and then the TCP transmission mechanism and the UDP throughput formula are utilized to develop the metric formulation for path selection. However, finding all paths is a NP problem, which incurs high computational complexity. To reduce the computation cost, formulation for determine the link weights is developed in Scheme 2. In our design, a low link weight implies the link can achieve high transmission performance. Thus, the Bellman-Ford algorithm is used to derive the minimum weight path, which should have the best transmission performance. Our simulation results show that the transmission paths derived by Scheme 1 and Scheme 2 are similar, and they are either the best or the second best transmission paths that achieve the highest throughput.
|
author2 |
Yeong-Sheng Chen |
author_facet |
Yeong-Sheng Chen Shih-Chang Wu 吳石昌 |
author |
Shih-Chang Wu 吳石昌 |
spellingShingle |
Shih-Chang Wu 吳石昌 Study on Transmission Performance Enhancement Using Adaptive Path Selection in Software Defined Networks |
author_sort |
Shih-Chang Wu |
title |
Study on Transmission Performance Enhancement Using Adaptive Path Selection in Software Defined Networks |
title_short |
Study on Transmission Performance Enhancement Using Adaptive Path Selection in Software Defined Networks |
title_full |
Study on Transmission Performance Enhancement Using Adaptive Path Selection in Software Defined Networks |
title_fullStr |
Study on Transmission Performance Enhancement Using Adaptive Path Selection in Software Defined Networks |
title_full_unstemmed |
Study on Transmission Performance Enhancement Using Adaptive Path Selection in Software Defined Networks |
title_sort |
study on transmission performance enhancement using adaptive path selection in software defined networks |
publishDate |
2015 |
url |
http://ndltd.ncl.edu.tw/handle/55101876021332089278 |
work_keys_str_mv |
AT shihchangwu studyontransmissionperformanceenhancementusingadaptivepathselectioninsoftwaredefinednetworks AT wúshíchāng studyontransmissionperformanceenhancementusingadaptivepathselectioninsoftwaredefinednetworks AT shihchangwu zàiruǎntǐdìngyìwǎnglùzhōngyǐdiàoshìxìnglùjìngxuǎnzétíshēngchuánshūxiàonéngzhīyánjiū AT wúshíchāng zàiruǎntǐdìngyìwǎnglùzhōngyǐdiàoshìxìnglùjìngxuǎnzétíshēngchuánshūxiàonéngzhīyánjiū |
_version_ |
1718351328313344000 |