Distributed algorithms for multicast path setup in data networks
IEEE/ACM Transactions on Networking (TON)
A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees
IEEE/ACM Transactions on Networking (TON)
CSIM: a C-based process-oriented simulation language
WSC '86 Proceedings of the 18th conference on Winter simulation
Distributed Routing for Dynamic Multicasting with Advance Resource Reservation Information
ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
Bessie: Portable Generation of Network Topologies for Simulation
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Research note: Delay constrained distributed multicast routing algorithm
Computer Communications
Improved fault recovery for core based trees
Computer Communications
A comparison of the Internet multicast routing protocols
Computer Communications
Multipoint communication: a survey of protocols, functions, and mechanisms
IEEE Journal on Selected Areas in Communications
ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Adaptive and intelligent path discovery on-demand for wireless networks using service composition
Expert Systems with Applications: An International Journal
Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks
Engineering Applications of Artificial Intelligence
Hi-index | 0.25 |
As group applications have become more prevalent, efficient network utilization becomes a growing concern. Multicast transmission may use network bandwidth more efficiently than multiple point-to-point messages, however, creating optimal multicast trees is prohibitively expensive. For this reason, heuristic methods are generally employed. These heuristics are often based on a Steiner tree approach, which is known to produce multicast trees that achieve an efficient use of network resources. Many such algorithms, both centralized and distributed, have been proposed to generate 'good' multicast trees. Even these heuristics typically have significant execution times, however, so changes to the initial group of multicast participants during generation of the tree is likely. Furthermore, periodic rebuilding of multicast trees or sub-trees has been proposed to improve the efficiency of these trees as the group membership evolves. Changes in group membership are also possible during this rebuilding process. Existing algorithms, however, either do not support changes to the multicast group during building of the tree or they impose unrealistic restrictions, such as no overlapping modifications or regeneration of the tree after every change. These restrictions prevent the use of such algorithms in many situations, e.g.; networks with mobile hosts. To remedy this, we propose an efficient distributed algorithm that supports dynamic changes to the multicast group during tree building and allows concurrent join/leave operations. In this paper, we present the algorithm, a proof of correctness, and detailed simulation results.