Design of a multicast routing algorithm

Author

Fujii, Altihiro ; Yamagata, Takayulti ; Nemoto, Y.

Author_Institution

Dept. of Inf. Technol., Miyagi Univ., Japan

fYear

1998

fDate

16-18 Feb 1998

Firstpage

442

Lastpage

447

Abstract

Multicast communication can support wide range of applications such as digital video distribution. In multicast communication, routing paths are established in terms of minimizing the total cost of the multicast tree or minimizing the distances of each connection from source to the destinations. In this paper, we are also concerned about the number of copies in one switching fabric and propose a new algorithm for multicast routing which: (1) it avoids concentration of copying at a specific exchange node and (2) it ensures the optimal path for longest connections among destinations. Time complexity and space complexity of the algorithm are discussed

Keywords

computational complexity; protocols; switching networks; telecommunication network routing; exchange node; multicast communication; multicast routing algorithm; multicast tree; optimal path; source-destination connection distance; space complexity; switching fabric; time complexity; Algorithm design and analysis; Communication switching; Costs; Data communication; Fabrics; Hardware; Information technology; Multicast algorithms; Routing; Space technology;

fLanguage

English

Publisher

ieee

Conference_Titel

Performance, Computing and Communications, 1998. IPCCC '98., IEEE International

Conference_Location

Tempe/Phoenix, AZ

ISSN

1097-2641

Print_ISBN

0-7803-4468-5

Type

conf

DOI

10.1109/PCCC.1998.660136

Filename

660136