A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees
IEEE/ACM Transactions on Networking (TON)
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
IEEE/ACM Transactions on Networking (TON)
Multicast in large WDM networks
Progress in computer research
Survey of multicast routing algorithms and protocols
ICCC '02 Proceedings of the 15th international conference on Computer communication
Multicasting and Broadcasting in Large WDM Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
An efficient QoS routing algorithm for quorumcast communication
Computer Networks: The International Journal of Computer and Telecommunications Networking
RoamHBA: maintaining group connectivity in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
On-line multicast routing with QoS constraints in WDM networks with no wavelength converters
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proactive rearrangement in delay constrained dynamic membership multicast
Computer Communications
A method for least-cost QoS multicast routing based on genetic simulated annealing algorithm
Computer Communications
Enabling multi-party 3D tele-immersive environments with ViewCast
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Online multicasting in WDM networks with shared light splitter bank
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Efficient heuristic for minimum cost trees construction in multi-groups multicast
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Enabling multiparty 3D tele-immersive environments with ViewCast
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Source-Based minimum cost multicasting: intermediate-node selection with potentially low cost
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Distributed multicast tree generation with dynamic group membership
Computer Communications
Exploiting the temporal dimension in QoS-aware multicast routing
Computer Communications
Algorithms for delay-constrained low-cost multicast tree construction
Computer Communications
A case for tree migration and integrated tree maintenance in QoS multicasting
Computer Communications
An efficient and easily deployable QoS-based routing scheme for online Internet multicasting
Computer Communications
| Hi-index | 0.07 |
Many future applications of computer networks such as distance education, remote collaboration, and teleconferencing will rely on the ability of the network to provide multicast services. We propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accumulated damage to the multicast tree within local regions or the tree as nodes are added and deleted and triggering a rearrangement when the number of changes within a connected subtree crosses a set threshold. We derive an analytical upper bound on the competitiveness of the algorithm. We also present simulation results to compare the average-case performance of the algorithm with two other known algorithms for the dynamic multicast problem, GREEDY, and edge-bounded algorithm (EBA). Our results show that ARIES provides the best balance among competitiveness, computational effort, and changes in the multicast tree after each update