Skip to main content

Fault Localization by Imperialist Competitive Algorithm

  • Conference paper
  • First Online:
Multi-disciplinary Trends in Artificial Intelligence (MIWAI 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9426))

  • 1285 Accesses

Abstract

Faults in computer networks may result in millions of dollars in cost. Faults in a network need to be localized and repaired to keep the health of the network. Fault management systems are used to keep today’s complex networks running without significant cost, either by using active techniques or passive techniques. In this paper, we propose a novel approach based on imperialist competitive algorithm using passive techniques to localize faults in computer networks. The presented approach using end-to-end data detect that there are faults on the network, and then we use imperialist competitive algorithm (ICA) to localize faults on the network. The aim of proposed approach is to minimize the cost of localization of faults in the network. According to simulation results, our algorithm is better than other state-of-the-art approaches that localize and repair all faults in a network.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Patrick, L., Vishal, M., Rubenstein, D.: Toward optimal network fault correction via end-to-end inference. In: 26th IEEE International Conference on Computer Communications, New York, October 25–26, pp. 165–172 (2007)

    Google Scholar 

  2. Yijiao, Y., Qin, L., Liansheng, T.: A graph-based proactive fault identification approach in computer networks. Comput. Commun. 28, 366–378 (2005)

    Article  Google Scholar 

  3. Bing, W., Wei, W., Hieu, D., Wei, Z., Krishna, R.: Fault localization using passive end-to-end measurements and sequential testing for wireless sensor networks. IEEE Trans. Mob. Comput. 11, 439–452 (2012)

    Article  Google Scholar 

  4. Garshasbi, M.S., Jamali, Sh.: A new fault detection method using end-to-end data and sequential testing for computer networks. Int. J. Inf. Technol. Comput. Sci. 1, 93–100 (2014)

    Google Scholar 

  5. Atashpaz-Gargari, E.: Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: 2007 IEEE Congress on Evolutionary Computation, CEC 2007, 25–28 September 2007

    Google Scholar 

  6. Hung, N., Patrick, T.: Using end-to-end data to infer lossy links in sensor networks. In: 25th IEEE International Conference on Computer Communications Proceedings (2006)

    Google Scholar 

  7. Balaji, P., Shakti, K., Vinay, K.P.: Fault management of computer networks based on probe station and probe set selection algorithms. In: International Conference on Advances in Electronics, Qinhuangdao, China, June 25–27, pp. 504–508 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hamid Parvin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Shahriari, A., Rad, F., Parvin, H. (2015). Fault Localization by Imperialist Competitive Algorithm. In: Bikakis, A., Zheng, X. (eds) Multi-disciplinary Trends in Artificial Intelligence. MIWAI 2015. Lecture Notes in Computer Science(), vol 9426. Springer, Cham. https://doi.org/10.1007/978-3-319-26181-2_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26181-2_38

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26180-5

  • Online ISBN: 978-3-319-26181-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics