Identifying Faulty Node and Alternative Path in a Network
Ramander Singh1, Vinod Kumar2, Ajay Kumar Singh3, Santosh Kumar Upadhyay4

1Ramander Singh Computer Science and Engineering, Mewar University, Rajasthan, India.
2Vinod Kumar Computer Science and Engineering, Mewar University, Rajasthan, India.
3Ajay Kumar Singh, Computer Science and Engineering, Meerut Institute of Engineering and Technology, Meerut, India.
4Santosh Kumar Upadhyay Computer Science and Engineering, Mewar University, Rajasthan, India
Manuscript received on September 01, 2012. | Revised Manuscript received on September 02, 2012. | Manuscript published on September 05, 2012. | PP: 52-55 | Volume-2 Issue-4, September 2012. | Retrieval Number: D0868072412/2012©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: This Paper describes a good algorithm to find the Faulty node in any given complex Network and provides the alternative path and also tells us the number of faulty node. As the Technological advances increasing number of node day by day in a Network. If a node fails, the system continues to operate with degraded performance until the faulty node is repaired. If the repair operation will take an unacceptable amount of time, it is useful to replace the faulty node with a spare node. However, the appropriate procedures must be followed and precautions must be taken so you do not interrupt I/O operations and compromise the integrity of your data that we have presented in our paper.
Keywords: Alternative path, Faulty node, Buffer, Computer