NANO SCIENTIFIC RESEARCH CENTRE PVT.LTD., AMEERPET, HYD
WWW.NSRCNANO.COM, 09640648777, 09652926926
JAVA PROJECTS LIST--2013
JAVA 2013 IEEE PAPERS
Optimal Source-Based Filtering of Malicious Traffic
Abstract:
In
this paper, we consider the problem of blocking malicious traffic on the
Internet via source-based filtering. In particular, we consider filtering via
access control lists (ACLs): These are already available at the routers today,
but are a scarce resource because they are stored in the expensive ternary
content addressable memory (TCAM). Aggregation (by filtering source prefixes
instead of individual IP addresses) helps reduce the number of filters, but
comes also at the cost of blocking legitimate traffic originating from the
filtered prefixes. We show how to optimally choose which source prefixes to
filter for a variety of realistic attack scenarios and operators’ policies. In
each scenario, we design optimal, yet computationally efficient, algorithms.
Using logs from Dshield.org, we evaluate the algorithms and demonstrate that
they bring significant benefit in practice.
Existing
System:
Protecting
a victim (host or network) from malicious traffic is a hard problem that
requires the coordination of several complementary components, including
nontechnical (e.g., business and legal) and technical solutions (at the
application and/or network level). Filtering support from the network is a fundamental
building block in this effort. For example, an Internet service provider (ISP)
may use filtering in response to an ongoing DDoS attack to block the DDoS
traffic before it reaches its clients. Another ISP may want to proactively
identify and block traffic carrying malicious code before it reaches and
compromises vulnerable hosts in the first place. In either case, filtering is a
necessary operation that must be performed within the network.
Filtering capabilities are already
available at routers today via access control lists (ACLs). ACLs enable a
router to match a packet header against predefined rules and take predefined
actions on the matching packets [1], and they are currently used for enforcing
a variety of policies, including infrastructure protection [2]. For the purpose
of blocking malicious traffic, a filter is a simple ACL rule that denies access
to a source IP address or prefix. To keep up with the high forwarding rates of
modern routers, filtering is implemented in hardware: ACLs are typically stored
in ternary content addressable memory (TCAM), which allows for parallel access
and reduces the number of lookups per forwarded packet.
Proposed System:
In
this paper, we formulate a general framework for studying source prefix
filtering as a resource allocation problem. To the best of our knowledge,
optimal filter selection has not been explored so far, as most related work on
filtering has focused on protocol and architectural aspects. Within this
framework, we formulate and solve five practical source-address filtering
problems, depending on the attack scenario and the operator’s policy and
constraints. Our contributions are twofold. On the theoretical side, filter
selection optimization leads to novel variations of the multidimensional knapsack
problem. We exploit the special structure of each problem and design optimal
and computationally efficient algorithms. On the practical side, we provide a
set of cost-efficient algorithms that can be used both by operators to block
undesired traffic and by router manufacturers to optimize the use of TCAM and
eventually the cost of routers.
Software Requirement Specification
Software
Specification
Operating System : Windows XP
Technology : JAVA
Database : SQL Server 2005
Hardware
Specification
Processor : Pentium
IV
RAM : 512 MB
Hard Disk : 80GB
Modules:
- Nodes Creation
- Nodes Connection
- Transferring Data
- Packet Validation
No comments:
Post a Comment