Title :
An optimal dynamic multicast routing algorithm for multimedia applications
Author_Institution :
Dept. of Electron. Eng., Kangnung Nat. Univ., Kangnung, North Korea
Abstract :
A source-based optimal dynamic multicast routing algorithm is proposed, which satisfies the network conditions of delay constraints and cost minimization and adapts to a dynamic network events. Also, we look at the following network requirements: efficient dynamic group support, high-quality data distribution, and adaptability to dynamically changing events. We construct a dynamic delay-bounded optimal multicast tree using partial multicast routing and evaluate the performance of the proposed algorithm by running simulations, written in C++, with randomly-generated test networks on a Sun Sparc 20 workstation. By choosing appropriate values for the delay bound, we were able to obtain an optimal solution that lies between the minimum-cost solution and the minimum-delay one.
Keywords :
delays; digital simulation; minimisation; multimedia communication; software performance evaluation; telecommunication computing; telecommunication network routing; trees (mathematics); Sun Sparc 20 workstation; adaptability; cost minimization; delay constraints; dynamic delay-bounded optimal multicast tree; dynamic group support; dynamic network events; dynamically changing events; high-quality data distribution; minimum-cost solution; minimum-delay solution; multimedia applications; network conditions; network requirements; partial multicast routing; performance evaluation; randomly-generated test networks; simulations; source-based optimal dynamic multicast routing algorithm; Cost function; Delay; Equations; Heuristic algorithms; Multicast algorithms; Multicast protocols; Proposals; Routing protocols; Transport protocols; Web and internet services;
Conference_Titel :
Multimedia Computing and Systems '97. Proceedings., IEEE International Conference on
Conference_Location :
Ottawa, Ont., Canada
Print_ISBN :
0-8186-5530-5
DOI :
10.1109/MMCS.1997.609573