A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees

With the proliferationof multimediagroup applications, the construction of multicast trees satisfying Qualityof ServiceQoS requirementsis becominga problemof prime importance. Many of the multicast applications such as video broadcasts and teleconferencing require the network to support dynamic multicast sessions wherein the membership of the multicast group changes with time. In this paper, we propose and evaluate an algorithm called CRCDM Controlled Rearrangement for Constrained Dynamic Multicasting for on-line update of multicast trees to adjust to changes in group membership. The CRCDM algorithm is based on a concept called Quality Factor QF that represents the usefulness of a portion of the multicast tree to the overall multicast session. When the usefulness of a particular region of the tree drops below a threshold, a rearrangement technique is used to suitably modify the tree. Our algorithm aims to satisfy the delay-constraints of all current group members, at the same time min...

• Type: Conference
• Year: 1999
• Where: INFOCOM
• Authors: R. Sriram, G. Manimaran, C. Siva Ram Murthy
• Keywords: Algorithm, Communications, INFOCOM 1999, Multicast, Multicast Tree