✦ LIBER ✦

Distributed multicast routing for delay and delay variation-bounded Steiner tree using simulated annealing

✍ Scribed by Zhang Kun; Wang Heng; Liu Feng-Yu

Book ID: 108100519
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 537 KB
Volume: 28
Category: Article
ISSN: 0140-3664
DOI: 10.1016/j.comcom.2004.12.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic multicast routing algorithm for

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

✍ Zhang Kun; Qi Yong; Zhang Hong 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 548 KB

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

Solve the Tree Setup Problem and Minimiz

Solve the Tree Setup Problem and Minimize Control Overhead for High-Density Members in Delay-Bounded Distributed Multicast Networks

✍ Ying-Hsin Liang, Ben-Jye Chang, Yan-Min Lin 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 669 KB