✦ LIBER ✦

Algorithms for delay constrained group multicast routing

✍ Scribed by Kun-Cheng Tsai; Chyouhwa Chen

Publisher: John Wiley and Sons
Year: 2005
Tongue: English
Weight: 1023 KB
Volume: 18
Category: Article
ISSN: 1074-5351
DOI: 10.1002/dac.736

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new delay-constrained algorithm for mu

A new delay-constrained algorithm for multicast routing tree construction

✍ Mohamed Aissa; Adel Ben Mnaouer 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

Two algorithms for multi-constrained opt

Two algorithms for multi-constrained optimal multicast routing

✍ Kun-Cheng Tsai; Chyouhwa Chen 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB

Distributed delay constrained multicast

Distributed delay constrained multicast routing algorithm with efficient fault recovery

✍ Hasan Ural; Keqin Zhu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

An effective algorithm for delay-constra

An effective algorithm for delay-constrained dynamic multicasting

✍ Zhengquan Xu; Lin Chen 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 447 KB

Delay-Constrained, Low-Cost Multicast Ro

Delay-Constrained, Low-Cost Multicast Routing in Multimedia Networks

✍ Tawfig Alrabiah; Taieb Znati 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Support for multimedia applications is a major objective of future high speed networks. Multimedia applications are usually resource intensive, have stringent quality of service (QoS) requirements, and in many cases involve large multicast groups. Multicasting enables these applications to scale to

Bandwidth-delay-constrained least-cost m

Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm

✍ Wang Zhengying; Shi Bingxin; Zhao Erdun 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 239 KB

We present an heuristic genetic algorithm for the quality of service (QoS) multicast routing that depends on: (1) bounded end-to-end delay and link bandwidth along the paths from the source to each destination, and (2) minimum cost of the multicast tree, where the link delay and the link cost are in