Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic

TL;DR

This paper introduces the DCADH algorithm, which constructs low-cost multicast routing trees with delay constraints by combining average distance heuristic and shortest delay paths, improving real-time multimedia communication.

Contribution

The paper proposes a novel delay-constrained multicast routing algorithm, DCADH, that effectively balances cost and delay constraints using heuristic and shortest path methods.

Findings

DCADH achieves low-cost multicast trees with delay constraints.

Simulation results demonstrate DCADH's superior performance in delay and cost.

The algorithm effectively integrates heuristic and shortest path strategies.

Abstract

Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different location. With the development of Internet, Multicast is widely applied in all kinds of multimedia real-time application: distributed multimedia systems, collaborative computing, video-conferencing, distance education, etc. In order to construct a delay-constrained multicast routing tree, average distance heuristic (ADH) algorithm is analyzed firstly. Then a delay-constrained algorithm called DCADH (delay-constrained average distance heuristic) is presented. By using ADH a least cost multicast routing tree can be constructed; if the path delay can't meet the delay upper bound, a shortest delay path which is computed by Dijkstra algorithm will be merged into the existing multicast routing tree to meet the delay upper bound. Simulation experiments show that DCADH has a good performance in achieving a low-cost multicast routing tree.