On the scalability of Delay-Tolerant Botnets

  • Authors:
  • Zesheng Chen;Chao Chen;Qian Wang

  • Affiliations:
  • Department of Engineering, Indiana University – Purdue University Fort Wayne, Fort Wayne IN, 46805, USA.;Department of Engineering, Indiana University – Purdue University Fort Wayne, Fort Wayne IN, 46805, USA.;Department of Electrical and Computer Engineering, Florida International University, Miami FL, 33174, USA

  • Venue:
  • International Journal of Security and Networks
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this work, we present a novel intelligent botnet, called the delay-tolerant botnet, that intentionally adds random delays to command propagation and endeavours to avoid detection. We then study the scalability of delay-tolerant botnets. Specifically, we apply mathematical analysis to derive the average delay required to distribute a command to all bots in three types of command and control architectures: centralised, distributed, and hybrid delay-tolerant botnets. We find that in all cases, the delay increases approximately logarithmically with the number of bots, indicating that the delay-tolerant botnets are scalable. Finally, we verify the analytical results by simulations.