Traffic Distributing Algorithm for Multicast Routing in Packet Type Networks

Hideki TODE; Yasuharu SAKAI; Miki YAMAMOTO; Hiromi OKADA; Yoshikazu TEZUKA

Traffic Distributing Algorithm for Multicast Routing in Packet Type Networks

Hideki TODE, Yasuharu SAKAI, Miki YAMAMOTO, Hiromi OKADA, Yoshikazu TEZUKA

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E74-B No.12 pp.4051-4060

Publication Date: 1991/12/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Network Control)

Category

Authors

Hideki TODE
Yasuharu SAKAI
Miki YAMAMOTO
Hiromi OKADA
Yoshikazu TEZUKA

Keyword

Cite this

Copy

Hideki TODE, Yasuharu SAKAI, Miki YAMAMOTO, Hiromi OKADA, Yoshikazu TEZUKA, "Traffic Distributing Algorithm for Multicast Routing in Packet Type Networks" in IEICE TRANSACTIONS on Communications, vol. E74-B, no. 12, pp. 4051-4060, December 1991, doi: .
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e74-b_12_4051/_p

Copy

@ARTICLE{e74-b_12_4051,
author={Hideki TODE, Yasuharu SAKAI, Miki YAMAMOTO, Hiromi OKADA, Yoshikazu TEZUKA, },
journal={IEICE TRANSACTIONS on Communications},
title={Traffic Distributing Algorithm for Multicast Routing in Packet Type Networks},
year={1991},
volume={E74-B},
number={12},
pages={4051-4060},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - Traffic Distributing Algorithm for Multicast Routing in Packet Type Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 4051
EP - 4060
AU - Hideki TODE
AU - Yasuharu SAKAI
AU - Miki YAMAMOTO
AU - Hiromi OKADA
AU - Yoshikazu TEZUKA
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E74-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 1991
AB - 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.
ER -