๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Routing algorithm for multicast under multi-tree model in optical networks

โœ Scribed by Jun Gu; Xiao-Dong Hu; Xiaohua Jia; Mu-Hong Zhang

Book ID
108280915
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
209 KB
Volume
314
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithms for multicast connection unde
Algorithms for multicast connection under multi-path routing model
โœ Jun Gu; Xiao-Dong Hu; Mu-Hong Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 139 KB

Given a source node and a set of destination nodes in a network, multicast routing problem is usually treated as Steiner tree problem. Unlike this well-known tree based routing model, multicast routing under multi-path model is to find a set of paths rooted at the source node such that in each path

Integrated algorithms for delay bounded
Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks
โœ Xiao-Hua Jia; Ding-Zhu Du; Xiao-Dong Hu ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 204 KB

There are two steps to set-up a multicast connection in all optical wavelength division multiplexing (WDM) networks: routing and wavelength assignment. Multicast routing is to ยฎnd a tree in the network rooted from a source node and connecting all destination nodes. Wavelength assignment is to assign