Skip to content

Instantly share code, notes, and snippets.

Avatar

Sajjad "JJ" Arshad sajjadium

View GitHub Profile
@sajjadium
sajjadium / iccaie2011botnet.md
Last active Mar 12, 2020
An Anomaly-based Botnet Detection Approach for Identifying Stealthy Botnets
View iccaie2011botnet.md

Botnets (networks of compromised computers) are often used for malicious activities such as spam, click fraud, identity theft, phishing, and distributed denial of service (DDoS) attacks. Most of previous researches have introduced fully or partially signature-based botnet detection approaches.

In this paper, we propose a fully anomaly-based approach that requires no a priori knowledge of bot signatures, botnet C&C protocols, and C&C server addresses. We start from inherent characteristics of botnets. Bots connect to the C&C channel and execute the received commands. Bots belonging to the same botnet receive the same commands that causes them having similar netflows characteristics and performing same attacks. Our method clusters bots with similar netflows and attacks in different time windows and perform correlation to identify bot infected hosts. We have developed a prototype system and evaluated it with real-world traces including normal traffic and several real-world botnet traces. The results show that o

@sajjadium
sajjadium / pdccs2009diskscheduling.md
Last active Mar 12, 2020
A Disk Scheduling Algorithm Based on ANT Colony Optimization
View pdccs2009diskscheduling.md

Audio, animations and video belong to a class of data known as delay sensitive because they are sensitive to delays in presentation to the users. Also, because of huge data in such items, disk is an important device in managing them. In order to have an acceptable presentation, disk requests deadlines must be met, and a real-time scheduling approach should be used to guarantee the timing requirements for such environment. However, some disk scheduling algorithms have been proposed since now to optimize scheduling real-time disk requests, but improving the results is a challenge yet.

In this paper, we propose a new disk scheduling method based on Ant Colony Optimization (ACO) approach. In this approach, ACO models the tasks and finds the best sequence to minimize number of missed tasks and maximize throughput. Experimental results showed that the proposed method worked very well and excelled other related ones in terms of miss ratio and throughput in most cases.

Conference: ISCA Conference on Parallel and Di

View keybase.md

Keybase proof

I hereby claim:

  • I am sajjadium on github.
  • I am sajjadium (https://keybase.io/sajjadium) on keybase.
  • I have a public key ASAtQQU4HmulTkW1r69TJ5gyeQWecD5avjcE5OrqO99L1wo

To claim this, I am signing this object: `

You can’t perform that action at this time.