On Dynamic Multicast Routing Trees in Computer Networks
博士 === 國立清華大學 === 資訊工程學系 === 88 === Multicast routing trees can be classified into two categories, namely, the source-rooted trees and the shared trees. To reduce the cost of a multicast tree for a multicast group with one source node, usually a source-rooted multicast routing tree is established. F...
Main Authors: | Shou-Chuan Lai, 賴守全 |
---|---|
Other Authors: | Hwa-Chun Lin |
Format: | Others |
Language: | en_US |
Published: |
2000
|
Online Access: | http://ndltd.ncl.edu.tw/handle/53753396948944702290 |
Similar Items
-
A Fault-Tolerant Multicast Routing in Fat-Tree Networks
by: Yeh, Po-Ting, et al.
Published: (2011) -
A Multicast Tree Aggregation Algorithm in Wavelength-Routed WDM Networks
by: Chih-Chun Kuo, et al.
Published: (2003) -
DESIGN OF EFFICIENT MULTICAST ROUTING PROTOCOLS FOR COMPUTER NETWORKS
by: alyanbaawi, ashraf
Published: (2020) -
Multicast Routing in All Optical Sparse Splitting and Wavelength Conversion WDM Networks
by: Wang, Ho-Chuan, et al.
Published: (2010) -
Design and Evaluation of Effective Multicast Routing for Mesh on-Chip Networks
by: Yu-Wen Lai, et al.
Published: (2016)