IJSRSET
IJSRSET
IJSRSET
ABSTRACT
Distributed Denial of Service (DDoS) attack in a client server environment would collapse the entire system, but as far as
cloud is concern it is not that effective but still it will try to disturb the regular activity of the system. We deploy multiple
Intrusion Prevention System (IPS) to monitor the activity of the users and filter the request based on the behaviour and
forwards to the corresponding servers through cloud server. Every server would have allocated certain space in cloud
server. IPS monitors the activity of the users to avoid DDoS attacks. This system ensures the detection and avoidance of
DDoS attack in the cloud server. Few DDoS attacks are listed and monitored. The behaviour patterns are 1.Continuous
and same request from single user in a point of time,2.Different query from the same user within a period of
time,3.Different queries from different users but from same IP, 4. Request of huge sized file beyond the permitted. Based
on these patterns user behaviour is monitored therefore DDoS attack is avoided in cloud.
Keywords: Cloud computing, Distributed denial-of-service attack detection and avoidance, multiple Intrusion
Prevention System (IPS)
IJSRSET15222 | Received: 27 Feb 2015 | Accepted: 7 March 2015 | March-April 2015 [(1)2: 49-57] 49
user form the attacks. In existing system they were using beyond the permitted. Based on these patterns user
single IPS to scan the query of a cloud user [7]. Here behavior is monitored DDOS attack is avoided in
multiple IPS is deployed to monitor the user query so cloud.In order to estimate our resource demands and
that it easily finds the denial of attack. Cloud Servers is QoS for benign users in a DDoS battle, we employ
a cloud infrastructure service that allows users to deploy queueing theory to undertake performance evaluation
one to hundreds of cloud servers instantly and create due to its extensive deployment in could performance
advanced, high availability architectures.In general, the analysis, such as in [19], [20], [21].Various distributions
number of benign users is stable, and we suppose the of Linux are supported, and each user space allocation
virtual IPS and virtual server have been allocated with different band width is allocated so they utilizes
sufficient resources, and therefore the quality of service within the bandwidth.
(QoS) is satisfactory to users.
AES Process
In Fig.2 Shift Rows – A transposition step where the last
We start by looking at the overall structure of the AES three rows of the state are shifted cyclically a certain
cipher algorithm. In AES, the block size is 16 bits and number of steps. It Fig.3 Mix Column - A mixing
the key size can be 16bits, 192bits or 216 bits. Consider operation which operates on the columns of the state,
DES algorithm, the cipher consists of a basic operation combining the four bytes in each column.
called "round" which is repeated a number of times.
AddRoundKey -The subkey is combined with the state.
In the case of AES is based on a design principle called For each round, a subkey is derived from the
"Substitution-Permutation Networks (SPN)" which state main key using Rijndael's key schedule. Each subkey is
that the cipher is composed of a series of substitutions the same size as the state. The subkey is added by
and permutations one after each another. combining each byte of the state with the corresponding
byte of the subkey using bitwise XOR.
The key size used for an AES cipher specifies the
number of repetitions of transformation rounds that
Once N(s) is in place, we can calculate n(t) using the On the other hand, we are interested in observing the
inverse Laplace transforms, workload of individual web sites for our following
experiments. In order to obtain this data,we observed two
popular web sites (one news web site and one e-business
n(t) = 1/2(pi)i integral( N(s) e^st ds ) (4) web site) of a data center of a major ISP. We counted the
requests for each web site every 30 seconds for a day. We
In our case, m(t) represents the arrival distribution, g(t) processed the data and present the number of requests in
is the system service distribution. In the queuing theory, seconds in Fig. 2. From these results, we can see that the
requests for a popular web site are usually less than 10
system can be modeled as G=G=p, namely, general
requests per second. It is generally unwise to reserve too
arrival distribution and general service rate distribution. many idle resources as it becomes costly. For the news web
However, for this general model, the analysis will be site, we suppose the owner reserves resources for a
very complex. For ex, we cannot obtain M(s) and G(s) maximum need of 10 requests per second. As Moore et al.
from m(t), g(t) most of the time, and we cannot obtain [8] indicated, the average attack rate is 500 requests or
packets per second. This means a web site faces 50 times
n(t) even if N(s) is in place sometime.
the workload of its maximum capacity.
III. RESULTS AND DISCUSSION It is not difficult to conclude that a DDoS attack is highly
likely to be successful. This confirms our claim that a
A. Performance Evaluation DDoS attack is still a critical threat to individual cloud
hosted services. As discussed previously, we use average
In this section, we evaluate the performance of theproposed time in system as a metric for our performance evaluation
dynamic resource allocation method for DDoS mitigation in the following experiments. Therefore, let us firstly
in a cloud from various perspectives. We first study the explore the average time in system for nonattack cases,
which is modelled as an M/M/1 queue. We want to know
performance for nonattack scenarios, then investigate the
the impact on the average time in a system from different
performance of the proposed mitigation method against an arrival rates under different service rates.we obtained the
on-going DDoS attack, and then estimate the cost for the results of experiments shown in Fig. 3. These results
proposed mitigation methods. First of all, we summarize indicated that when an IPS server is heavily loaded, e.g.,
the key statistics of DDoS attacks in a global scenario from µ=10 (therefore, ρn1 when λ10), Tn increases in an
highly referred literature [6], [8], and present them in Table exponential way. On the other hand, when the IPS server‟s
1.A cloud usually has profound resources. We use the workload is suitable, e.g.,µ= 15 (therefore, ρn 2/3 when
λ10), This relatively stable for various arrival rate λ.
Amazon EC2 as an example and show the related data in
From this experiment, we know that the workload of an
Table 2. IPS should be kept within a suitable range. If it is too low,
say ρn< 0:5, then we waste some capability of the system.
TABLE 1 On the other hand, if it is too high, say ρn1, then we
Key Statistics of DDoS Attacks degrade the quality of service for benign users. We
summarize this in the following observation.
Feature Attack duration Attack rate Sources per
[8] [8] attack a) Observation 1
b) Observation 2
Secondly, we studied the performance when a DDoS attack
was ongoing. As previously discussed, we have multiple In order to reduce the queuing probability, we prefer the
IPS servers in this case, and the model is M/M/m. For the busy rate to be high. We note there is a contradiction
system of multiple IPS servers, ᴨ0is an important element, between observation 1 and observation 2. Intuitively, there
and is also involved in the calculation of other items. We should exist equilibrium for the busy rate that balances the
expect a good understanding of ᴨ0against the number of needs from both sides. However, this is beyond the scope
duplicated servers (m) for a given busy rate. of this paper, and will be an avenue for future research. To
evaluate the performance of the proposed mitigation
method, we desperately want to know how we can beat an
on-going DDoS attack using minimum resources. In other
words, how can we hold equation under the constrains. In
the following experiments, we set the service rate of the
original IPS as µ=10, therefore, there are three variables, λ
(arrival rate for nonattack cases), r (attack strength as
defined before), and m (number of duplicated IPSs), which
have an impact on our results. In order to match our
previous experiments, we conduct three experiments for λ=
5; 7; and 9, respectively. For a given λ, we observe the
variation of f(r,m). The results are shown in Figs. 6a, 6b, 6c,
which show complete information about the metric f(r,m).
As previously discussed, if f(r,m) <0, this means the
average time in system for the proposed method is greater
than that of nonattack cases, namely, the quality of service
for benign users in an attack case is worse than they expect.
Figure 5: Average time in system against arrival rate under different service In order to guarantee the QoS, we need to keep f(r,m) ≥ 0,
rates for nonattack cases. which is of more interest to us. Therefore, we repeat the
threesimulations and only display the f(r,m) ≥ 0 parts,
The experiment results are shown in Fig. 4. In contrast to asshown in Figs. 6a.1, 6b.1, 6c.1, respectively. When f(r,m)
ᴨ0, ρmþ is also important to us because it is a critical point < 0, this means benign users enjoy an even better QoS than
where incoming packets have to wait for service, which is they had in nonattack cases. This occurs by the cloud
expressed and the experimental results are shown in Fig. 5. service provider investing more resources into the service.
The results indicate that: 1) for a given number of
duplicated IPS servers, the higher ρ is, the less probability
of packet queueing; 2) for a given ρ, the probability of
packet queueing decreases when there are more duplicated
found out that the DDoS attacks are the major threat in [6] M.A. Rajab, J. Zarfoss, F. Monrose, and A. Terzis, „„My Botnetis
Bigger Than Yours (Maybe, Better Than Yours): Why Size Estimates
cloud environment and acts as a effective tool for cyber Remain Challenging,‟‟ in Proc. 1st Conf. HotBots, 2007, p. 5.
criminals to shutdown individual cloud customers. Because [7] D.K.Y. Yau, J.C.S. Lui, F. Liang, and Y. Yam, „„DefendingAgainst
Distributed Denial-of-Service Attacks with Max-Min Fair Server-
of this we design a strategy for dynamic allocation of Centric Router Throttles,‟‟ IEEE/ACM Trans. Netw., vol. 13, no. 1, pp.
resources and to avoid brute force attack through Intrusion 29-42, Feb. 2005.
Prevention System to defeat the attack and provide Quality [8] D. Moore, C. Shannon, D.J. Brown, G.M. Voelker, and S. Savage,
„„Inferring Internet Denial-of-Service Activity,‟‟ ACM Trans. Comput.
of Service (QoS). Syst., vol. 20, no. 2, pp. 115-139, May 2006.
[9] S. Ros, F. Cheng, and C. Meinel, “Intrusion Detection in the Cloud,”
2009 Eighth IEEE International Conference on Dependable, Autonomic
and Secure Computing, pp. 729–734, Dec. 2009.
Future Work
[10] “Detecting Application Denial-of-Service Attacks: A Group-Testing-
Current clouds are considered to be distributed systems, Based Approach.” Ying Xuan Dept. of Comput. & Inf. Sci. & Eng.,
Univ. of Florida, Gainesville, FL, USA Incheol Shin ; Thai, M.T. ;
and a cloud is usually a composite of a number of data Znati, T.
centers. A cloud customer is generally hosted by one data [11] U. Tupakula, V. Varadharajan, and N. Akku, “Intrusion Detection
center. The problem arises if a data center runs out of Techniques for Infrastructure as a Service Cloud,” 2011 IEEE Ninth
International Conference on Dependable, Autonomic and Secure
reserved resources during abattle against a DDoS attack; Computing, pp. 744–751, Dec. 2011.
the question remains how touse the reserved resources of [12] J. Idziorek, M. Tannian, and D. Jacobson, „„Insecurity of Cloud Utility
other data centers to beat the ongoing attack, defeat the Models,‟‟ IT Prof., vol. 15, no. 2, pp. 18-23, Mar./Apr. 2012.
attacks, and at the same time guaranteeing the quality of [13] S. L. and Z. L. and X. C. and Z. Y. and J. Chen, S. Luo, Z. Lin, X. Chen,
Z. Yang, and J. Chen, “Virtualization security for cloud computing
service for benign users. service,” in International Conference on Cloud and Service Computing
(CSC), 2011, pp. 174–179.
[14] Q. Wang, K. Ren, and X. Meng, „„When Cloud Meets Ebay: Towards
As future work, we firstly attempt to improve the M/M/m Effective Pricing for Cloud Computing,‟‟ in Proc.INFOCOM, Mar.
model to a more general model, such as the M/G/m model 2012, pp. 936-944.
for better performance. Secondly, to explore what to be [15] A. Shevtekar, K. Anantharam, and N. Ansari, “Low rate TCP Denial-of-
Service attack detection at edge routers,” IEEE Commun. Lett.,vol. 9,
done if a cloud data center runs out of resources during a no. 4, pp. 363–365, Apr. 2005.
battle. In future collaborative resource sharing will be used [16] Y. Chen, K. Hwang, and W.-S. Ku, “Collaborative detection of
in majority in this case this system can designed to ensure DDoSattacks over multiple network domains,” IEEE Trans. Parallel
Distrib.Syst., vol. 16, no. 12, pp. 1649–1662, Dec. 2007.S. Yu and W.
the security in proper manner and attack should be detected Zhou, “Entropy-Based collaborative detection of DDoSattacks on
and avoided in the data packet shared between the service community networks,” in Proc. 6th IEEE Int. Conf.
PervasiveComputing and Communications (PerCom 2008), 2008,
providers. Thirdly, we would like to discover whether it is pp.566–571.
possible for attackers to rent the resources of a cloud to [17] R.Wartel, T.Cass, B.Moreira, E. Roche, M. Guijarro, S.Goasguen, and
U.Schwickerath, „„Image Distribution Mechanisms in Large Scale
carry out their attacks on servers hosted by the same or Cloud Providers,inProc.CloudCom, 2010, pp.112 117.
other clouds and to find out whether there is any other [18] J. Zhu, Z. Jiang, and Z. Xiao, „„Twinkle: A Fast Resource Provisioning
possible behaviour of DDoS attacks which would affect the Mechanism for Internet Services,‟‟ in Proc. INFOCOM, 2011, pp. 802-
810.
cloud customers. Finally, real cloud environment tests for
[19] H. Khazaei, J.V. Misic, and V.B. Misic, „„Performance Analysis of
the proposed method are expected in the near future which Cloud Computing Centers using m/g/m/m+r Queuing Systems,‟‟ IEEE
makes cloud environment usage safe. Trans. Parallel Distrib. Syst., vol. 19, no. 5, pp. 936-943, May 2012.
[20] H. Khazaei, J.V. Misic, V.B.Misic, and S. Rashwand, „„Analysis of a
Pool Management Scheme for Cloud Computing Centers,‟‟
V. REFERENCES IEEE Trans.Parallel Distrib. Syst.,vol.20, no.5, pp. 849-861,May 2013.
[21] H. Sun, J. C. S. Lui, and D. K. Y. Yau, “Defending against low-rate
TCP attacks: Dynamic detection and protection,” in Proc. IEEE
[1] J. Francois, I. Aib, and R. Boutaba, „„Firecol, a Collaborative Protection Int.Conf. Network Protocols (ICNP 2004), 2004, pp. 196–205.
Network for the Detection of Flooding ddos Attacks,‟‟IEEE/ACM
Trans. Netw., vol. 20, no. 6, pp. 168-1641, Dec. 2012.
[22] H. Sun, J. C. S. Lui, and D. K. Y. Yau, “Defending against low-rate
TCP attacks: Dynamic detection and protection,” in Proc. IEEE
[2] C. Peng, M. Kim, Z. Zhang, and H. Lei, „„Vdn: Virtual Machine Image Int.Conf. Network Protocols (ICNP 2004), 2004, pp. 196–205.
Distribution Network for Cloud Data Centers,‟‟ in Proc.INFOCOM,
2012, pp. 161-169.
[23] Dagon, C. Zou, and W. Lee, „„Modeling Botnet Propagation using Time
Zones,‟‟ in Proc. 13th NDSS, 2006, pp. 1-16.