Skip to main content
SpringerLink
Log in

Detecting Weak Points in Networks Using Variable Neighborhood Search

  • Conference paper
  • First Online:
Variable Neighborhood Search (ICVNS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11328))

Included in the following conference series:

Abstract

Recent advances in networks technology require from advanced technologies for monitoring and controlling weaknesses in networks. Networks are naturally dynamic systems to which a wide variety of devices are continuously connecting and disconnecting. This dynamic nature force us to maintain a constant analysis looking for weak points that can eventually disconnect the network. The detection of weak points is devoted to find which nodes must be reinforced in order to increase the safety of the network. This work tackles the \( \alpha \) separator problem, which aims to find a minimum set of nodes that disconnect the network in subnetworks of size smaller than a given threshold. A Variable Neighborhood Search algorithm is proposed for finding the minimum \( \alpha \) separator in different network topologies, comparing the obtained results with the best algorithm found in the state of the art.

This work has been partially founded by Ministerio de Economía y Competitividad with grant ref. TIN2015-65460-C2-2-P.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Andersson, G., et al.: Causes of the 2003 major grid blackouts in North America and Europe, and recommended means to improve system dynamic performance. IEEE Trans. Power Syst. 20(4), 1922–1928 (2005)

    Article  MathSciNet  Google Scholar 

  2. Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Soc. 25(2), 163–177 (2001)

    Article  Google Scholar 

  3. Crucitti, P., Latora, V., Marchiori, M.: Model for cascading failures in complex networks. Phys. Rev. E 69, 045104 (2004)

    Article  Google Scholar 

  4. Duarte, A., Sánchez-Oro, J., Resende, M.G., Glover, F., Martí, R.: Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization. Inf. Sci. 296, 46–60 (2015)

    Article  MathSciNet  Google Scholar 

  5. Erdős, P., Rényi, A.: On random graphs. Publ. Math. 6, 290 (1959)

    MathSciNet  MATH  Google Scholar 

  6. Feige, U., Mahdian, M.: Finding small balanced separators. In: Kleinberg, J.M. (ed.) STOC, pp. 375–384. ACM (2006)

    Google Scholar 

  7. Feo, T., Resende, M.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2), 67–71 (1989)

    Article  MathSciNet  Google Scholar 

  8. Feo, T.A., Resende, M.G., Smith, S.H.: Greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42(5), 860–878 (1994)

    Article  Google Scholar 

  9. Garey, M., Johnson, D.: Computers and Intractability - A guide to the Theory of NP-Completeness. Freeman, San Fransisco (1979)

    MATH  Google Scholar 

  10. Hansen, P., Mladenovic, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001)

    Article  MathSciNet  Google Scholar 

  11. Hansen, P., Mladenović, N.: Variable neighborhood search. In: Burke, E., Kendall, G. (eds.) Search Methodologies, pp. 313–337. Springer, Boston (2014)

    Chapter  Google Scholar 

  12. Hansen, P., Mladenović, N., Pérez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367–407 (2010)

    Article  MathSciNet  Google Scholar 

  13. Lee, J., Kwak, J., Lee, H.W., Shroff, N.B.: Finding minimum node separators: a Markov chain Monte Carlo method. In: 13th International Conference on Design of Reliable Communication Networks, DRCN 2017, pp. 1–8, March 2017

    Google Scholar 

  14. Mladenovic, N., Petrovic, J., Kovacevic-Vujcic, V., Cangalovic, M.: Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. Eur. J. Oper. Res. 151(2), 389–399 (2003)

    Article  MathSciNet  Google Scholar 

  15. Mohamed-Sidi, M.: K-separator problem. (Problème de k-Sèparateur). Ph.D. thesis, Telecom & Management SudParis, Èvry, Essonne, France (2014)

    Google Scholar 

  16. Quintana, J.D., Sánchez-Oro, J., Duarte, A.: Efficient greedy randomized adaptive search procedure for the generalized regenerator location problem. Int. J. Comput. Intell. Syst. 9(6), 1016–1027 (2016)

    Article  Google Scholar 

  17. Wachs, M., Grothoff, C., Thurimella, R.: Partitioning the internet. In: Martinelli, F., Lanet, J.L., Fitzgerald, W.M., Foley, S.N. (eds.) CRiSIS, pp. 1–8. IEEE Computer Society (2012)

    Google Scholar 

  18. Whitaker, R.: A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFOR: Inf. Syst. Oper. Res. 21(2), 95–108 (1983)

    MATH  Google Scholar 

  19. Yen, J.Y.: Finding the k shortest loopless paths in a network. Manag. Sci. 17(11), 712–716 (1971)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences, Universidad Rey Juan Carlos, Móstoles, Spain

    Sergio Pérez-Peló, Jesús Sánchez-Oro & Abraham Duarte

Authors
  1. Sergio Pérez-Peló
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jesús Sánchez-Oro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abraham Duarte
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jesús Sánchez-Oro .

Editor information

Editors and Affiliations

  1. University of Macedonia, Thessaloniki, Greece

    Angelo Sifaleras

  2. University of Kent, Canterbury, UK

    Said Salhi

  3. Royal Military College of Canada, Kingston, ON, Canada

    Jack Brimberg

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pérez-Peló, S., Sánchez-Oro, J., Duarte, A. (2019). Detecting Weak Points in Networks Using Variable Neighborhood Search. In: Sifaleras, A., Salhi, S., Brimberg, J. (eds) Variable Neighborhood Search. ICVNS 2018. Lecture Notes in Computer Science(), vol 11328. Springer, Cham. https://doi.org/10.1007/978-3-030-15843-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-15843-9_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-15842-2

  • Online ISBN: 978-3-030-15843-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation