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
Em redes de QoS, os algoritmos de roteamento para o tráfego de QoS devem fornecer o caminho de transmissão que satisfaça seus requisitos de QoS e, ao mesmo tempo, alcançar alta utilização dos recursos da rede. Portanto, algoritmos de roteamento QoS baseados em servidor seriam mais eficazes do que algoritmos de roteamento distribuído, que são muito comuns na Internet. Além disso, acreditamos que reencaminhamento A função aumenta a vantagem de seus algoritmos em que um fluxo já aceito com caminho estabelecido é substituído por algum outro caminho para aceitar a solicitação de transmissão recém-chegada, caso não possa ser aceita sem fazê-lo. Assim, neste artigo, iremos propor um algoritmo de reroteamento com roteamento QoS baseado em servidor e avaliar seu desempenho em termos da probabilidade de bloqueio por simulação computacional. Além disso, investigaremos o impacto da quantidade de tráfego de alta prioridade no desempenho em algumas topologias de rede. Através de alguns resultados de simulação, também discutimos algumas questões que surgem na melhoria da eficácia do reencaminhamento.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -