Abstract
Multicast communication services will be one of the most promising future applications in both public B-ISDN and the Internet. Generally, multicast communication can be realized by forwarding information along tree-shaped route. In order to realize rapid multicast routing, it is suitable and realistic to restrict the number of copy nodes in calculating multicast route. However, even in this approach we need to adequately select the restricted number of copy nodes which satisfy the conditions of both priority for multicasting and geographical distribution at the same time. As for this problem, we propose two heuristic algorithms, basic version named “concurrent type” and improved version named “sequential type”, by greatly developing the concept of “elastic network algorithm”. In addition to setting all important parameters through fundamental simulation testing, performance of this tuned-up new algorithms is evaluated.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call