Abstract
In multimedia communication networks, the problem of multicasting assumes a new dimension. Apart from minimizing the cost of multicast communication, it is also necessary to ensure that each of the destination nodes receives the message within a bounded delay. Such delay-bounded multicast applications typically arise in multimedia conferencing. In this paper, we present a genetic algorithm for solving the delay-bounded multicast problem. We assume source-based routing, i.e. each source node completely determines the Steiner tree along which multicasting is performed. The genetic algorithm is a powerful optimization tool, and our experimental results reveal that a genetic algorithm provides fast and superior quality solutions to the delay-bounded multicast problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
