Dynamic Attack Mitigation using SDN Sharon Ezekiel* , Dinil Mon Divakaran† , Mohan Gurusamy* [email protected], [email protected], [email protected] * Department of Electrical and Computer Engineering, National University of Singapore † Cyber Security R&D, Singtel, Singapore

Abstract—Security threats in the Internet have been ever increasing, in number, type and means used for attacks. In the face of large-scale attacks, such as DDoS attacks, networks take unacceptable time to respond and mitigate the attacks, resulting in disruption to connections and the losses due to it. In this work, we look into the problem of dynamically mitigating attacks from the perspective of an ISP. An ISP also needs to adapt its network while mitigating attacks. We exploit the software defined networking (SDN) paradigm, and propose to provide mitigation as a service to ISP’s customers. Towards this goal, we formulate the problem of dynamically providing multiple mitigation services as an optimization problem. We carry out simulation studies to evaluate the solution, in terms of service delivered and the number of path disruptions caused to legitimate traffic due to mitigation services. Keywords—security, SDN, DDoS, attack, mitigation

I. I NTRODUCTION The damages inflicted by security attacks in the Internet have been prominently evident over the recent years. One of the most serious attacks is the distributed denial-of-service (DDoS) attack, that often takes advantage of connected devices such as smart phones, user computers, residential routers, cameras, printers, and recently Internet of Things (IoT) devices, to harness an army of compromised machines ready for attack [1] [2]. For example, the Dyn cyberattack in October 2016 affected an entire host of major players across different sectors, including Netflix, Amazon, Spotify, Github, Quora Tumblr, etc. [3]. Prevention of such largescale attacks is challenging due the continuous evolving nature of attacks. Reports suggest that there has been a 140% increase in attacks with rates greater that 100 Gbps in Q4 of 2016 in comparison to Q4 of 2015 [3]. Owing to the changing sophisticated techniques used by attackers, current mitigation methods fall short in terms of swiftness to mitigate. The common solutions to DDoS attacks such as blackholing, filtering and putting up firewalls are not able to respond to attacks in a flexible and adaptive manner. Blackholing refers to the technique of blocking all the traffic destined for a victim by the service provider, dumping the diverted traffic to a ’black hole’ (null route) [4]. However, legitimate traffic also gets dumped into the black Part of this work was done when Dinil Mon Divakaran was affiliated with A*STAR Institute for Infocomm Research (I2 R).

hole along with attack traffic, and hence is not the ideal solution. Filtering uses Access Control Lists (ACLs) and is effective to filter out the non-essential, unnecessary protocols like known ping attacks, however, it is rendered ineffective in today’s sophisticated scenario. Though firewall’s importance is indisputable, they are located far too close to the target to serve as an effective mitigation strategy. Overprovisioning, i.e., allocating extra bandwidth and backup network devices to absorb attack, offers a rudimentary level of protection. However, it is an expensive technique, and yet can be conveniently overpowered with an increase in attack rate. Legacy networks take unacceptable time to recover from attack, and they demand the need to configure switches and routers with new rules. Reconfiguration of network often involve network administrators, thereby making the process not only slow but also error-prone. As have been experienced, networks easily take hours to recover from largescale DDoS attacks. Attack mitigation would not be effective unless routers in the affected paths have been successfully reconfigured to handle attack. Thus there is a need of an infrastructure that is able to adapt to mitigation policies dynamically. In this context, we envision Software Defined Networking (SDN) paradigm to offer new techniques for network security and forensics. With a centralized view of the network, and decoupling of control plane from data plane, SDN can enable new efficient, effective, quick-todeploy solutions for attack detection, defence and mitigation. In this work, we decouple attack detection from attack mitigation. Attacks can be detected by separate solutions, either at ISPs or at customer end. We aim to provide attack mitigation as a value added service to the customer base using SDN capabilities. The three mitigation services of interest are: 1) Blocking: When the information of the attack traffic is very precise and does not overlap with any genuine traffic, then the customer can request the ISP to block the specific traffic. 2) Rate-limiting: In the event a customer cannot precisely identify the attack traffic, it can choose to avail the service of limiting the rate of suspicious traffic. For example, DNS reflection and amplification attacks focus on flooding the victim using legitimate DNS servers. Hence the traffic from the reflected servers might

contain legitimate traffic that is difficult to differentiate. Blocking all traffic from legitimate machines used for reflection attacks would hinder normal connectivity. Indeed, if reflection is used in DDoS attacks, simply blocking all traffic from the reflecting server fulfils the purpose of the attack, as it results in disruptions to legitimate connections. Therefore, by requesting for rate limiting service, a customer specifies an aggregate of suspicious traffic it wishes to receive, thereby limiting the impact of the attack. The rate limiters can be enforced on per-flow basis using SDN, allowing the network to react in real-time. 3) Redirecting: Suspicious attack traffic (such as unusual traffic spike, phishing emails, etc.) may also be sent to scrubbers for deeper analysis. A scrubber is responsible to clean the suspicious traffic of spurious and attack traffic, and will allow (based on the scrubber’s capability) only legitimate traffic to pass. Such a request for redirection might be challenging for an ISP, since there might not be sufficient bandwidth to redirect the suspicious traffic to the destination(s). Therefore, depending on the availability of bandwidth, a part of identified traffic might be sent to scrubber, and the rest to the customer. Besides, it is also desirable to keep the number of disrupted normal (legitimate) traffic flows to a minimum. To achieve such path changes, the SDN controller also needs to install rules in the switches, which in itself affects ongoing traffic sessions. We argue that, providing dynamic mitigation services will significantly help to respond against cyber attacks quickly. Consider the case of DDoS attack, when dynamic mitigation services are provided by ISPs. A DDoS attack is easily detected at the victim as the rate (or impact) is very high. Therefore, the victim can instantly request its ISP(s) to mitigate against the attack traffic. The ISP not only dynamically changes its network state in response, but also requests its upstream ISPs to do similarly. This chain of triggering will result not only in drastically reducing the intensity of the attack, but also in identifying the sources of attack, both as quick as the propagation of mitigation requests. We formulate the problem of providing mitigation services as an optimization problem. The services also result in adapting the network to different state, in terms of flows routed in different paths and bandwidth available. We use simulations to provide the first results of this work. Our simulations show that services delivered to customers are dependent on the background traffic, customer’s demand and the constraints on path disruptions of active legitimate traffic sessions permitted by an ISP. After discussing related works in the next section, we describe the system model in Section III. In Section IV, we formulate the mitigation services as an optimization problem, and in Section V we evaluate the performance of

our solution. II. R ELATED W ORKS The literature has a number of solutions of DDoS mitigations. ISPs also have commercial appliances to (detect as well as) block DDoS traffic. But as they are intended to work on legacy networks, the solutions are static in nature. For example, a DDoS prevention appliance requires the ISP to route the traffic through the appliance. Besides, existing solutions are not catered for dynamic requests for mitigation, primarily because legacy networks do not have such capability. There are approaches that suggest the deployment of middleboxes despite the fact that it increases complexity in terms of accounting, diagnostics and access control [5] [6]. Despite their advantages, the net effect of deploying them results in increased complexity of network design and its operation. In another approach, a flexible and scalable solution was built to mitigate DDoS attack which also took into consideration the dynamic type and nature of attack. It primarily addresses the problem of fixed aggregation points to mitigate, fixed functionality in terms of type, and fixed bandwidth in terms of maximum handling volume [7]. Cloudflare provides DDoS mitigation as a service to its customers [8]. The approach is appealing because it requires no changes in the infrastructure which is already existing. It relies on changes made in the customer’s domain to reroute the suspicious traffic to Cloudflare’s infrastructure. This implies that after the changes are applied on the domain, any attacker that tries to victimize a customer using the DNS name will be redirected to Cloudflare’s infrastructure. However, the assumption that all the traffic would be routed to their cloud-based infrastructure can be easily bypassed by a motivated attacker [9]. This is not the case in our work, where we redirect suspicious traffic to a scrubber which cannot be bypassed, since we have a control on routing with SDN. Some approaches aim to detect and mitigate attacks based on parameters like flow-rate and flow duration [10]. Another approach makes use of scheduling algorithms to detect attacks, in particular DDoS attacks [11]. In this work, we focus on mitigation of attacks and assume that detection mechanisms are performed by the customer. We propose a mathematical formulation to mitigate attacks in network. Leveraging on SDN capabilities, we aim to develop dynamic mitigation strategies so that the network adapts by making necessary changes. III. S YSTEM M ODEL We consider a fixed topology ISP network, with an SDN controller and SDN-enabled switches connected to the controller. The ISP network has ingress and egress switches connected to peering ISPs or customers, through which flows enter and leave its network. Without loss of generality, for the purposes here, we consider an ISP receiving traffic

from other ISPs through its ingress switches, and routing the traffic over its internal network to the egress switches to its customers. A scrubber (with one or more machines) is assumed to be located outside the ISP network. For redirection service, the traffic therefore needs to be routed to one or more destinations identified with the scrubber service. Since our aim is to mitigate the attack as close to the origin as possible, ingress nodes of ISPs would be an ideal choice of location to deploy mitigation solutions. This would also ease the attack load on the ISP network and subsequent connected ISPs on the route to the victim. As mentioned before, we also assume that customers detect the attack by observing anomalous behaviour. We assume the users (direct customers or peering ISPs) have deployed real-time detection of suspicious activity. On detection, the user submits the request for mitigation service(s) to the ISP. At this point of time, the ISP’s network is assumed to have mostly normal traffic. Since our ISP is assumed to be SDN-based, the SDN controller of ISP has a global view of the network state before the attack. During mitigation, ISP strives to attain the network state that was before attack. With SDN capability, the ISP network can act upon received requests on a per-flow basis.

rate-limit a suspected attack, it specifies the desired flow rate it wishes to receive from the service provider. This desired rate is an aggregate of the suspicious traffic which is allowed into the ISP network from different ingress switches. Thus, rate-limiting is done at different ingress switches. This task is convenient using SDN capabilities since it is possible to program the switches on the fly. Similarly, if the customer wishes to analyse the traffic further by sending it to a scrubber, it requests the service of rerouting (possibly) part of the incoming traffic to the scrubber, while allowing the remaining traffic to reach itself. To satisfy a request to redirect traffic, the ISP has change the forwarding rules in the switches. B. Role of SDN The requests from customers for mitigation are sent to the SDN controller of the ISP network. The SDN controller (i) solves the optimization problem (presented in the next section) to obtain the rates as well as the (potentially) modified routing paths of the flows; (ii) the SDN controller then proceeds to enforce the computed flow rates at the ingress switches, as well as (iii) to install the new routing policies at the required switches. IV. P ROBLEM F ORMULATION

A. Assumptions Following is a brief of assumptions we have made. 1) Pre-computed paths: We assume that for every sourcedestination pair (between ingress and egress nodes) within an ISP, we have a set of pre-computed candidate paths for the flows to choose. 2) Attack detection and attack pattern: We assume that a customer detects attacks, and has identified a pattern for matching flows of suspicious traffic. Note that, if the customer has identified a precise signature for attack flows, it might request for blocking service; otherwise, a pattern for suspicious flows will be generated, and the customer might then opt for either rate-limiting service or redirection service. Flows can be distinguished using the 5-tuple of source and destination IP addresses, source and destination ports, and protocol. 3) Genuine request authentication: We assume that the service provider can authenticate requests made by customers for attack mitigation. This implies that there is no possibility of customer’s requests themselves being fraudulent. This is practical, given that an ISP can uniquely identify its customers as well as peering ISPs. 4) Trusted intermediate routers or SDN controller: We assume that the network elements (switches and routers) and the SDN controller can be trusted. As mentioned earlier, we aim to provide the services of blocking, rate limiting and re-directing. When a customer suspects an attack, it requests the service provider for one or more of the three services. If the customer chooses to

A. Mathematical Notations Let G(V, E) denote the graph representing an ISP network topology, where V is set of nodes representing switches and E is set of edges denoting the links connecting these switches. The graph notations are defined below and Table I denotes the list of notations used in optimization formulation. • P is a set of paths available between an ingress switch of ISP and an egress switch where customer is connected • p is a path ∈ P • l is a link in path p, where p ∈ P • bp is the minimum residual bandwidth among all links l in path p ∈ P • ls and ld are source and destination nodes of link l, respectively B. Blocking Service When the customer detects it is under attack, and has the precise signatures required to block the attack traffic, it requests the service of completely blocking the traffic at the ingress switches of ISP. Since this is quite straightforward, it does not need a mathematical formulation. We discuss the more interesting aspects of services of rate limiting and redirecting in greater detail. C. Rate Limiting Service (RLS) Since ISP provides attack mitigation as a value added service, a revenue is collected by ISP in the event of limiting rate of suspicious flows as per customer’s demands.

TABLE I: Notations used for RLS and RD Notation F Fa Fn xf kf R dp

number of legitimate flows that are not disrupted by the rate limited anomalous flows allowed in network with flow rate rf . This can be given by

Meaning Set of flows f ⊂ F, denoting set of suspicious flows ⊂ F, denoting set of legitimate normal flows Rate of flow f at the ISP’s ingress Decision variable, indicating selection of flow f User demanded aggregate rate Decision variable, dp = 1 if path p is selected for routing

With SDN architecture, path changes demand new rules to be installed. This is particularly undesirable during a network attack, since it is the most vulnerable period for legitimate sessions to be disrupted. Thus, our objective is to minimize these disruptions caused by suspicious flows when the customer requests an aggregate rate R of suspicious traffic to be permitted. We define kf as a binary decision variable indicating flow f as selected when kf = 1. The selected flows are the ones that change paths subject to conditions stated below. 1) Objective function: The optimization is done in two stages. Every suspicious flow f that enters through the ingress node of ISP has a rate xf , and after it is permitted inside the network by ISP, it has a rate rf . Let α denote the cost incurred by the ISP in providing this service. Such a cost might be a function of the perturbation caused due to the changes in the rules. We leave the specific definition of the cost out of the scope of our work. We define a utility φ1 , which is maximized in the optimization formulation. Maximize φ1 = (xf − rf ).α

∀f ∈ Fa

(1)

∀f ∈ Fa

(2)

subject to the following constraints: min(xf ) P ∗ R < rf < x f f ∈Fa xf X

rf = R

(3)

f ∈Fa

The first stage assigns a rate for the rate-limited suspicious flows in order to satisfy the user defined aggregate rate (R) given in Constraint 3. To ensure fairness is retained while assigning rf for every flow f , ISP has a minimum traffic allowed per ingress switch which is proportional to the minimum incoming suspicious traffic rate rf . The second stage takes this calculated value of rf as input to the objective function φ2 , and assigns a path p for suspicious flows among P which has the least disruptions. Here N is the total number of legitimate flows active in the network at a particular time. The objective function maximizes the

Maximize φ2 = N −

X

∀p ∈ P

kf

(4)

p f ∈Fn

The objective function Equation (4) is subject to the constraints given as follows. X

kf .xf > rf

(5)

p

f ∈Fn

X

X

p∈P l∈p,ls =i

rf .dp −

X

X

rf .dp = 0

(6)

p∈P l∈p,ld =i

∀i ∈ V \ {s, d} Since ISP may not have enough bandwidth to accommodate rf on path p, it reroutes legitimate flows in order to accommodate rf . It is desirable to keep the disruptions as low as possible. ISP achieves this by selecting those legitimate flows whose flow-rates xf sum upto at least rf as given in Constraint 5. Then ISP reroutes these selected flows. For this, the binary variable kf = 1 when flow f is selected to be rerouted, and kf = 0 otherwise. The flow conservation constraint is followed by Constraint 6, which states that the amount of flows entering any node must be same as the amount leaving, except for ingress and egress nodes. D. Redirecting Service (RD) When the customer requests for the service of redirecting, ISP reroutes the suspicious flows to a scrubber. Since the rate of suspicious flow could be very high, it might not be possible to route the entire traffic to the scrubber. The customer requests a certain aggregate rate R to be routed to itself, and rest to be routed to scrubber for further analysis. While rerouting legitimate flows, it is undesirable to disrupt more than q ∗ N legitimate flows, where q is a fraction. This puts a limit on the total traffic that can be redirected to scrubber. 1) Objective function: The rate of suspicious traffic reaching customer from each ingress is yf . Therefore the maximum rate which can be redirected to scrubber is xf −yf from every ingress through which suspicious flows enter. In the event of redirection, we have two destinations— customer and scrubber. Our objective is to maximize the traffic redirected to scrubber, by disrupting a maximum of q ∗ N of legitimate flows. Let β be the cost incurred to ISP for providing this service; then the objective function is: X Maximizeψ = (xf − yf ).β (7) f ∈Fa

2) Constraints: Suspicious traffic directed to customer as destination is denoted as yf , and it follows a set of constraints similar to RLS. However, rerouting has another set of constraints, where the scrubber is at a different destination. min(xf ) P ∗ R < yf < x f f ∈Fa xf X

∀f ∈ Fa

yf = R

(8)

(9)

f ∈Fa

X

kf 6 q ∗ N

(10)

kf .xf > xf − yf

(11)

yf 6 bp

(12)

xf − yf 6 bp

(13)

p

f ∈Fn

X p

f ∈Fn

X p

f ∈Fa

X p

f ∈Fa

X

X

p∈P l∈p,ls =i

yf .dp −

X

X

yf .dp = 0

(14)

p∈P l∈p,ld =i

∀i ∈ V \ {s, d}

While routing traffic to customer, there are some legitimate flows which are rerouted on a different path. Similarly, while rerouting suspicious traffic to scrubber destination, legitimate flows might be affected. We set a constraint on the maximum number of total legitimate flows that can be rerouted. We set an upper bound of q ∗ N legitimate flows that can be disrupted, as shown in Constraint 10. However, the total rate of selected legitimate flow rates xf in path p should be at least equal to the redirected traffic rate to accommodate it as given by Constraint 11. When customer is the destination, the traffic reaching customer is the residual bandwidth of that path p given in Constraint 12. When scrubber is the destination, the maximum traffic redirected is the minimal residual bandwidth bp of that path after rerouting legitimate flows as indicated in Constraint 13. V. P ERFORMANCE E VALUATION A. Settings The evaluation is done in primarily three parts, i.e., flow generation, optimization, and analysis. We generate a fixed topology of V nodes and E edges. Each edge has a capacity associated with it, which is homogeneous for the entire network. We define certain nodes to be connected to customers. These customers could be client ISPs themselves or end-users. We generate legitimate flow requests from

ingress switches to egress switches, each request being defined by source, destination and flow-rate. We assign a flow to the network by randomly choosing a path p from a given set of paths P for every ingress to egress pair. Every time a flow is assigned to the network, we deduct the flow’s rate from all individual link’s capacity in chosen path p. The bandwidth of flows are assumed to be distributed exponentially. This accounts for the background legitimate ongoing sessions for customers. We introduce anomalous flow requests, again following Exponential distribution, but with mean bandwidth much higher than that of legitimate flows. These anomalous flows enter the ISP through the same ingress switches as the legitimate traffic. Similar to legitimate flows, anomalous flows have the same set of paths P to choose from and every path p has certain number of active legitimate flows. In the event of an attack, the customer requests a service to mitigate the attack.

B. Performance Study In our network, we choose a fixed topology with 34 nodes and 56 links connecting these nodes. For all cases, we set the maximum bandwidth of each link as 1000 units. For the demanded services RLS and RD, we generate the background legitimate traffic, the mean of the Exponential distribution is 2 units. None of the links in the network are completely exhausted with legitimate traffic. We conduct 10 experiments and plot the average values. During RLS, the legitimate flows that may be disrupted are rerouted through a new path dynamically due to mitigation. When the user defined aggregate rate R increases, ISP has more suspicious traffic to allow into network to serve customer. This causes an increase in the number of legitimate path disruptions in order to satisfy customer’s demand. We plot the number of legitimate flows changing paths as R increases in Fig. 1. When R is low, majority of the suspicious traffic is routed because of sufficient residual bandwidth in that path p, therefore there is no need of disrupting legitimate sessions. However, when R is high, the residual bandwidth is not sufficient for routing. In such a case, legitimate flows are disrupted to new paths in order to route suspicious flows. Thus we observe an increase in path changes of legitimate flows as R increases. In case of RD, there is a maximum limit on the total number of legitimate sessions changing paths, i.e., q = 0.1 according to Constraint 10, where q is the fraction which determines number of path changes. Since RD requires suspicious traffic to be redirected to scrubber also, a larger proportion of legitimate traffic is disrupted during mitigation as seen in Fig. 1. In Fig. 2, we observe that by rerouting legitimate flows, ISP is able to provide R. Whereas if the network does not adapt dynamically by changing paths, we observe that the traffic routed to customer is lesser than R. The difference between required rate R and traffic directed to customer

140

160

120

140

100 80

120

60

100

40 20

Rate Limiting Service Redirecting Service

150

200 250 300 350 User demanded aggregate (UDA)

80

400

Fig. 1: No. of legitimate flows changing path in case of RLS

Aggregate traffic reaching customer

600

R = 500 with no disruptions R = 300 with no disruptions R = 500 with disruptions

550 500 450

1600 1400 1200 1000 800 600 400 200 0

No disruption q = 0.1 q = 0.2

1.0

1.5

2.0

2.5 3.0 3.5 4.0 Mean of legitimate traffic

4.5

5.0

Fig. 3: Rate of suspicious traffic redirected to scrubber during RD

changing paths of legitimate flows allows for delivering of mitigation services as requested by customers. ACKNOWLEDGEMENT

400 350 300 250

Traffic redirected to scrubber

180

Number of legitimate flows disrupted for RD

Number of legitimate flows disrupted for RLS

160

88

89 90 91 92 93 Percentage of link bandwidth used by legitimate traffic

Fig. 2: Impact of dynamic path changes in RLS during mitigation increases as the bandwidth occupied by legitimate traffic increases. In the event of RD, Fig. 3 plots the amount of suspicious traffic rerouted when disruption of legitimate flows is not allowed, and when the maximum fraction of such disruptions are limited to 0.1 and 0.2. We observe that, overall an ISP can redirect less traffic to scrubber as compared to the cases when disruptions are allowed. VI. C ONCLUSION In this paper we leveraged on the capabilities and functionalities of SDN to enhance network security. We developed an SDN-based framework which provides attack mitigation as a service to ISP’s customers. The services of blocking, rate-limiting or redirecting the suspicious traffic flows are made available by ISP to customers. We developed optimization formulation with the aim of providing these mitigation services while minimizing the number disrupted legitimate flows during the mitigation process. This allows the network to adapt to attacks while still dynamically mitigating attacks. In our system, ISPs can decide on limiting the number disruptions allowed on normal legitimate flows. The simulation studies carried out demonstrated that dynamically

This research is supported by the National Research Foundation, Prime Minister’s Office, Singapore under its Corporate Laboratory@University Scheme, National University of Singapore, and Singapore Telecommunications Ltd. R EFERENCES [1] P. Paganini, “150,000 IoT devices behind the 1Tbps DDoS attack on OVH,” http://securityaffairs.co/wordpress/51726/cyber-crime/ovh-hitbotnet-iot.html. [2] M. M. et. al., “State of the Internet / Security Report,” Akamai Technologies, Tech. Rep., 2016. [3] S. Hilton, “Dyn Analysis Summary of DDoS,” http://dyn.com/blog/dyn-analysis-summary-of-friday-october-21attack/. [4] C. Dietzel, A. Feldmann, and T. King, “Blackholing at ixps: On the effectiveness of ddos mitigation in the wild,” in 17th Int’l Conf. on Passive and Active Measurement (PAM 2016), 2016, pp. 319–332. [5] H. Wang, L. Xu, and G. Gu, “Floodguard: A DoS attack prevention extension in software-defined networks,” in 2015 45th Annual IEEE/IFIP Int’l Con. on Dependable Sys. and Netw., 2015, pp. 239– 250. [6] Z. Liu, H. Jin, Y.-C. Hu, and M. Bailey, “Middlepolice: Toward enforcing destination-defined policies in the middle of the internet,” in Proc. ACM CCS, 2016, pp. 1268–1279. [7] S. K. Fayaz, Y. Tobioka, V. Sekar, and M. Bailey, “Bohatei: Flexible and Elastic DDoS Defense,” in Proceedings of the 24th USENIX Conference on Security Symposium, ser. SEC’15, 2015, pp. 817–832. [8] “Cloudfare: DDoS protection,” https://www.cloudflare.com/ddos/. [9] T. Vissers, T. Van Goethem, W. Joosen, and N. Nikiforakis, “Maneuvering around clouds: Bypassing cloud-based security providers,” in Proc. ACM CCS, 2015, pp. 1530–1541. [10] C. Buragohain and N. Medhi, “FlowTrApp: An SDN based architecture for DDoS attack detection and mitigation in data centers,” in 2016 3rd International Conference on Signal Processing and Integrated Networks (SPIN), Feb 2016, pp. 519–524. [11] Q. Yan, Q. Gong, and F. R. Yu, “Effective software-defined networking controller scheduling method to mitigate DDoS attacks,” Electronics Letters, vol. 53, no. 7, pp. 469–471, 2017.

Dynamic Attack Mitigation using SDN

Abstract—Security threats in the Internet have been ever increasing, in number, type and means used for attacks. In the face of large-scale attacks, such as DDoS attacks, networks take unacceptable time to respond and mitigate the attacks, resulting in disruption to connections and the losses due to it. In this work, we look ...

303KB Sizes 2 Downloads 276 Views

Recommend Documents

Host based Attack Detection using System Calls
Apr 3, 2012 - This calls for better host based intrusion detection[1]. ... Intrusion detection is the process of monitoring the events occurring in a ... System Call in Linux ... Rootkits[2] are a set of software tools used by an attacker to gain.

Beyond attack trees: dynamic security modeling with ...
ownership of a Remote Access Server (RAS) connected to a dial-in modem. ..... small dedicated Petri net as shown in part (b) of. Fig. 6. This small Petri net can ...

Enhanced Dynamic Detection of Code Injection Attack in OS ... - IJRIT
Security vulnerabilities in software have been a significant problem for the computer industry for decades. ... The malware detection system monitors data from a suite of .... us to detect and prevent a wide range of threats, including “zero-day”

Enhanced Dynamic Detection of Code Injection Attack in OS ... - IJRIT
At runtime, a monitor compares the behavior of the variants at certain ... The global decision is made by a data fusion center, ... complete solution. Modern static ...

Interference Mitigation Using Uplink Power Control for ...
Oct 27, 2009 - J. Moon is with the Telecommunication R&D Center, Samsung Electronics,. Suwon, Gyeonggi, Korea 442-742 (e-mail: [email protected]). This work was supported by Samsung Electronics. ... Outdoor-to-indoor link (macrocell user → femt

Exploratory PerFormance Evaluation using dynamic ...
plete 'active' sub-models that serve, e.g., as embedded strategies that control the .... faces, their signature, and that these interfaces behave as described above ...

Coexistence Mechanism Using Dynamic Fragmentation ...
what proposed in [9] requires too much complexity to obtain the optimal solution ..... PDA is connected to a laptop via Wi-Fi at rate 11Mbps, and concurrently a ...

Dynamic Treatment Regimes using Reinforcement ...
Fifth Benelux Bioinformatics Conference, Liège, 1415 December 2009. Dynamic ... clinicians often adopt what we call Dynamic Treatment Regimes (DTRs).

Automatic speaker recognition using dynamic Bayesian network ...
This paper presents a novel approach to automatic speaker recognition using dynamic Bayesian network (DBN). DBNs have a precise and well-understand ...

Opportunistic Interference Mitigation
user interference channel with time-varying channel coeffi- cients. Since then, interference management schemes based on IA have been further developed and analyzed in various wireless network environments: multiple-input multiple-output. (MIMO) inte

Rogue Access Point Detection and Counter Attack Using Internet Proxy
3. Host policies and rules are stored in the MYSQL database on proxy server. 4. Proxy will check the host policy and process the request accordingly. 5. User gets the internet access if he is an authorized user otherwise gets the error message. 6. Pr

Dynamic Treatment Regimes using Reinforcement ...
Dec 15, 2009 - Raphael Fonteneau, Susan Murphy, Louis Wehenkel, Damien Ernst. University of Liège, University of Michigan. The treatment of chroniclike illnesses such has HIV infection, cancer or chronic depression implies longlasting treatments that

Rogue Access Point Detection and Counter Attack Using Internet Proxy
www.ijrit.com. ISSN 2001-5569. Rogue Access Point Detection and Counter Attack. Using Internet Proxy. Miss. Gaikwad Jyoti, Miss. Mandhare Ashvini, Miss.

Opportunistic Interference Mitigation
Then, their performance is analyzed in terms of degrees- of-freedom (DoFs). ..... For user j in the i-th cell, the user scheduling metric Li j is finally given by (2), ...

NET 3.5 - Pollution Attack: A New Attack Against ...
may be obtained from 1-hop beacons by receiving the location of beacon and measuring the distance between them (e.g., through measuring received signal strength indicator (RSSI). [14] or time difference of arrival (TDoA) [15]), also may be obtained f

Amazing Adwords Attack-www.InstantStressManagement.com.pdf ...
Amazing Adwords Attack-www.InstantStressManagement.com.pdf. Amazing Adwords Attack-www.InstantStressManagement.com.pdf. Open. Extract. Open with.

SDN
S4. 1. 2. 3. 0. The 'before' configuration. 1. Controller updates S. 1 . 2. Controller updates S. 2 . 3. Controller updates S. 3 . Sequential update approaches:.

Mitigation Engineering – The CFG Story - GitHub
X86 Stack Misbalancing & Generic Stack Address Leaks. • Mitigated by CET. Read-Only Memory Attacks. • Certain regions must be permanently read-only and not unmappable. Broker decides when it is safe to allow unmap. • Operations that require wri

Fred Reinfeld Attack And counter attack in chess.Pdf
desarrollando diferentes proyectos e ideas. Tenemos miembros .... Pdf. Fred Reinfeld Attack And counter attack in chess.Pdf. Open. Extract. Open with. Sign In.

optimal binary search tree using dynamic programming pdf ...
Sign in. Loading… Whoops! There was a problem loading more pages. Retrying... Whoops! There was a problem previewing this document. Retrying.

Dynamic Software Product Line Architectures Using ...
are developed in a two-stage process, i.e. domain en- gineering and a ... set of interacting ports and a set of meaningful usage scenarios. These usage ...

Correcting the Dynamic Call Graph Using Control Flow ...
Complexity of large object oriented programs. ❑ Decompose the program into small methods ... FDOM (Frequency dominator) correction. ○. Static approach. ○. Uses static FDOM constraint on DCG. ❑. Dynamic basic block profile correction. ○. Dyn