A real-time multicast routing algorithm for multimedia applications

Authors:
Xiaohua Jia;Niki Pissinou;Kia Makki
Affiliations:
Department of Computer Science, City University of Hong Kong, Hong Kong, Hong Kong;Center for Advanced Computer Studies, The University of SW Louisiana, Louisiana, LA 70508, USA;Center for Telecommunications Studies, ECE Dept., The University of Southwestern Louisiana, Lafayette, LA 70508, USA
Venue:
Computer Communications
Year:
1997

Citing 7
Cited 7

Introduction to algorithms

Introduction to algorithms
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Multicast routing extensions for OSPF

Communications of the ACM
A Total Ordering Multicast Protocol Using Propagation Trees

IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A scheme for real-time channel establishment in wide-area networks

IEEE Journal on Selected Areas in Communications
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications

A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks

IEEE/ACM Transactions on Networking (TON)
A survey of combinatorial optimization problems in multicast routing

Computers and Operations Research
A distributed multicast routing algorithm for real-time applications in wide area networks

Journal of Parallel and Distributed Computing
QoS multicast routing for multimedia group communications using intelligent computational methods

Computer Communications
Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks

Engineering Applications of Artificial Intelligence
Interference and power constrained broadcast and multicast routing in wireless ad hoc networks using directional antennas

Computer Communications
Research: Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Multicast routing in real-time applications has two important requirements: minimal network cost and shortest network delay. It is very difficult to meet one requirement without compromising the other. This paper presents a real-time multicast routing algorithm which minimizes overall network cost without letting the delay from a source to any destination exceed a real-time constraint. The multicast routing with optimal overall network cost is an NP-complete problem. Our algorithm is based on the idea of the minimum spanning tree heuristic. Simulations have been done to compare the routing generated by our algorithm with those by other major algorithms.