A load balancing multicast tree approach for group-based multimedia applications

Sanghyun Ahn, David H.C. Du

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

The authors formulate and propose an algorithm for the LBMT (load-balancing multicast tree) problem whose main objective is to accomplish traffic load balance while minimizing the number of multicast trees for a group. In order to fulfill these objectives, the multiple multicast tree concept, whose only disadvantage is the high tree maintenance cost, is introduced. Since the tree maintenance cost is proportional to the number of multicast trees for a multicast group, it is necessary to minimize the number of multicast trees. The authors' LBMT algorithm is based on the minimal Steiner tree approach by using the information on the available capacities of the links. For the algorithm, several link cost functions which take the available capacities on both directions into account are proposed.

Original languageEnglish (US)
Title of host publicationProceedings - 18th Conference on Local Computer Networks, LCN 1993
PublisherIEEE Computer Society
Pages327-336
Number of pages10
ISBN (Electronic)0818645105, 9780818645105
DOIs
StatePublished - Jan 1 1993
Event18th Conference on Local Computer Networks, LCN 1993 - Minneapolis, United States
Duration: Sep 19 1993Sep 22 1993

Publication series

NameProceedings - Conference on Local Computer Networks, LCN

Conference

Conference18th Conference on Local Computer Networks, LCN 1993
CountryUnited States
CityMinneapolis
Period9/19/939/22/93

Fingerprint Dive into the research topics of 'A load balancing multicast tree approach for group-based multimedia applications'. Together they form a unique fingerprint.

Cite this