Traffic Distributing Algorithm for Multicast Routing in Packet Type Networks

Hideki TODE
Yasuharu SAKAI
Hiromi OKADA
Yoshikazu TEZUKA

IEICE TRANSACTIONS on Communications   Vol.E74-B    No.12    pp.4051-4060
Publication Date: 1991/12/25
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Issue on Network Control)

Full Text: PDF>>
Buy this Article

Multicast routing problem is one of the essential problems for supporting multicast and broadcast communication service which is the most important service of the multimedia information networks. Multicast routing is the problem of finding out an adequate path which connects one source node and more than one destination node, i.e. a tree shaped path. In packet type networks, a packet for multicast communication should go through the tree shaped path as making its copies at a branching node for efficient use of network resources. However, concentration of packet copy operations at a particular node leads to performance degradation of other calls which go through this node. In this paper we propose two multicast routing algorithms which distribute packet copy operations through whole nodes in the multicast path; a link added type algorithm and a loop constructed type algorithm. Both algorithms, at first, find out an approximate solution for minimum cost path, and avoid concentration of packet copy operation at a little sacrifice of total cost in the path. Computer simulation results show that these algorithms can decrease the burden of packet copy operation per a node at the sacrifice of increase in average distance (cost) of a source-destination pair but the sacrifice of total cost is very small.