Optimal packing of group multicastings

Document Type

Conference Proceeding

Publication Date

1-1-1998

Abstract

This study attempts to investigate how to optimize network resources for multiple, many-to-many multicastings that share and compete for network resources. Presented are algorithms, heuristics and lower bounds addressing optimization issues in many-to-many multicasting. The heuristics and exact algorithms are implemented on various networks and multicast groups. The simulations show that multicast trees can be built by using 25% fewer links than the rings, both for optimal and suboptimal constructions. The packing heuristic is also implemented and its performance is compared to the constructive lower bound.

Identifier

0031648317 (Scopus)

Publication Title

Proceedings IEEE INFOCOM

ISSN

0743166X

First Page

980

Last Page

987

Volume

3

This document is currently not available here.

Share

COinS