Constructing multiple steiner trees for software-defined networking multicast

Jehn Ruey Jiang, Szu Yuan Chen

研究成果: 書貢獻/報告類型會議論文篇章同行評審

5 引文 斯高帕斯(Scopus)

摘要

A heuristic algorithm is proposed in this paper to construct a set of Steiner trees for multicast with multiple sources under the softwaredefined networking (SDN) architecture, where each source is associated with a group of receivers. It is based on the extended Dijkstra's shortest path algorithm and the modified selective closest terminal first Steiner tree algorithm. The former algorithm considers not only the edge weights but also the node weights to form data routing path with the shortest delay. The latter algorithm regards nodes with shorter paths to the source to have higher priority in the priority queue for growing Steiner trees. In this way, the number of Steiner tree edges is reduced and thus the bandwidth consumption is cut down. The proposed algorithm is simulated by the EstiNet emulator along with a Ryu controller for different multicast scenarios. The simulation results are compared with those of related algorithms in terms of the source-To-receiver delay and the bandwidth consumption to show the advantage of the proposed algorithm.

原文???core.languages.en_GB???
主出版物標題Proceedings of the 11th International Conference on Future Internet Technologies, CFI 2016
發行者Association for Computing Machinery
頁面1-6
頁數6
ISBN(電子)9781450341813
DOIs
出版狀態已出版 - 15 6月 2016
事件11th International Conference on Future Internet Technologies, CFI 2016 - Nanjing, China
持續時間: 15 6月 201617 6月 2016

出版系列

名字ACM International Conference Proceeding Series
15-17-June-2016

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???11th International Conference on Future Internet Technologies, CFI 2016
國家/地區China
城市Nanjing
期間15/06/1617/06/16

指紋

深入研究「Constructing multiple steiner trees for software-defined networking multicast」主題。共同形成了獨特的指紋。

引用此