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
Pokok multicast ATM (AMT) ialah Mbone persidangan video/audio dan aplikasi multicasting lain dalam rangkaian ATM (Mod Pemindahan Asynchronous). Walau bagaimanapun, masalah sebenar seperti beralih sementara suis, menukar sambungan gentian optik dan/atau kegagalan ketara/tidak ketara rangkaian ATM akan menyebabkan banyak gangguan perkhidmatan. Oleh itu, kita mesti mempertimbangkan dengan teliti SQOS sistem (Survivable QOS) apabila kita membina sistem. Skim penyembuhan diri titik-ke-titik menggunakan mekanisme sandaran pra-rancangan konvensional dicadangkan untuk melindungi AMT daripada kegagalan. Skim ini menggunakan Laluan Akar-ke-Daun (RLR) sandaran yang telah dirancang awal-ke-titik sebagai struktur akar ke daun bagi AMT. Walaupun perlindungan AMT melalui RLR sandaran yang telah dirancang tidak memerlukan masa carian, laluan pendua boleh menyebabkan penggunaan lebar jalur yang berlebihan. Kertas ini juga mencadangkan kaedah nod terdekat, yang boleh mengesan struktur laluan panjang minimum semasa reka bentuk awal dan juga membina semula AMT sekiranya berlaku kegagalan rangkaian. Untuk mempertingkatkan kemandirian sistem, kami memperkenalkan dua algoritma penghalaan semula yang hampir optimum, algoritma carian yang paling baik dan juga algoritma carian tepat ramalan untuk mencari keperluan aliran hilang minimum. Skim hampir optimum ini menggunakan teknik carian untuk membimbing aliran hilang optimum tempatan ke arah aliran hilang yang paling baik. Cara ramalan adalah teknik yang sangat menjimatkan untuk mengurangkan kerumitan pengiraan fungsi aliran hilang. Untuk penilaian kebolehlaksanaan dan prestasi skim baharu, kami mensimulasikan pemulihan AMT dan hasil simulasi menunjukkan skema nod terdekat menyediakan pemulihan AMT yang unggul berbanding sistem dengan skim sandaran titik ke titik yang telah dirancang sebelumnya. Di samping itu, algoritma carian ramalan-layak adalah lebih pantas daripada carian yang paling baik.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -