Research: Source-based delay-bounded multicasting in multimedia networks

Authors:
C. P. Ravikumar;Rajneesh Bajpai
Affiliations:
Department of Electrical Engineering, Indian Institute of Technology, Delhi 110016, New Delhi, India;Department of Electrical Engineering, Indian Institute of Technology, Delhi 110016, New Delhi, India
Venue:
Computer Communications
Year:
1998

Citing 3
Cited 8

Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms for Scan Path Design

VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication

A Genetic Algorithm for Steiner Tree Optimization with Multiple Constraints Using Prüfer Number

EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Multicast routing with multiple constraints in high-speed networks based on genetic algorithms

ICCC '02 Proceedings of the 15th international conference on Computer communication
The Study on a New Immune Optimization Routing Model

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Artificial immune based hybrid GA for QoS based multicast routing in large scale networks (AISMR)

Computer Communications
A multi-objective evolutionary algorithm with Ɛ-dominance to calculate multicast routes with QoS requirements

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Adaptive shifting of auxiliary strategies over three formulations of multicast routing problem

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing

Computer Communications
Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

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.