An Epidemic-Dynamics-Based Model for CXPST Spreading in Inter-Domain Routing System

  • Yu Wang
  • Zhenxing Wang
  • Liancheng Zhang
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 212)


We study the CXPST attack which aims at the destruction of inter-domain routing system and propose a spreading model to represent the threatening scale. By analyzing the process we illuminate the mechanism of how CXPST seizes the BGP deficiencies to paralyze the Internet control plane from the traffic attack of data plane, and then the spreading model named as EDM-CS is presented based by the epidemic dynamics theory. Parameters of the model are closely associated with the real network topology and BGP router overloading condition which reflect the features of the CXPST spreading. In virtue of the classical BA scale-free network, spreading density that derives from EDM-CS behaves great consistency with the simulation results based on the collected data from CAIDA. This model can help understanding CXPST attack and providing a basis for predicting the spreading trend, as well as investigating effective defense strategy.


CXPST Inter-domain routing system Spreading model Epidemic dynamics 


  1. 1.
  2. 2.
    Wan T, Van Oorschot P C (2006) Analysis of BGP prefix origins during Google’s May 2005 outage. Proceedings of the 20th international parallel and distributed processing symposium. 135–142Google Scholar
  3. 3.
    Schuchard M, Vasserman E Y, Mohaisen A, Kune D F, Hopper N, Kim Y (2010) Losing control of the internet: Using the data plane to attack the control plane. Proceedings of the 17th ACM conference on computer and communication security. 726–728Google Scholar
  4. 4.
    Li X, Wang X (2006) Controlling the spreading in small-world evolving networks stability, oscillation, and topology. IEEE Trans Autom Control 3(51):534–540MathSciNetCrossRefGoogle Scholar
  5. 5.
    Zou CC, Towsley D, Gong W (2006) On the performance of Internet worm scanning strategies. Perform Eval 63:700–723CrossRefGoogle Scholar
  6. 6.
    Chung-Yuan H, Yu-Shiuan T, Tzai-Hung W (2010) A Network-based simulation architecture for studying epidemic dynamics. Simulation 86(5–6):351–368Google Scholar
  7. 7.
    Ogierman A, Elsasser R (2012) The impact of the power law exponent on the behaviour of a dynamic epidemic type process. Proceedings of 24th ACM symposium on parallelism in algorithm and architectures, 131–139Google Scholar
  8. 8.
    Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the Internet topology. ACM SIGCOMM Comput Commun Rev 4(29):251–262CrossRefzbMATHGoogle Scholar
  9. 9.
    Siganos G, Faloutsos M, Faloutsos P, Faloutsos C (2003) Power laws and the AS-level internet topology. IEEE/ACM Trans Networking 4(11):514–524CrossRefzbMATHGoogle Scholar
  10. 10.
    Barabasi A, Albert R (1999) Emergence of scaling in random networks. Science 289(5439):509–512MathSciNetzbMATHGoogle Scholar
  11. 11.
    Routeviews (2012) BGP AS links.
  12. 12.
    Guo Y, Wang Z, Luo S, Wang Y (2011) A cascading failure model for inter domain routing system. Int J Commun Syst 25:1068–1076CrossRefGoogle Scholar
  13. 13.
    Sinclair G, Nunnery C, Kang B B (2009) The waledac protocol: The how and why. Proceedings of the 4th IEEE international conference on malicious and unwanted software, 69–77Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.National Digital Switching System Engineering & Technological Research CenterZhengzhouChina

Personalised recommendations