An efficient communication scheme for multicasting on ATM networks
Tsang‐Ling Sheu, Wei-Dar Peng · 2002
A novel multicast communication scheme (MCS) on ATM networks is presented is this paper. While the core of the MCS is a constrained Bellman-Ford algorithm, an innovative design, referred to as a logical local central node, or LLCN, is embedded into the algorithm to effectively select a link path with the lowest cost from a source node to each multicast group member. An end-to-end delay bound is used to prevent any selected link path from exceeding this constraint. We evaluate the performance of the MCS by deriving a blocking probability as a function of multicast group members. From the blocking probability, we calculate the percentage of successful established sessions (PSES) on an ATM network. For the purpose of verification, a simulator is built. From the simulation, we have shown that the MCS can significantly reduce the connection setup time, the end-to-end delay variations, the total link cost consumed, and the average number of nodes required for multicasting over an ATM network.