首页 | 官方网站   微博 | 高级检索  
     


An improved scheme for self-healing in ATM networks
Affiliation:1. College of Science, Wuhan University of Technology, Wuhan 430070, China;2. School of mathematics and statistics, Pingdingshan University, Pingdingshan 467000, China;1. University Institute of Computing, Chandigarh University, Mohali, Punjab, India;2. Department of Computer Science & Engineering, G.B. Pant Govt. Engineering College, Okhla, New Delhi, India;3. Department of Computer Science & Engineering, Chandigarh Group of Colleges, Mohali, India;4. Department of Computer Science, School of Engineering Science & Technology, Jamia Hamdard, New Delhi, India;5. Department of ECE, Karunya Institute of Technology and Sciences, Coimbatore, India
Abstract:Broadband networks based on ATM technology can carry a large volume of data and can support diverse services like audio, video, and data uniformly. The reliability and availability levels provided by such networks should be very high. Self-healing is an elegant concept in this direction to provide highly reliable networks. A self-healing network can detect failures such as link/node failures and reroute the failed connections automatically using distributed control mechanisms. In this paper, we consider link and node failures including the VP terminating nodes unlike Kawamura and Tokizawa (Self-healing in ATM networks based on virtual path concept, IEEE Journal on Selected Areas in Communications 12 (1) (1994) 120–127). We present here an improved scheme for self-healing in ATM networks based on the concept of backup VPs. The problems we address are: (i) self-healing scheme; and (ii) backup VP routing. Two issues are addressed in the self-healing scheme: (i) backup VP activation protocol; and (ii) dynamic backup VP routing. We propose a new backup VP activation protocol which uses a VC packing strategy which allows the fast and prioritized restoration of critical VCs that were carried by failed VPs. We also propose a distributed dynamic backup VP routing algorithm which reduces the resource contention that may occur when multiple source–destination pairs contend for the routes simultaneously. The objective of the backup VP routing problem is to find a backup VP for each of the working VPs so that the cost of providing the backup is minimized. We propose a heuristic based solution for the backup VP routing problem using the concept of minimum cost shortest paths. We conducted simulation experiments to evaluate the performance of the proposed schemes. The results show that the proposed schemes are effective. Comparison of the results with those of the earlier schemes (R. Kawamura, I. Tokizawa, Self-healing in ATM networks based on virtual path concept, IEEE Journal on Selected Areas in Communications 12 (1) (1994) 120–127; C.J. Hou, Design of a fast restoration mechanism for virtual path-based ATM networks, Proceedings of IEEE INFOCOM’97, Kobe, Japan, April 1997) shows that the proposed schemes perform better.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号