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

Approximation algorithms for multicast routing in

โœ Scribed by Deying Li; Qinghua Zhu


Book ID
106407299
Publisher
Springer US
Year
2009
Tongue
English
Weight
608 KB
Volume
21
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Algorithms for multicast connection unde
โœ 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

An improved multicast routing algorithm
โœ Ting-yao Jiang; Qing-hua Li ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Chinese Electronic Periodical Services ๐ŸŒ English โš– 384 KB