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
O monitoramento ativo de rede baseado em tomografia de rede booleana é uma técnica promissora para localizar falhas de enlace instantaneamente em redes de transporte. Entretanto, o conjunto necessário de trilhas de monitoramento deve ser recalculado após a ocorrência de cada falha de link para tratar falhas de link sucessivas. Os métodos heurísticos existentes não conseguem computar as trilhas de monitoramento necessárias em um tempo suficientemente curto, quando as falhas de múltiplos links devem ser localizadas em todas as redes gerenciadas em larga escala. Este artigo propõe uma abordagem para calcular as trilhas de monitoramento necessárias dentro de um período esperado permitido especificado previamente. Uma análise baseada em caminhada aleatória estima o número de trilhas de monitoramento a serem computadas na abordagem proposta. O número estimado de trilhas de monitoramento é calculado por um método leve que garante apenas localização parcial dentro de áreas restritas. O método leve é executado repetidamente até que um conjunto bem-sucedido de trilhas de monitoramento, alcançando uma localização inequívoca em todas as redes gerenciadas, possa ser obtido. Este artigo demonstra que a abordagem proposta pode calcular um pequeno número de trilhas de monitoramento para localizar todas as falhas independentes de links duplos em redes gerenciadas compostas por milhares de links dentro de um determinado período curto esperado.
Nagao OGINO
KDDI Research Inc.
Takeshi KITAHARA
KDDI Research Inc.
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
Nagao OGINO, Takeshi KITAHARA, "Monitoring Trails Computation within Allowable Expected Period Specified for Transport Networks" in IEICE TRANSACTIONS on Communications,
vol. E105-B, no. 1, pp. 21-33, January 2022, doi: 10.1587/transcom.2021EBP3015.
Abstract: Active network monitoring based on Boolean network tomography is a promising technique to localize link failures instantly in transport networks. However, the required set of monitoring trails must be recomputed after each link failure has occurred to handle succeeding link failures. Existing heuristic methods cannot compute the required monitoring trails in a sufficiently short time when multiple-link failures must be localized in the whole of large-scale managed networks. This paper proposes an approach for computing the required monitoring trails within an allowable expected period specified beforehand. A random walk-based analysis estimates the number of monitoring trails to be computed in the proposed approach. The estimated number of monitoring trails are computed by a lightweight method that only guarantees partial localization within restricted areas. The lightweight method is repeatedly executed until a successful set of monitoring trails achieving unambiguous localization in the entire managed networks can be obtained. This paper demonstrates that the proposed approach can compute a small number of monitoring trails for localizing all independent dual-link failures in managed networks made up of thousands of links within a given expected short period.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2021EBP3015/_p
Copiar
@ARTICLE{e105-b_1_21,
author={Nagao OGINO, Takeshi KITAHARA, },
journal={IEICE TRANSACTIONS on Communications},
title={Monitoring Trails Computation within Allowable Expected Period Specified for Transport Networks},
year={2022},
volume={E105-B},
number={1},
pages={21-33},
abstract={Active network monitoring based on Boolean network tomography is a promising technique to localize link failures instantly in transport networks. However, the required set of monitoring trails must be recomputed after each link failure has occurred to handle succeeding link failures. Existing heuristic methods cannot compute the required monitoring trails in a sufficiently short time when multiple-link failures must be localized in the whole of large-scale managed networks. This paper proposes an approach for computing the required monitoring trails within an allowable expected period specified beforehand. A random walk-based analysis estimates the number of monitoring trails to be computed in the proposed approach. The estimated number of monitoring trails are computed by a lightweight method that only guarantees partial localization within restricted areas. The lightweight method is repeatedly executed until a successful set of monitoring trails achieving unambiguous localization in the entire managed networks can be obtained. This paper demonstrates that the proposed approach can compute a small number of monitoring trails for localizing all independent dual-link failures in managed networks made up of thousands of links within a given expected short period.},
keywords={},
doi={10.1587/transcom.2021EBP3015},
ISSN={1745-1345},
month={January},}
Copiar
TY - JOUR
TI - Monitoring Trails Computation within Allowable Expected Period Specified for Transport Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 21
EP - 33
AU - Nagao OGINO
AU - Takeshi KITAHARA
PY - 2022
DO - 10.1587/transcom.2021EBP3015
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E105-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2022
AB - Active network monitoring based on Boolean network tomography is a promising technique to localize link failures instantly in transport networks. However, the required set of monitoring trails must be recomputed after each link failure has occurred to handle succeeding link failures. Existing heuristic methods cannot compute the required monitoring trails in a sufficiently short time when multiple-link failures must be localized in the whole of large-scale managed networks. This paper proposes an approach for computing the required monitoring trails within an allowable expected period specified beforehand. A random walk-based analysis estimates the number of monitoring trails to be computed in the proposed approach. The estimated number of monitoring trails are computed by a lightweight method that only guarantees partial localization within restricted areas. The lightweight method is repeatedly executed until a successful set of monitoring trails achieving unambiguous localization in the entire managed networks can be obtained. This paper demonstrates that the proposed approach can compute a small number of monitoring trails for localizing all independent dual-link failures in managed networks made up of thousands of links within a given expected short period.
ER -