Scalable Multicasting with Multiple Shared Trees in Software Defined Networks
碩士 === 國立交通大學 === 網路工程研究所 === 103 === In transmitting streaming with multicast trees, multiple shared trees can relieve the load in a single rendezvous point (RP) and construct shorter paths compared with single shared tree. On the other hand, compared with per-source trees, multiple shared trees ca...
Main Authors: | Liao, Chun-Chieh, 廖俊傑 |
---|---|
Other Authors: | Lin, Ying-Dar |
Format: | Others |
Language: | zh-TW |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/c98dd3 |
Similar Items
-
Efficient Multicast Algorithm for Scalable Video in Software Defined Networking
by: Chang, Che Wei, et al.
Published: (2014) -
A Scalable and Bandwidth-Efficient Multicast Algorithm based on Segment Routing in Software-Defined Networks
by: Chen, Yin Chen, et al.
Published: (2016) -
Scalable multicast tree construction for wide area networks
by: Klinker, James Eric.
Published: (2013) -
Building Steiner Tree with Extended Dijkstra's Algorithm for Software-Defined Networking Multicast
by: Szu-Yuan Chen, et al.
Published: (2015) -
A Two-Layered Shared Tree Multicast Routing Algorithm for Software Defined Hybrid Satellite-Terrestrial Communication Networks
by: Jiayan Xiong, et al.
Published: (2021-10-01)