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 language | English (US) |
|---|---|
| Title of host publication | Proceedings - 18th Conference on Local Computer Networks, LCN 1993 |
| Publisher | IEEE Computer Society |
| Pages | 327-336 |
| Number of pages | 10 |
| ISBN (Electronic) | 0818645105, 9780818645105 |
| DOIs | |
| State | Published - 1993 |
| Event | 18th Conference on Local Computer Networks, LCN 1993 - Minneapolis, United States Duration: Sep 19 1993 → Sep 22 1993 |
Publication series
| Name | Proceedings - Conference on Local Computer Networks, LCN |
|---|
Conference
| Conference | 18th Conference on Local Computer Networks, LCN 1993 |
|---|---|
| Country/Territory | United States |
| City | Minneapolis |
| Period | 9/19/93 → 9/22/93 |
Bibliographical note
Funding Information:*This work was partially supportedby a grant from Bellcore.
Publisher Copyright:
© 1993 IEEE.