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 árvore multicast ATM (AMT) é o Mbone de videoconferência/áudio e outras aplicações multicast em redes ATM (modo de transferência assíncrona). No entanto, problemas reais, como a mudança temporária de comutadores, a alteração das ligações de fibra óptica e/ou falhas tangíveis/intangíveis das redes ATM, causarão muitas interrupções de serviço. Portanto, devemos considerar cuidadosamente o SQOS (Survivable QOS) do sistema quando construímos o sistema. Um esquema de autocorreção ponto a ponto utilizando um mecanismo de backup convencional pré-planejado é proposto para proteger o AMT contra falhas. Este esquema usa rotas raiz a folha (RLR) de backup pré-planejadas ponto a ponto como a estrutura raiz a folha de um AMT. Embora a proteção AMT por meio de RLR de backup pré-planejado não exija tempo de pesquisa, caminhos duplicados podem causar consumo redundante de largura de banda. Este artigo também propõe um método de nó mais próximo, que pode localizar a estrutura de rota de comprimento mínimo durante o projeto inicial e também reconstruir o AMT no caso de falha da rede. Para aumentar a capacidade de sobrevivência do sistema, introduzimos dois algoritmos de redirecionamento quase ótimos, um algoritmo de busca mais decente e também um algoritmo de busca decente preditivo para encontrar o requisito mínimo de fluxo perdido. Esses esquemas quase ótimos usam técnicas de busca para guiar o fluxo perdido ideal local para a direção de fluxo perdido mais decente. A forma preditiva é uma técnica especialmente econômica para reduzir a complexidade do cálculo da função de fluxo perdida. Para avaliar a viabilidade e o desempenho dos novos esquemas, simulamos a restauração AMT e os resultados da simulação mostram que o esquema do nó mais próximo fornece uma restauração AMT superior em comparação com um sistema com um esquema de backup ponto a ponto pré-planejado. Além disso, o algoritmo de busca preditiva decente é mais rápido do que o algoritmo de busca mais decente.
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
Yih-Fuh WANG, Jen-Fa HUANG, "Preplanned Restoration and Optimal Capacity Placement on ATM Multicast Tree" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 2, pp. 281-292, February 2000, doi: .
Abstract: The ATM multicast Tree (AMT) is the Mbone of video/audio conferencing and other multicasting applications in ATM (Asynchronous Transfer Mode) networks. However, real problems such as temporarily moving switches, changing optic fiber connections and/or tangible/intangible failures of ATM networks will cause many service disruptions. Thus we must carefully consider the system's SQOS (Survivable QOS) when we construct the system. A point-to-point self-healing scheme utilizing a conventional pre-planned backup mechanism is proposed to protect the AMT from failure. This scheme uses point-to-point pre-planned backup Root-to-Leaf Routes (RLR) as the root-to-leaf structure of an AMT. Though AMT protection via preplanned backup RLR requires no search time, duplicate paths may cause redundant bandwidth consumption. This paper also proposes a closest-node method, which can locate the minimum-length route structure during the initial design and also rebuild the AMT in the event of a network failure. To enhance the survivability of the system, we introduce two near optimal re-routing algorithms, a most-decent search algorithm, and also a predictive-decent search algorithm in order to find the minimum lost flow requirement. These near optimal schemes use search technique to guide the local optimal lost flow to the most-decent lost flow direction. The predictive way is an especially economical technique to reduce the calculation complexity of lost flow function. For the evaluation of the feasibility and performance of the new schemes, we simulate AMT restoration and the simulation results show the closest-node scheme provides superior AMT restoration compared to a system with a preplanned point-to-point backup scheme. In addition, the predictive-decent search algorithm is faster than the most-decent search one.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_2_281/_p
Copiar
@ARTICLE{e83-b_2_281,
author={Yih-Fuh WANG, Jen-Fa HUANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Preplanned Restoration and Optimal Capacity Placement on ATM Multicast Tree},
year={2000},
volume={E83-B},
number={2},
pages={281-292},
abstract={The ATM multicast Tree (AMT) is the Mbone of video/audio conferencing and other multicasting applications in ATM (Asynchronous Transfer Mode) networks. However, real problems such as temporarily moving switches, changing optic fiber connections and/or tangible/intangible failures of ATM networks will cause many service disruptions. Thus we must carefully consider the system's SQOS (Survivable QOS) when we construct the system. A point-to-point self-healing scheme utilizing a conventional pre-planned backup mechanism is proposed to protect the AMT from failure. This scheme uses point-to-point pre-planned backup Root-to-Leaf Routes (RLR) as the root-to-leaf structure of an AMT. Though AMT protection via preplanned backup RLR requires no search time, duplicate paths may cause redundant bandwidth consumption. This paper also proposes a closest-node method, which can locate the minimum-length route structure during the initial design and also rebuild the AMT in the event of a network failure. To enhance the survivability of the system, we introduce two near optimal re-routing algorithms, a most-decent search algorithm, and also a predictive-decent search algorithm in order to find the minimum lost flow requirement. These near optimal schemes use search technique to guide the local optimal lost flow to the most-decent lost flow direction. The predictive way is an especially economical technique to reduce the calculation complexity of lost flow function. For the evaluation of the feasibility and performance of the new schemes, we simulate AMT restoration and the simulation results show the closest-node scheme provides superior AMT restoration compared to a system with a preplanned point-to-point backup scheme. In addition, the predictive-decent search algorithm is faster than the most-decent search one.},
keywords={},
doi={},
ISSN={},
month={February},}
Copiar
TY - JOUR
TI - Preplanned Restoration and Optimal Capacity Placement on ATM Multicast Tree
T2 - IEICE TRANSACTIONS on Communications
SP - 281
EP - 292
AU - Yih-Fuh WANG
AU - Jen-Fa HUANG
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2000
AB - The ATM multicast Tree (AMT) is the Mbone of video/audio conferencing and other multicasting applications in ATM (Asynchronous Transfer Mode) networks. However, real problems such as temporarily moving switches, changing optic fiber connections and/or tangible/intangible failures of ATM networks will cause many service disruptions. Thus we must carefully consider the system's SQOS (Survivable QOS) when we construct the system. A point-to-point self-healing scheme utilizing a conventional pre-planned backup mechanism is proposed to protect the AMT from failure. This scheme uses point-to-point pre-planned backup Root-to-Leaf Routes (RLR) as the root-to-leaf structure of an AMT. Though AMT protection via preplanned backup RLR requires no search time, duplicate paths may cause redundant bandwidth consumption. This paper also proposes a closest-node method, which can locate the minimum-length route structure during the initial design and also rebuild the AMT in the event of a network failure. To enhance the survivability of the system, we introduce two near optimal re-routing algorithms, a most-decent search algorithm, and also a predictive-decent search algorithm in order to find the minimum lost flow requirement. These near optimal schemes use search technique to guide the local optimal lost flow to the most-decent lost flow direction. The predictive way is an especially economical technique to reduce the calculation complexity of lost flow function. For the evaluation of the feasibility and performance of the new schemes, we simulate AMT restoration and the simulation results show the closest-node scheme provides superior AMT restoration compared to a system with a preplanned point-to-point backup scheme. In addition, the predictive-decent search algorithm is faster than the most-decent search one.
ER -