Skip to main content

Designing Network Immunization Strategies Based on Graph Partitioning Methods

  • Chapter
Future Communication, Computing, Control and Management

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 141))

  • 2705 Accesses

Abstract

Designing effective immunization strategies is very important to fight against epidemic attacks such as worms and viruses. In this paper, we design two immunization strategies based on graph partitioning methods. We compare the proposed strategies in various simulation scenarios with the widely used High Degree First (HDF) immunization strategy. We find the proposed immunization strategies based on graph partitioning methods are better than the HDF immunization strategy in all of the simulation scenarios.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Staniford, S., Paxson, V., Weaver, N.: How to own the internet in your spare time. In: Proc. 11th Symp. USENIX Security, pp. 149–167 (2002)

    Google Scholar 

  2. Pastor-Satorras, R., Vespignani, A.: Immunization of complex networks. Phys. Rev. E 65(3), 036104 (2002)

    Article  Google Scholar 

  3. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: SIGCOMM 1999, pp. 251–262 (1999)

    Google Scholar 

  4. Pastor-Satorras, R., Vespignani, A.: Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86(14), 3200–3203 (2001)

    Article  Google Scholar 

  5. Chakrabarti, D., Wang, Y., Wang, C., Leskovec, J., Faloutsos, C.: Epidemic thresholds in real networks. ACM Trans. Inf. Syst. Secur. 10(4), 1–26 (2008)

    Article  Google Scholar 

  6. Haddadi, H., Fay, D., Jamakovic, A., Maennel, O., Moore, A., Mortier, R., Rio, M., Uhlig, S.: Beyond node degree: evaluating as topology models, University of Cambridge, Computer Laboratory, Tech. Rep. UCAM-CL-TR-725 (2008)

    Google Scholar 

  7. Zhou, S., Mondragon, R.J.: Accurately modeling the internet topology. Phys. Rev. E 70(6), 66108 (2004)

    Article  Google Scholar 

  8. http://www.netdimes.org/

  9. Garey, M., Johnson, D.: Computers and intractability. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  10. Borgatti, S.: The key player problem. SSRN eLibrary (2002)

    Google Scholar 

  11. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20(1), 359 (1999)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Changxi Niu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag GmbH Berlin Heidelberg

About this chapter

Cite this chapter

Niu, C., Li, L., Xu, D. (2012). Designing Network Immunization Strategies Based on Graph Partitioning Methods. In: Zhang, Y. (eds) Future Communication, Computing, Control and Management. Lecture Notes in Electrical Engineering, vol 141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27311-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27311-7_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27310-0

  • Online ISBN: 978-3-642-27311-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics