Distributed multicasting algorithm with congestion control and message routing
Abstract This article proposes a new multicasting algorithm that allows for message transfer from the source to the multicasting destination by using routing in the source. The algorithm uses trunks and switches occupancy and considers congestion control and bandwidth management techniques. The routing algorithm uses a tree of trunks and switches from the source to the multicasting destination. The bounds on the trunks and switches occupancy are used to balance the occupancy of the trunks and switches. The bounds on the number of trunks and switches 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 switches. A number of different networks (LAN, FDDI, B-ISDN) are considered to evaluate performance of the multicasting algorithm.