VTDM-a dynamic multicast routing algorithm

Author

Lin, Hwa-Chun ; Lai, Shou-Chuan

Author_Institution

Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan

Volume

3

fYear

1998

fDate

29 Mar-2 Apr 1998

Firstpage

1426

Abstract

In this paper, the dynamic multicast routing problem is studied. The multicast routing problem has been shown to be NP-complete. Many heuristics have been proposed to find the multicast trees for multicast connections. In computer networks, application services may allow nodes to join or leave the multicast connection dynamically. The multicast routing problem in which nodes are allowed to join or leave the multicast connection is called the dynamic multicast routing problem. A new dynamic multicast routing algorithm called virtual trunk dynamic multicast (VTDM) routing algorithm is proposed for this problem. A virtual trunk (VT) is a tree of the underlying graph. It is used as a template for constructing multicast trees. The VTDM routing algorithm constructs multicast trees based on the virtual trunk. Simulations are performed to study the performance of the VTDM routing algorithm. Simulation results show that the performance of the VTDM algorithm is close to that of the KMB algorithm (a near optimal heuristic for the static multicast routing problem)

Keywords

computer networks; telecommunication network routing; trees (mathematics); NP-complete problem; VTDM; VTDM routing algorithm; computer networks; dynamic multicast routing algorithm; heuristics; multicast connections; multicast trees; simulations; virtual trunk dynamic multicast routing algorithm; Application software; Computational modeling; Computer networks; Computer science; Cost function; Heuristic algorithms; Multicast algorithms; Packet switching; Routing; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE

Conference_Location

San Francisco, CA

ISSN

0743-166X

Print_ISBN

0-7803-4383-2

Type

conf

DOI

10.1109/INFCOM.1998.662960

Filename

662960