Building Steiner Tree with Extended Dijkstra's Algorithm for Software-Defined Networking Multicast
碩士 === 國立中央大學 === 資訊工程學系 === 103 === We propose a method to build multicast tree for live video streaming with Extended Dijkstra’s Shortest Path algorithm and Modified Selective Closest Terminal First Steiner Tree algorithm. It can decrease the delay time, the volume of package transmission, and the...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/59609745107487089452 |
id |
ndltd-TW-103NCU05392109 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-103NCU053921092016-08-17T04:23:15Z http://ndltd.ncl.edu.tw/handle/59609745107487089452 Building Steiner Tree with Extended Dijkstra's Algorithm for Software-Defined Networking Multicast 使用延伸Dijkstra演算法建立Steiner樹用於軟體定義網路群播 Szu-Yuan Chen 陳思源 碩士 國立中央大學 資訊工程學系 103 We propose a method to build multicast tree for live video streaming with Extended Dijkstra’s Shortest Path algorithm and Modified Selective Closest Terminal First Steiner Tree algorithm. It can decrease the delay time, the volume of package transmission, and the usage of Internet bandwidth. We can allocate network resources more efficiently to reduce the heavy congestion in the rush hour. Extended Dijkstra’s Shortest Path algorithm considers not only the edge weights but also the node weights for building package transmission path with the shortest delay. In Modified SCTF Steiner Tree algorithm, we let the node near to source have higher priority to add in priority queue. In this way, we can decrease the number of internal node in Steiner tree for using less bandwidth. We take our experiment in EstiNet simulator with different network topology, different number of servers, different number of multicasting groups, and different number of multicasting subscribers. We simulate our method with constant bit rate and modified Ryu controller. We compare the average end-to-end delay and total bandwidth consumption between our algorithm and other six kinds of related algorithms. The results show that the proposed algorithm seconds only to the exhaustive optimal Steiner tree algorithm in total bandwidth consumption, and has the least average end-to-end delay after Extended Dijkstra’s Shortest Path algorithm. Jehn-Ruey Jiang 江振瑞 2015 學位論文 ; thesis 37 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立中央大學 === 資訊工程學系 === 103 === We propose a method to build multicast tree for live video streaming with Extended Dijkstra’s Shortest Path algorithm and Modified Selective Closest Terminal First Steiner Tree algorithm. It can decrease the delay time, the volume of package transmission, and the usage of Internet bandwidth. We can allocate network resources more efficiently to reduce the heavy congestion in the rush hour.
Extended Dijkstra’s Shortest Path algorithm considers not only the edge weights but also the node weights for building package transmission path with the shortest delay. In Modified SCTF Steiner Tree algorithm, we let the node near to source have higher priority to add in priority queue. In this way, we can decrease the number of internal node in Steiner tree for using less bandwidth. We take our experiment in EstiNet simulator with different network topology, different number of servers, different number of multicasting groups, and different number of multicasting subscribers. We simulate our method with constant bit rate and modified Ryu controller. We compare the average end-to-end delay and total bandwidth consumption between our algorithm and other six kinds of related algorithms. The results show that the proposed algorithm seconds only to the exhaustive optimal Steiner tree algorithm in total bandwidth consumption, and has the least average end-to-end delay after Extended Dijkstra’s Shortest Path algorithm.
|
author2 |
Jehn-Ruey Jiang |
author_facet |
Jehn-Ruey Jiang Szu-Yuan Chen 陳思源 |
author |
Szu-Yuan Chen 陳思源 |
spellingShingle |
Szu-Yuan Chen 陳思源 Building Steiner Tree with Extended Dijkstra's Algorithm for Software-Defined Networking Multicast |
author_sort |
Szu-Yuan Chen |
title |
Building Steiner Tree with Extended Dijkstra's Algorithm for Software-Defined Networking Multicast |
title_short |
Building Steiner Tree with Extended Dijkstra's Algorithm for Software-Defined Networking Multicast |
title_full |
Building Steiner Tree with Extended Dijkstra's Algorithm for Software-Defined Networking Multicast |
title_fullStr |
Building Steiner Tree with Extended Dijkstra's Algorithm for Software-Defined Networking Multicast |
title_full_unstemmed |
Building Steiner Tree with Extended Dijkstra's Algorithm for Software-Defined Networking Multicast |
title_sort |
building steiner tree with extended dijkstra's algorithm for software-defined networking multicast |
publishDate |
2015 |
url |
http://ndltd.ncl.edu.tw/handle/59609745107487089452 |
work_keys_str_mv |
AT szuyuanchen buildingsteinertreewithextendeddijkstrasalgorithmforsoftwaredefinednetworkingmulticast AT chénsīyuán buildingsteinertreewithextendeddijkstrasalgorithmforsoftwaredefinednetworkingmulticast AT szuyuanchen shǐyòngyánshēndijkstrayǎnsuànfǎjiànlìsteinershùyòngyúruǎntǐdìngyìwǎnglùqúnbō AT chénsīyuán shǐyòngyánshēndijkstrayǎnsuànfǎjiànlìsteinershùyòngyúruǎntǐdìngyìwǎnglùqúnbō |
_version_ |
1718377901329481728 |