An efficient delay-constrained multicast routing algorithm

Baoxian Zhang; Yue Liu; Changjia Chen

doi:10.1109/icct.2000.890895

ScienceGate Book Chapters

JOURNAL ARTICLE

An efficient delay-constrained multicast routing algorithm

Baoxian Zhang Yue Liu Changjia Chen

Year: 2002 Vol: 2 Pages: 1244-1247

DOI: 10.1109/icct.2000.890895

Get Full-Text PDF Get Analytical Report

Abstract

We propose a simple multicast routing heuristic for delay-sensitive applications. The running complexity of it is O(m|V), where m is the number of group members and |V is the number of nodes in the network. Experimental results through simulations show that the DCMA achieves good performance.

Keywords:

Multicast Computer science Protocol Independent Multicast Distance Vector Multicast Routing Protocol Routing (electronic design automation) Xcast Computer network Heuristic Pragmatic General Multicast Source-specific multicast Simple (philosophy) Distributed computing Algorithm

Metrics

Cited By

0.23

FWCI (Field Weighted Citation Impact)

Refs

0.52

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Network Traffic and Congestion Control

Physical Sciences → Computer Science → Computer Networks and Communications

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

Mobile Ad Hoc Networks

Physical Sciences → Computer Science → Computer Networks and Communications

An efficient delay-constrained multicast routing algorithm

Abstract

Metrics

Topics

Related Documents

An efficient delay‐constrained multicast routing algorithm

Delay constrained distributed multicast routing algorithm

Distributed delay constrained multicast routing algorithm with efficient fault recovery

A new delay constrained multicast routing algorithm

A fast delay-constrained multicast routing algorithm