Restricted dynamic Steiner trees for scalable multicast in datagram networks
IEEE/ACM Transactions on Networking (TON)
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)
A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups
Electronic Commerce Research
New Distributed Multicast Routing and Its Performance Evaluation
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
A Performance Evaluation of Connectionless Overlay Networks for ATM
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
AMRST: adaptive multicast routing protocol for satellite-terrestrial networks
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
On-line multicast routing with QoS constraints in WDM networks with no wavelength converters
Computer Networks: The International Journal of Computer and Telecommunications Networking
An optimal VP-based multicast routing in ATM networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
A dynamic distributed algorithm for multicast path setup
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
An efficient and easily deployable QoS-based routing scheme for online Internet multicasting
Computer Communications
| Hi-index | 0.00 |
This paper compares three dynamic multipoint routing algorithms for wide-area packet switched networks like asynchronous transfer mode (ATM) networks. The three algorithms compared are the greedy algorithm, the source rooted shortest path (SP) algorithm and the geographic spread dynamic multicast (GSDM) routing algorithm. We present simulation results over random graphs that demonstrate the performance of these algorithms. The algorithms are evaluated via a series of multiple simulations in terms of the number of packet copies per node and their (in)efficiency. A near optimal Steiner tree heuristic algorithm called the KMB algorithm is used as a measure of the (in)efficiency of the algorithms.