Dynamic multicast trees

We present a family of protocols to build a multicast tree in a network of processes. No processing or storage overhead is required for processes not included in the tree. The overhead of processes in the tree consists solely of the periodic exchange of a pair of messages with their parent in the tree. To choose the processes that constitute the tree, we take advantage of the existing multicast routing tables. In addition, our protocol family distinguishes itself from other protocols in three ways. First, the protocols are proven correct. Second, the integrity of the multicast tree is preserved as the tree adapts to changes in the unicast routing table. Third the protocols are self-stabilizing, i.e., they tolerate all transient faults.