For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Self-Healing on ATM Multicast Tree
Yih-Fuh WANG Rong-Feng CHANG
IEICE TRANSACTIONS on Communications
Publication Date: 1998/08/25
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Issue on Multimedia Communications in Heterogeneous Network Environments)
self-healing, ATM, multicast tree, restoration, OAM,
Full Text: PDF(731.8KB)
>>Buy this Article
In the future broadband networks, multicast services such as video conferencing and distance learning will become increasingly important. To support these multimedia services, one solution is to form an AMT(ATM Multicast Tree)to connect all the conferencing members. In this paper, based on AMT survivability requirements, we investigate the self-healing of an AMT. Self-healing on AMT is a new challenge of survivability of multimedia services. The pre-assign way is a method we usually considered on protection. If we construct a disjoint backup tree, the low building probability and complicated loading on constructing is the first problem. Second, if only one link or node failed on an AMT, we need to reroute links and reserve bandwidth on whole backup tree. Moreover, since the AMT usually transmits video images, the restoration rate will be decreased because even only one branch of backup tree does not endure the required bandwidth. These enhance us to restore the AMT by dynamic restoration scheme. Two proposed dynamic restoration schemes are developed to provide prioritized restoration from a link or node failure. In the first scheme, we apply a link-based restoration scheme on the AMT. The restoration is based on the failed links of network and does not take whole AMT into account. In the second scheme, without changing the multicast services to the members, we allow reconfiguration of the AMT during the restoration phase. Reconfiguration of the AMT is based on a tree-based restoration concept. By computer simulations, we verify the characteristics of the proposed schemes and the results show that the second scheme outperforms the first.