This Blog Provide Topics, Abstracts, Documentations, Slides for various Seminars, Projects, Paper Presentations. After Reading Abstract You Can Download Corresponding Paper By Clicking The Link Given At The Bottom. On The Right Side Bar Select Your Branches CSE, ECE, EEE, IT, MCA, MBA, Civil, Mechanical Departments And More Stuff Will Be Added From Time To Time. So Please Be In Touch With This Blog For More And Apt Information.
|Speech Compression| |Data Security| |Artificial Neural Networks| |Moletronics| |AI Speech Recognition| |ATM| |Blue Eyes| |Brain Computer Interface| |Fuzzy Logic| |Mobile Voting| |Information Security Using Steganography| |Modern Irrigation Systems| |Asynchronous Chip| |Smartphone| |Gizmag|Subtractive Synthesis | Spread Spectrum | Speech Compression | Paper Batteries | Satellite Encryption | Robotics 1 2 | Silicon in Nanotechnology | Renewable Energy Systems | Reed Solomon Code | Vlsi Paper Presentation | Green Nanotechnology | Aerospace Nanotechnology | Nanotechnology | Brain Controlled Car 1 | Bubble Power | Brain Machine Interface | Beam Robotics Nervous Systems | Artificial Photosynthesis | Neural Networks | Adaptive Filtering | Finger Print Recognizer | Vlsi Chip | Digital Water Marking |
Dual-Link Failure Resiliency Through Backup Link Mutual Exclusion
Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several alternatives for protecting against the second failure. This paper formally classifies the approaches to dual-link failure resiliency. One of the strategies to recover from dual-link failures is to employ link protection for the two failed links independently, which requires that two links may not use each other in their backup paths if they may fail simultaneously. Such a requirement is referred to as Backup Link Mutual Exclusion (BLME) constraint and the problem of identifying a backup path for every link that satisfies the above requirement is referred to as the BLME problem. This paper develops the necessary theory to establish the sufficient conditions for existence of a solution to the BLME problem. Solution methodologies for the BLME problem is developed using two approaches by: (1) formulating the backup path selection as an integer linear program; and (2) developing a polynomial time heuristic based on minimum cost path routing. The ILP formulation and heuristic are applied to six networks and their performance is compared to approaches that assume precise knowledge of dual-link failure. It is observed that a solution exists for all the six networks considered. The heuristic approach is shown to obtain feasible solutions that are resilient to most dual-link failures, although the backup path lengths may be significantly higher than optimal. In addition, the paper illustrates the significance of the knowledge of failure location by illustrating that network with higher connectivity may require lesser capacity than one with a lower connectivity to recover from dual-link failures.
Hardware Interface
• Hard disk : 40 GB
• RAM : 512 MB
• Processor Speed : 2.20GHz
• Processor : Pentium IV Processor
Software Interface
• JDK 1.5
• Swing Builder