Skip to main content
Kent Academic Repository

An Heuristic for Lower Cost Multicast Routing in the Internet.

Crawford, John and Waters, A. Gill (1996) An Heuristic for Lower Cost Multicast Routing in the Internet. Technical report. UKC (KAR id:21370)


Some multicast applications require high bandwidth and bounded delay (eg Video-conferencing). The general problem of constructing bounded delay minimal cost multicast trees uses two link metrics (cost and delay) and is NP-complete. A number of heuristics have been developed, most of which tend to have a high order of time complexity. Our heuristics achieve good results with low time-complexity and we believe that they are adaptable to a number of other multicasting scenarios. Current Internet multicasting protocols use either link-state or distance vector routing to construct multicast trees that have minimum path delays. Tree cost is ignored. When our heuristics are applied using a single link metric, they achieve minimum delay path multicast trees of lower cost than those constructed using Dijkstra's shortest path algorithm. The cost savings achieved by one of our heuristics is such that it can be considered as a candidate for use in distributed muticast protocols, such as MOSPF, as an alternative to Dijkstra's algorithm.

Item Type: Reports and Papers (Technical report)
Additional information: This work was supported by EPSRC Grant GR/K55837 and presented at the IDMR of the 36th IETF, Montreal, Canada, June 1996.
Uncontrolled keywords: multicast routing MOSPF
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 03 Sep 2009 18:36 UTC
Last Modified: 16 Nov 2021 09:59 UTC
Resource URI: (The current URI for this page, for reference purposes)

University of Kent Author Information

Crawford, John.

Creator's ORCID:
CReDIT Contributor Roles:

Waters, A. Gill.

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.