Detection of Node Failure Localization in Communication Networks


  • Nidhi Shekhawat
  • Shanil Panchamia
  • Ushasukhanya S





Routing Protocol, failure localization, network topology, monitor


We explore the capability of localizing node failures in communication networks from binary states (normal/failed) of end-to-end paths. Certain a set of nodes of importance, individually localizing failures inside this set necessitates that dissimilar noticeable path states connect with dissimilar node malfunction events. However, this circumstance is easier said than done to test on huge networks due to the requirement to itemise all promising node failures. Our first donation is a set of satisfactory/compulsory conditions for classifying a restricted numeral of failures within an uninformed node set that can be experienced in polynomial time. In adding up to network topology and positions of monitors, our circumstances also include restrictions forced by the penetrating mechanism used. We are here considering three probing mechanisms basically which differ according as to whether dimension paths are: (i) arbitrarily controllable; (ii) controllable but cycle-free; or (iii) uncontrollable (which are dogged by the evasion routing protocol). Our second donation is to calculate the potential of malfunction localization from beginning to end: 1) the utmost number of failures (wherever in the network) such that malfunctions inside a given node set can be exceptionally localized and 2) the major node set inside which failures can be exclusively localized underneath a given vault on the total amount of failures. Here both the methods in 1) and 2) can be transformed into the functions of a per-node property, which can be computed resourcefully based on the above satisfactory/compulsory conditions. We reveal how process 1) and 2) projected for enumerating malfunction localization capability can be used to calculate the collision of various parameters which includes topology, number of monitors, and probing mechanisms.




[1] Ramana Rao Kompella, Jennifer Yates, Albert Greenberg, and Alex C. Snoeren “Detection and Localization of Network Black Holes†DOI: 10.1109/INFCOM.2007.252, ISBN: 1-4244-1047-9, 2007

[2] Mahdi Cheraghchi, Amin Karbasi, Soheil Mohajer and Venkatesh Saligrama,“Graph-Constrained Group Testing†DOI: 10.1109/TIT. 2011.2169535, 2012

[3] Mark Coates, Alfred Hero, Robert Nowak, Bin Yu, “Internet Tomographyâ€DOI: 10.1109/79.998081, ISSN: 1053-5888, 2002

[4] Yiyi Huang, Nick Feamster and Renata Teixeira, “Practical Issues with Using Network Tomography for Fault Diagnosis†DOI:, 2008

[5] Sajjad Zarifzadeh, Madhwaraj G K and Constantine Dovrolis, “Range Tomographyâ€DOI:10.1145/2398776.2398817,2008

[6] Denisa Ghita, Katerina Argyraki, Patrick Thiran, “Network Tomography on Correlated Links†Melbourne, Australia- November 01, 2010 ACM New York, NY, USA ©2010
table of contents DOI:10.1145/1879141.1879170, ISBN: 978-1-4503-0483-2

[7] Hongyi Zeng, Peyman Kazemian, George Varghese and Nick McKeown , “Automatic Test Packet Generation â€DOI: 10.1109/ TNET.2013.2253121, ISSN: 1063-6692Electronic ISSN: 1558-2566

[8] Nick Duffield, “Network Tomography of Binary Network Performance Characteristics â€DOI: 10.1109/TIT.2006.885460, ISSN: 0018-9448, Electronic ISSN: 1557-9654

[9] Yigal Bejerano and Rajeev Rastogi, “Robust Monitoring of Link Delays and Faults in IP Networks†DOI: 10.1109/TNET. 2006.882907, PrintISSN: 1063-6692Electronic ISSN: 1558-2566

[10] Denisa Ghita, Can Karakus, Katerina Argyraki, Patrick Thiran, “Shifting Network Tomography Toward A Practical Goal†DOI:10.1145/2[i]079296.2079320 ISBN: 978-1-4503-1041-3

View Full Article:

How to Cite

Shekhawat, N., Panchamia, S., & S, U. (2018). Detection of Node Failure Localization in Communication Networks. International Journal of Engineering & Technology, 7(3.12), 1149–1153.
Received 2018-08-18
Accepted 2018-08-18
Published 2018-07-20