Low cost algorithms for message delivery in dynamic multicast groups

Author

Belkeir, Nasr E. ; Ahamad, Mustaque

Author_Institution

Sch. of Inf. & Comput. Sci., Georgia Inst. of Technol., Atlanta, GA, USA

fYear

1989

fDate

5-9 Jun 1989

Firstpage

110

Lastpage

117

Abstract

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

Keywords

computer networks; distributed processing; heuristic programming; message switching; trees (mathematics); Wall; bandwidth; broadcast tree based algorithm; control messages; data messages; dynamic environment; dynamic multicast groups; heuristic algorithms; incremental update; membership; message delivery; multicast spanning trees; network; new member; node; performance; simulation model; tree structure; Application software; Availability; Bandwidth; Broadcasting; Computer networks; Computer science; Costs; Multicast algorithms; Multicast communication; Tree data structures;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1989., 9th International Conference on

Conference_Location

Newport Beach, CA

Print_ISBN

0-8186-1953-8

Type

conf

DOI

10.1109/ICDCS.1989.37938

Filename

37938