The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
ATM 네트워크에서 멀티캐스트 경로를 설정하는 효율적인 방식은 여러 개의 중간 복사 노드를 통해 트리 모양의 경로를 구성하는 것입니다. 이 방식에는 멀티캐스트 라우팅 제어가 필요합니다. 따라서 복사 노드 수를 제한하는 것이 이 제어를 빠르고 간단하게 만들기 때문에 제안되었습니다. 그러나 네트워크 설계에서 제한된 수의 복사 노드를 고정하면 멀티캐스트 트래픽이 복사 노드 주위에 집중되어 결과적으로 혼잡이 발생할 가능성이 높아집니다. 우리의 연구에서는 라우팅 시 트리 모양의 경로를 분기하는 중간 노드로 제한된 수의 노드를 허용하고 이 권한을 "복사 토큰"이라고 명명합니다. 즉, "복사 토큰"을 갖는 노드를 복사 노드로 정의합니다. . 우리의 연구 목적은 낮은 제공 부하 등 멀티캐스팅 우선순위와 지리적 분포 조건을 동시에 만족하는 노드에 "복사 토큰"을 적응적으로 할당하여 멀티캐스트 트래픽을 분산시키는 것입니다. 마지막으로 컴퓨터 시뮬레이션을 통해 제안된 라우팅 기법의 차단 확률 성능을 평가합니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Hideki TODE, Hiroki YAMAUCHI, Hiromasa IKEDA, "Copy-Token Allocation Control for Adaptive Multicast Routing and Its Performance" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 4, pp. 803-811, April 2000, doi: .
Abstract: An efficient scheme for establishing the multicast-path on ATM network is to configure the tree-shaped path via several intermediate copy nodes. This scheme needs the multicast routing control. Thus, restricting the number of copy nodes was proposed since it make this control fast and simple. However, if restricted number of copy nodes is fixed in the network design, multicast traffic will concentrate around copy nodes, and as a result, the possibility of occurring congestion will be higher. In our research, we permit restricted number of nodes as intermediate nodes which branch the tree-shaped path at routing, and name this permission "copy-token. " Namely, the node which has "copy-token" is defined as the copy node. Our research purpose is to distribute the multicast traffic by adaptively allocating "copy-token" to nodes which satisfy the conditions of both the priority for multicasting such as lower offered load and the geographical distribution at the same time. Finally, we evaluate the performance of our proposed routing scheme on the blocking probability through computer simulations.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_4_803/_p
부
@ARTICLE{e83-b_4_803,
author={Hideki TODE, Hiroki YAMAUCHI, Hiromasa IKEDA, },
journal={IEICE TRANSACTIONS on Communications},
title={Copy-Token Allocation Control for Adaptive Multicast Routing and Its Performance},
year={2000},
volume={E83-B},
number={4},
pages={803-811},
abstract={An efficient scheme for establishing the multicast-path on ATM network is to configure the tree-shaped path via several intermediate copy nodes. This scheme needs the multicast routing control. Thus, restricting the number of copy nodes was proposed since it make this control fast and simple. However, if restricted number of copy nodes is fixed in the network design, multicast traffic will concentrate around copy nodes, and as a result, the possibility of occurring congestion will be higher. In our research, we permit restricted number of nodes as intermediate nodes which branch the tree-shaped path at routing, and name this permission "copy-token. " Namely, the node which has "copy-token" is defined as the copy node. Our research purpose is to distribute the multicast traffic by adaptively allocating "copy-token" to nodes which satisfy the conditions of both the priority for multicasting such as lower offered load and the geographical distribution at the same time. Finally, we evaluate the performance of our proposed routing scheme on the blocking probability through computer simulations.},
keywords={},
doi={},
ISSN={},
month={April},}
부
TY - JOUR
TI - Copy-Token Allocation Control for Adaptive Multicast Routing and Its Performance
T2 - IEICE TRANSACTIONS on Communications
SP - 803
EP - 811
AU - Hideki TODE
AU - Hiroki YAMAUCHI
AU - Hiromasa IKEDA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2000
AB - An efficient scheme for establishing the multicast-path on ATM network is to configure the tree-shaped path via several intermediate copy nodes. This scheme needs the multicast routing control. Thus, restricting the number of copy nodes was proposed since it make this control fast and simple. However, if restricted number of copy nodes is fixed in the network design, multicast traffic will concentrate around copy nodes, and as a result, the possibility of occurring congestion will be higher. In our research, we permit restricted number of nodes as intermediate nodes which branch the tree-shaped path at routing, and name this permission "copy-token. " Namely, the node which has "copy-token" is defined as the copy node. Our research purpose is to distribute the multicast traffic by adaptively allocating "copy-token" to nodes which satisfy the conditions of both the priority for multicasting such as lower offered load and the geographical distribution at the same time. Finally, we evaluate the performance of our proposed routing scheme on the blocking probability through computer simulations.
ER -