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

Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem

โœ Scribed by Zhang Kun; Qi Yong; Zhang Hong

Book ID
108197503
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
548 KB
Volume
19
Category
Article
ISSN
0950-7051

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A fast and efficient heuristic algorithm
A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem
โœ Pi-Rong Sheu; Shan-Tai Chen ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 468 KB

More and more multicast communications are becoming real-time. In real-time communications, messages must be transmitted to their destination nodes within a certain amount of time; otherwise the messages will be rendered futile. To support real-time multicast communications, computer networks have t

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