Virtual-Cost-Based Algorithm for Dynamic Multicast Routing in Satellite-Terrestrial Networks

Takuya Asaka, Takumi Miyoshi, Yoshiaki Tanaka

Research output: Contribution to journalArticle

Abstract

SUMMARY Satellite-terrestrial (ST) networks, in which many nodes are interconnected by both satellite and terrestrial networks, can efficiently support multicast services. This is because satellite broadcasting is suitable for a large multicast group and a terrestrial network is suitable for a small multicast group. An ST network requires a multicast routing algorithm that can select the appropriate satellite and terrestrial routes. Conventional dynamic routing algorithms for terrestrial networks cannot construct an efficient multicast routing tree because they basically select a less-expensive route when a node is added. We have developed a dynamic routing algorithm, a virtual-cost-based algorithm, for ST networks that selects the route to use according to the multicast group size when a node is added to the group. Simulation showed that the proposed algorithm is advantageous when nodes are added to or removed from the multicast group during steady-state simulation.

Original languageEnglish
Pages (from-to)680-688
Number of pages9
JournalIEICE Transactions on Communications
VolumeE83-B
Issue number3
Publication statusPublished - 2000
Externally publishedYes

Fingerprint

Satellites
Dynamic routing algorithms
Costs
Routing algorithms
Broadcasting

Keywords

  • Multicast
  • Network
  • Routing
  • Satellite
  • Terrestrial

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Virtual-Cost-Based Algorithm for Dynamic Multicast Routing in Satellite-Terrestrial Networks. / Asaka, Takuya; Miyoshi, Takumi; Tanaka, Yoshiaki.

In: IEICE Transactions on Communications, Vol. E83-B, No. 3, 2000, p. 680-688.

Research output: Contribution to journalArticle

@article{9f214452a90b46698d4985b511732e93,
title = "Virtual-Cost-Based Algorithm for Dynamic Multicast Routing in Satellite-Terrestrial Networks",
abstract = "SUMMARY Satellite-terrestrial (ST) networks, in which many nodes are interconnected by both satellite and terrestrial networks, can efficiently support multicast services. This is because satellite broadcasting is suitable for a large multicast group and a terrestrial network is suitable for a small multicast group. An ST network requires a multicast routing algorithm that can select the appropriate satellite and terrestrial routes. Conventional dynamic routing algorithms for terrestrial networks cannot construct an efficient multicast routing tree because they basically select a less-expensive route when a node is added. We have developed a dynamic routing algorithm, a virtual-cost-based algorithm, for ST networks that selects the route to use according to the multicast group size when a node is added to the group. Simulation showed that the proposed algorithm is advantageous when nodes are added to or removed from the multicast group during steady-state simulation.",
keywords = "Multicast, Network, Routing, Satellite, Terrestrial",
author = "Takuya Asaka and Takumi Miyoshi and Yoshiaki Tanaka",
year = "2000",
language = "English",
volume = "E83-B",
pages = "680--688",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "3",

}

TY - JOUR

T1 - Virtual-Cost-Based Algorithm for Dynamic Multicast Routing in Satellite-Terrestrial Networks

AU - Asaka, Takuya

AU - Miyoshi, Takumi

AU - Tanaka, Yoshiaki

PY - 2000

Y1 - 2000

N2 - SUMMARY Satellite-terrestrial (ST) networks, in which many nodes are interconnected by both satellite and terrestrial networks, can efficiently support multicast services. This is because satellite broadcasting is suitable for a large multicast group and a terrestrial network is suitable for a small multicast group. An ST network requires a multicast routing algorithm that can select the appropriate satellite and terrestrial routes. Conventional dynamic routing algorithms for terrestrial networks cannot construct an efficient multicast routing tree because they basically select a less-expensive route when a node is added. We have developed a dynamic routing algorithm, a virtual-cost-based algorithm, for ST networks that selects the route to use according to the multicast group size when a node is added to the group. Simulation showed that the proposed algorithm is advantageous when nodes are added to or removed from the multicast group during steady-state simulation.

AB - SUMMARY Satellite-terrestrial (ST) networks, in which many nodes are interconnected by both satellite and terrestrial networks, can efficiently support multicast services. This is because satellite broadcasting is suitable for a large multicast group and a terrestrial network is suitable for a small multicast group. An ST network requires a multicast routing algorithm that can select the appropriate satellite and terrestrial routes. Conventional dynamic routing algorithms for terrestrial networks cannot construct an efficient multicast routing tree because they basically select a less-expensive route when a node is added. We have developed a dynamic routing algorithm, a virtual-cost-based algorithm, for ST networks that selects the route to use according to the multicast group size when a node is added to the group. Simulation showed that the proposed algorithm is advantageous when nodes are added to or removed from the multicast group during steady-state simulation.

KW - Multicast

KW - Network

KW - Routing

KW - Satellite

KW - Terrestrial

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

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

M3 - Article

AN - SCOPUS:0034157094

VL - E83-B

SP - 680

EP - 688

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 3

ER -