Research note
Delay constrained distributed multicast routing algorithm

https://doi.org/10.1016/S0140-3664(96)01169-3Get rights and content

Abstract

We propose a delay-constrained multicast algorithm that finds a multicast tree between one source node and multiple destination nodes in communication networks. The proposed algorithm, which provides multicasting and guaranteed QoS (Quality-of-Service) services at the network layer, is also designed to find a reduced-cost routing tree. We present a distributed algorithm by which the routing tree is computed through a single round of message exchange between network nodes, consequently reducing the number of messages and the accompanying computation time. The proposed algorithm is verified by simulation, and it is shown that it exhibits superior performance compared to existing algorithms.

References (10)

  • C. Topolcic

    Stream Protocol Version 2 — ST-II

    RFC 1190

    (October 1991)
  • L. Zhang et al.

    RSVP: a new resource ReSerVation Protocol

    IEEE Network

    (September 1993)
  • S. Deering

    Multicast routing in datagram internetworks and extended LANs

    ACM Transactions on Computer Systems

    (May 1990)
  • D. Waitzmann et al.

    Distance vector multicast routing protocol

    RFC 1075

    (November 1988)
  • A. Ballardie et al.

    Core Based Trees (CBT) — an architecture for scalable inter-domain multicast routing

There are more references available in the full text version of this article.

Cited by (0)

View full text