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
QoS 네트워크에서 QoS 트래픽에 대한 라우팅 알고리즘은 네트워크 리소스의 높은 활용도를 달성하면서 QoS 요구 사항을 충족하는 전송 경로를 제공해야 합니다. 따라서 서버 기반 QoS 라우팅 알고리즘은 인터넷에서 매우 일반적인 분산 라우팅 알고리즘보다 더 효과적입니다. 게다가 우리는 경로 변경 기능은 새로 도착하는 전송 요청을 수락하지 않으면 수락할 수 없는 경우 새로 도착하는 전송 요청을 수락하기 위해 설정된 경로가 있는 이미 수락된 흐름을 다른 경로로 대체하는 알고리즘의 이점을 향상시킵니다. 이에 본 논문에서는 서버 기반 QoS 라우팅을 이용한 재라우팅 알고리즘을 제안하고, 컴퓨터 시뮬레이션을 통해 차단 확률 측면에서 성능을 평가하고자 한다. 또한 일부 네트워크 토폴로지에서 우선순위가 높은 트래픽 양이 성능에 미치는 영향을 조사합니다. 일부 시뮬레이션 결과를 통해 재라우팅의 효율성을 향상시키는 데 있어 발생하는 몇 가지 문제에 대해서도 논의합니다.
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.
부
Takeshi IKENAGA, Kenji KAWAHARA, Yuji OIE, "Effectiveness and Issues of Rerouting Algorithms for QoS Networks" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 6, pp. 1553-1560, June 2001, doi: .
Abstract: In QoS networks, routing algorithms for QoS traffic have to provide the transmission path satisfying its QoS requirement while achieving high utilization of network resources. Therefore, server-based QoS routing algorithms would be more effective than distributed routing ones which are very common on the Internet. Furthermore, we believe that rerouting function enhances the advantage of their algorithms in which an already accepted flow with established path is replaced on some other path in order to accept newly arriving transmission request if it can not be accepted without doing so. Thus in this paper, we will propose a rerouting algorithm with the server-based QoS routing and evaluate its performance in terms of the blocking probability by computer simulation. In addition, we will investigate the impact of the amount of traffic with high-priority on the performance in some network topologies. Through some simulation results, we also discuss some issues arising in improving the effectiveness of rerouting.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_6_1553/_p
부
@ARTICLE{e84-b_6_1553,
author={Takeshi IKENAGA, Kenji KAWAHARA, Yuji OIE, },
journal={IEICE TRANSACTIONS on Communications},
title={Effectiveness and Issues of Rerouting Algorithms for QoS Networks},
year={2001},
volume={E84-B},
number={6},
pages={1553-1560},
abstract={In QoS networks, routing algorithms for QoS traffic have to provide the transmission path satisfying its QoS requirement while achieving high utilization of network resources. Therefore, server-based QoS routing algorithms would be more effective than distributed routing ones which are very common on the Internet. Furthermore, we believe that rerouting function enhances the advantage of their algorithms in which an already accepted flow with established path is replaced on some other path in order to accept newly arriving transmission request if it can not be accepted without doing so. Thus in this paper, we will propose a rerouting algorithm with the server-based QoS routing and evaluate its performance in terms of the blocking probability by computer simulation. In addition, we will investigate the impact of the amount of traffic with high-priority on the performance in some network topologies. Through some simulation results, we also discuss some issues arising in improving the effectiveness of rerouting.},
keywords={},
doi={},
ISSN={},
month={June},}
부
TY - JOUR
TI - Effectiveness and Issues of Rerouting Algorithms for QoS Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1553
EP - 1560
AU - Takeshi IKENAGA
AU - Kenji KAWAHARA
AU - Yuji OIE
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2001
AB - In QoS networks, routing algorithms for QoS traffic have to provide the transmission path satisfying its QoS requirement while achieving high utilization of network resources. Therefore, server-based QoS routing algorithms would be more effective than distributed routing ones which are very common on the Internet. Furthermore, we believe that rerouting function enhances the advantage of their algorithms in which an already accepted flow with established path is replaced on some other path in order to accept newly arriving transmission request if it can not be accepted without doing so. Thus in this paper, we will propose a rerouting algorithm with the server-based QoS routing and evaluate its performance in terms of the blocking probability by computer simulation. In addition, we will investigate the impact of the amount of traffic with high-priority on the performance in some network topologies. Through some simulation results, we also discuss some issues arising in improving the effectiveness of rerouting.
ER -