Low cost algorithms for message delivery in dynamic multicast groups

Heuristics for constructing low-cost multicast spanning trees in a dynamic environment are investigated. Two heuristic algorithms are developed that update the multicast tree incrementally as the membership changes and reduce the total bandwidth required for sending data and control messages. The broadcast tree based algorithm makes use of a tree structure in the network, and the other algorithm joins a new member to the node that is nearest to it and is already in the multicast tree. A simulation model is used to study the performance of the algorithms and to compare them with the best-known heuristic algorithm developed by D.W. Wall (1980) which computes the multicast tree structure for a given membership of the group.<<ETX>>

[1]  Willy Zwaenepoel,et al.  Distributed process groups in the V Kernel , 1985, TOCS.

[2]  Amr El Abbadi,et al.  Implementing Fault-Tolerant Distributed Objects , 1985, IEEE Transactions on Software Engineering.

[3]  D. W. Wall Mechanisms for broadcast and selective broadcast , 1980 .

[4]  Lorenzo Aguilar,et al.  Datagram routing for internet multicasting , 1984, Comput. Commun. Rev..

[5]  Larry D. Wittie,et al.  Communication Structures for Large Networks of Microcomputers , 1981, IEEE Transactions on Computers.

[6]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[7]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[8]  Arthur J. Bernstein,et al.  Multicast Communication in UNIX 4.2BSD , 1985, ICDCS.

[9]  RICHARD KOO,et al.  Checkpointing and Rollback-Recovery for Distributed Systems , 1986, IEEE Transactions on Software Engineering.

[10]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[11]  Ariel Joel Frank Distributed dynamic groups on network computers (data replication, dictionary, multicast, communication protocols, weak consistency) , 1985 .

[12]  Stephen E. Deering,et al.  Multicast routing in internetworks and extended LANs , 1988, SIGCOMM '88.

[13]  Robert Metcalfe,et al.  Reverse path forwarding of broadcast packets , 1978, CACM.

[14]  Mostafa H. Ammar,et al.  Using multicast communication to locate resources in LAN-based distributed system , 1988, Proceedings [1988] 13th Conference on Local Computer Networks.

[15]  Philip K. McKinley Multicast Routing in Spanning Bus Hypercubes , 1988, ICPP.