On the scalability of Delay-Tolerant Botnets
by Zesheng Chen, Chao Chen, Qian Wang
International Journal of Security and Networks (IJSN), Vol. 5, No. 4, 2010

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.

Online publication date: Thu, 23-Dec-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com