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
A fim de tornar a rede ATM tolerante a falhas e o serviço de rede flexível, um método para a configuração de caminhos virtuais de backup (abreviadamente VP's) usando multiagentes é eficaz no que diz respeito à adaptabilidade à mudança de recursos de rede e requisitos do usuário, exemplos de que são falha de nós e links e adição de VP's, respectivamente. Neste método, supondo que sejam fornecidos candidatos a VPs de backup entre diferentes pares de nós de origem e de destino, os VPs de backup ótimos são obtidos pela troca de informações entre os agentes de forma autônoma. Primeiro, este artigo propõe medidas para determinar VPs de backup entre diferentes pares de nós de origem e de destino. A seguir, este artigo apresenta resultados de simulação para avaliar a adaptabilidade do método. Os resultados mostram que o método obtém eficientemente os VPs de backup ótimos mesmo quando o número de VPs de backup aumenta e que diferentes tempos ociosos em cada nó de destino permitem reduzir o tempo total de processamento, mantendo a detecção completa dos links compartilhados.
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
Shinji INOUE, Yoshiaki KAKUDA, "Multiagent-Based Reservation of Backup Virtual Paths in ATM Networks" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 6, pp. 1541-1552, June 2001, doi: .
Abstract: In order to make the ATM network fault-tolerant and the network service flexible, a method for the setting up of backup virtual paths (VP's for short) using multiagents is effective with respect to adaptability to change of network resource and user requirements, examples of which are failure of nodes and links and addition of VP's, respectively. In this method, under the assumption that candidates of backup VP's between different pairs of source and destination nodes are given, the optimum backup VP's are obtained by exchanging information among agents autonomously. First, this paper proposes measures for determining backup VP's between different pairs of source and destination nodes. Next, this paper presents simulation results to evaluate the adaptability of the method. The results show that the method efficiently obtains the optimum backup VP's even when the number of backup VP's increases and that different idle time at each destination node enables to shorten the total processing time while keeping complete detection of shared links.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_6_1541/_p
Copiar
@ARTICLE{e84-b_6_1541,
author={Shinji INOUE, Yoshiaki KAKUDA, },
journal={IEICE TRANSACTIONS on Communications},
title={Multiagent-Based Reservation of Backup Virtual Paths in ATM Networks},
year={2001},
volume={E84-B},
number={6},
pages={1541-1552},
abstract={In order to make the ATM network fault-tolerant and the network service flexible, a method for the setting up of backup virtual paths (VP's for short) using multiagents is effective with respect to adaptability to change of network resource and user requirements, examples of which are failure of nodes and links and addition of VP's, respectively. In this method, under the assumption that candidates of backup VP's between different pairs of source and destination nodes are given, the optimum backup VP's are obtained by exchanging information among agents autonomously. First, this paper proposes measures for determining backup VP's between different pairs of source and destination nodes. Next, this paper presents simulation results to evaluate the adaptability of the method. The results show that the method efficiently obtains the optimum backup VP's even when the number of backup VP's increases and that different idle time at each destination node enables to shorten the total processing time while keeping complete detection of shared links.},
keywords={},
doi={},
ISSN={},
month={June},}
Copiar
TY - JOUR
TI - Multiagent-Based Reservation of Backup Virtual Paths in ATM Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1541
EP - 1552
AU - Shinji INOUE
AU - Yoshiaki KAKUDA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2001
AB - In order to make the ATM network fault-tolerant and the network service flexible, a method for the setting up of backup virtual paths (VP's for short) using multiagents is effective with respect to adaptability to change of network resource and user requirements, examples of which are failure of nodes and links and addition of VP's, respectively. In this method, under the assumption that candidates of backup VP's between different pairs of source and destination nodes are given, the optimum backup VP's are obtained by exchanging information among agents autonomously. First, this paper proposes measures for determining backup VP's between different pairs of source and destination nodes. Next, this paper presents simulation results to evaluate the adaptability of the method. The results show that the method efficiently obtains the optimum backup VP's even when the number of backup VP's increases and that different idle time at each destination node enables to shorten the total processing time while keeping complete detection of shared links.
ER -