Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
IEEE Transactions on Computers
Multicast routing in internetworks and extended LANs
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A multicast transport protocol
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks
IEEE Transactions on Computers
A Kernel for High-Performance Multicast Communications
IEEE Transactions on Computers
ACM Transactions on Computer Systems (TOCS)
Reverse path forwarding of broadcast packets
Communications of the ACM
| Hi-index | 0.00 |
This paper proposes a new multicasting algorithm that allows for message transfer from the source to the multicasting destination by using routing in the source. The routing algorithm uses a tree of trunks and nodes from the source to the multicasting destination. The bounds on the trunks and nodes occupancy are used to balance the occupancy of the trunks and nodes. The bounds on the number of trunks and nodes in the tree limit the number of paths considered by the algorithm. The message transfer time is calculated and the path with the shortest transfer time is chosen. The multicasting algorithm performance is analyzed by using the elapsed time of message transfer in the network and the waiting time to begin transfer in the nodes.