A Dynamic Application-Oriented Multicast Routing for Virtual-Path Based ATM Networks

Byung Han RYU; Masayuki MURATA; Hideo MIYAHARA

A Dynamic Application-Oriented Multicast Routing for Virtual-Path Based ATM Networks

Byung Han RYU, Masayuki MURATA, Hideo MIYAHARA

Full Text Views

0

Cite this

Summary :

In this paper, we propose a new multicast routing algorithm for constructing the delay-constrained minimal spanning tree in the VP-based ATM networks, in which we consider the efficiency even in the case where the destination dynamically joins/departs the multicast connection. For constructing the delay-constrained spanning tree, we first generate a reduced network consisting of only VCX nodes from a given ATM network, originally consisting of VPX/VCX nodes. Then, we obtain the delay-constrained spanning tree with a minimal tree cost on the reduced network by using our proposed heuristic algorithm. Through numerical examples, we show that our dynamic multicast routing algorithm can provide an efficient usage of network resources when the membership nodes frequently changes during the lifetime of a multicast connection, while the existing multicast routing algorithm may be useful for constructing the multicast tree with a static nature of destination nodes. We also demonstrate that more cost-saving can be expected in dense networks when applying our proposed algorithm.

Publication: IEICE TRANSACTIONS on Communications Vol.E80-B No.11 pp.1654-1663

Publication Date: 1997/11/25

Publicized

Online ISSN

DOI

Type of Manuscript

Category: Communication Networks and Services

Cite this

Copy

Byung Han RYU, Masayuki MURATA, Hideo MIYAHARA, "A Dynamic Application-Oriented Multicast Routing for Virtual-Path Based ATM Networks" in IEICE TRANSACTIONS on Communications, vol. E80-B, no. 11, pp. 1654-1663, November 1997, doi: .
Abstract: In this paper, we propose a new multicast routing algorithm for constructing the delay-constrained minimal spanning tree in the VP-based ATM networks, in which we consider the efficiency even in the case where the destination dynamically joins/departs the multicast connection. For constructing the delay-constrained spanning tree, we first generate a reduced network consisting of only VCX nodes from a given ATM network, originally consisting of VPX/VCX nodes. Then, we obtain the delay-constrained spanning tree with a minimal tree cost on the reduced network by using our proposed heuristic algorithm. Through numerical examples, we show that our dynamic multicast routing algorithm can provide an efficient usage of network resources when the membership nodes frequently changes during the lifetime of a multicast connection, while the existing multicast routing algorithm may be useful for constructing the multicast tree with a static nature of destination nodes. We also demonstrate that more cost-saving can be expected in dense networks when applying our proposed algorithm.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e80-b_11_1654/_p

Copy

@ARTICLE{e80-b_11_1654,
author={Byung Han RYU, Masayuki MURATA, Hideo MIYAHARA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Dynamic Application-Oriented Multicast Routing for Virtual-Path Based ATM Networks},
year={1997},
volume={E80-B},
number={11},
pages={1654-1663},
abstract={In this paper, we propose a new multicast routing algorithm for constructing the delay-constrained minimal spanning tree in the VP-based ATM networks, in which we consider the efficiency even in the case where the destination dynamically joins/departs the multicast connection. For constructing the delay-constrained spanning tree, we first generate a reduced network consisting of only VCX nodes from a given ATM network, originally consisting of VPX/VCX nodes. Then, we obtain the delay-constrained spanning tree with a minimal tree cost on the reduced network by using our proposed heuristic algorithm. Through numerical examples, we show that our dynamic multicast routing algorithm can provide an efficient usage of network resources when the membership nodes frequently changes during the lifetime of a multicast connection, while the existing multicast routing algorithm may be useful for constructing the multicast tree with a static nature of destination nodes. We also demonstrate that more cost-saving can be expected in dense networks when applying our proposed algorithm.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - A Dynamic Application-Oriented Multicast Routing for Virtual-Path Based ATM Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1654
EP - 1663
AU - Byung Han RYU
AU - Masayuki MURATA
AU - Hideo MIYAHARA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E80-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 1997
AB - In this paper, we propose a new multicast routing algorithm for constructing the delay-constrained minimal spanning tree in the VP-based ATM networks, in which we consider the efficiency even in the case where the destination dynamically joins/departs the multicast connection. For constructing the delay-constrained spanning tree, we first generate a reduced network consisting of only VCX nodes from a given ATM network, originally consisting of VPX/VCX nodes. Then, we obtain the delay-constrained spanning tree with a minimal tree cost on the reduced network by using our proposed heuristic algorithm. Through numerical examples, we show that our dynamic multicast routing algorithm can provide an efficient usage of network resources when the membership nodes frequently changes during the lifetime of a multicast connection, while the existing multicast routing algorithm may be useful for constructing the multicast tree with a static nature of destination nodes. We also demonstrate that more cost-saving can be expected in dense networks when applying our proposed algorithm.
ER -