Loading...
Dynamic multicast routing in advance resource reservation environment
Author(s)
Date Issued
January 1, 2000
Type
Conference Paper
Abstract
Since usually the network resource is limited, the abilities to do resource reservation in advance, as well as efficient dynamic multicasting when destination nodes can join and leave the group during the communication period, are essential in all distributed multi-party applications. Total or partial re-routing of multicast tree for dynamic multicast groups can optimize the tree cost to some extent but they are complex. Furthermore, optimal multicast routing has been proved to be an NP-complete problem. In this paper, we propose an efficient dynamic multicast routing algorithm, which optimize the total cost of the Steiner tree over the whole session period in advance resource reservation environment, where information about the resource reservation (i.e. leaving times of participants at the time of joining) are available. The efficiency of our algorithm over other existing algorithms is shown by various simulation results.
Citation
Proceedings 7th International Conference on Parallel and Distributed Systems Workshops, 547-552, 2000