Email this article A New Enhanced Technique for Identify Node Failure With Optimal Path In Network
Abstract
We examine the skill of limiting node failures in communication networks from binary states of end-to-end paths. Specified a set of nodes of curiosity, inimitably localizing failures within this set necessitates that un a like apparent path states secondary with different node failure events. Though, this disorder is tough to test on large networks due to the necessity to compute all thinkable node failures. Our first input is a set of appropriate/compulsory conditions for detecting a bounded number of letdowns within a random node set that can be verified in polynomial time. In adding to network topology and locations of monitors, our circumstances also join constraints compulsory by the searching device used. Both measures can be rehabilitated into purposes of a per-node stuff, which can be calculated professionally based on the above enough/essential circumstances.
References
R. R. Kompella, J. Yates, A. Greenberg, and A. C. Snoeren, “Detection and localization of network black holes,” in Proc. 26th IEEE INFOCOM, May 2007, pp. 2180–2188.
A. Coates, A. O. Hero, III, R. Nowak, and B. Yu, “Internet tomography,” IEEE Signal Process. Mag., vol. 19, no. 3, pp. 47–65, May 2002.
D. Ghita, C. Karakus, K. Argyraki, and P. Thiran, “Shifting network tomography toward a practical goal,” in Proc. ACM CoNEXT, 2011, Art. no. 24.
Y. Bejerano and R. Rastogi, “Robust monitoring of link delays and faults in IP networks,” in Proc. 22nd IEEE INFOCOM, Mar./Apr. 2003, pp. 134–144.
J. D. Horton and A. López-Ortiz, “On the number of distributed measurement points for network tomography,” in Proc. 3rd ACM IMC, 2003, pp. 204–209.
S. Zarifzadeh, M. Gowdagere, and C. Dovrolis, “Range tomography: Combining the practicality of Boolean tomography with the resolution of analog tomography,” in Proc. ACM IMC, 2012, pp. 385–398.
A. Markopoulou, G. Iannaccone, S. Bhattacharyya, C.-N.Chuah, and C. Diot, “Characterization of failures in an IP backbone,” in Proc. 23rd IEEE INFOCOM, Mar. 2004, pp. 2307–2317.
N. Duffield, “Simple network performance tomography,” in Proc. 3rd ACM IMC, 2003, pp. 210–215.
N. Duffield, “Network tomography of binary network performance characteristics,” IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5373–5388, Dec. 2006.
H. Zeng, P. Kazemian, G. Varghese, and N. McKeown, “Automatic test packet generation,” in Proc. ACM CoNEXT, 2012, pp. 241–252.
H. X. Nguyen and P. Thiran, “The Boolean solution to the congested IP link location problem: Theory and practice,” in Proc. 26th IEEE INFOCOM, May 2007, pp. 2117–2125.
A. Dhamdhere, R. Teixeira, C. Dovrolis, and C. Diot, “Netdiagnoser: Troubleshooting network unreachabilities using end-to-end probes and routing data,” in Proc. ACM CoNEXT, 2007, Art. no. 18.
Y. Huang, N. Feamster, and R. Teixeira, “Practical issues with using network tomography for fault diagnosis,” ACM SIGCOMM Comput.Commun.Rev., vol. 38, no. 5, pp. 53–58, 2008.
H. X. Nguyen and P. Thiran, “Active measurement for multiple link failures diagnosis in IP networks,” in Proc. 5th PAM, 2004, pp. 185–194.
S. S. Ahuja, S. Ramasubramanian, and M. Krunz, “SRLG failure localization in all-optical networks using monitoring cycles and paths,” in Proc. 27th IEEE INFOCOM, Apr. 2008.
Liang Ma, Member, IEEE, Ting He, Senior Member, IEEE, Ananthram Swami, Fellow, IEEE, Don Towsley, Fellow, IEEE, ACM, and Kin K. Leung, Fellow, IEEE, ACM, Network Capability in Localizing Node Failures via End-to-End Path Measurements, 2017.
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.