Dynamic multicast routing algorithm using predetermined path search

Takuya Asaka, Takumi Miyosh, Yoshiaki Tanaka

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

With conventional dynamic routing algorithms, many query messages are required in a distributed environment . for efficient multicast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared with conventional dynamic routing algorithms when nodes are added to or removed from the multicast group during steady-state simulation.

Original languageEnglish
Pages (from-to)1128-1134
Number of pages7
JournalIEICE Transactions on Communications
VolumeE83-B
Issue number5
Publication statusPublished - 2000
Externally publishedYes

Fingerprint

Dynamic routing algorithms

Keywords

  • Algorithm
  • Dynamic
  • Multicast
  • Routing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Dynamic multicast routing algorithm using predetermined path search. / Asaka, Takuya; Miyosh, Takumi; Tanaka, Yoshiaki.

In: IEICE Transactions on Communications, Vol. E83-B, No. 5, 2000, p. 1128-1134.

Research output: Contribution to journalArticle

Asaka, Takuya ; Miyosh, Takumi ; Tanaka, Yoshiaki. / Dynamic multicast routing algorithm using predetermined path search. In: IEICE Transactions on Communications. 2000 ; Vol. E83-B, No. 5. pp. 1128-1134.
@article{30c67d1981d34312a55b7458892c8b45,
title = "Dynamic multicast routing algorithm using predetermined path search",
abstract = "With conventional dynamic routing algorithms, many query messages are required in a distributed environment . for efficient multicast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared with conventional dynamic routing algorithms when nodes are added to or removed from the multicast group during steady-state simulation.",
keywords = "Algorithm, Dynamic, Multicast, Routing",
author = "Takuya Asaka and Takumi Miyosh and Yoshiaki Tanaka",
year = "2000",
language = "English",
volume = "E83-B",
pages = "1128--1134",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "5",

}

TY - JOUR

T1 - Dynamic multicast routing algorithm using predetermined path search

AU - Asaka, Takuya

AU - Miyosh, Takumi

AU - Tanaka, Yoshiaki

PY - 2000

Y1 - 2000

N2 - With conventional dynamic routing algorithms, many query messages are required in a distributed environment . for efficient multicast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared with conventional dynamic routing algorithms when nodes are added to or removed from the multicast group during steady-state simulation.

AB - With conventional dynamic routing algorithms, many query messages are required in a distributed environment . for efficient multicast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared with conventional dynamic routing algorithms when nodes are added to or removed from the multicast group during steady-state simulation.

KW - Algorithm

KW - Dynamic

KW - Multicast

KW - Routing

UR - http://www.scopus.com/inward/record.url?scp=0034187818&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034187818&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0034187818

VL - E83-B

SP - 1128

EP - 1134

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 5

ER -