🕔 Call For Paper — Vol. 12  |  Issue 4  |  December 2026  |  Deadline: 20-Dec-2026
Track Paper Submit Paper Contact

Paper Details

Home › Archives › Paper Details
← Back to Issue
Vol. 4  No. 6 (2018) · Articles

NODE FAILURE DISCOVERY WITH NETWORK LOCALIZING POTENTIALITY THROUGH END TO END PATH SCALABILITY

B THIKKANNA
ASSISTANT PROFESSOR, VIDYA JYOTHI INSTITUTE OF TECHNOLOGY, HYDERABAD. , IN

M VENKATESWARLU
ASSISTANT PROFESSOR, VIDYA JYOTHI INSTITUTE OF TECHNOLOGY, HYDERABAD. , IN

📅 Published: June 2018

Keywords: Network tomography, failure localization, identifiability condition, maximum identifiability index.

📄 View / Download PDF ⬇ Download

Abstract

We investigate the functionality of localizing node screw ups in communication networks from binary states (regular/failed) of give up-to-cease paths. Given a set of nodes of hobby, uniquely localizing screw ups inside this set requires that specific observable course states partner with specific node failure occasions. However, this circumstance is difficult to check on big networks because of the want to enumerate all viable node disasters. Our first contribution is a hard and fast of enough/important situations for identifying a bounded number of disasters inside an arbitrary node set that may be tested in polynomial time. In addition to network topology and places of video display units, our situations additionally comprise constraints imposed by the probing mechanism used. We don't forget 3 probing mechanisms that vary in accordance to whether or not measurement paths are: (i) arbitrarily controllable; (ii) controllable but cycle-unfastened; or (iii) uncontrollable (decided by the default routing protocol). Our 2d contribution is to quantify the capability of failure localization through: 1) the most range of failures (everywhere inside the community) such that disasters inside a given node set may be uniquely localized and 2) the largest node set within which failures can be uniquely localized underneath a given sure on the overall quantity of screw ups. Both measures in 1) and 2) can be converted into the capabilities of an in line with-node belongings, which may be computed effectively based totally on the above enough/important situations. We display how measures 1) and 2) proposed for quantifying failure localization functionality can be used to assess the effect of various parameters, along with topology, wide variety of video display units, and probing mechanisms.

How to Cite

B THIKKANNA, M VENKATESWARLU, “NODE FAILURE DISCOVERY WITH NETWORK LOCALIZING POTENTIALITY THROUGH END TO END PATH SCALABILITY,” International Journal of Technical Innovation in Modern Engineering & Science, vol. 4, no. 6, pp. 1180-1185, June 2018.

References

NA

🔒 Content is protected — © IJTIMES