Modeling, analysis and defense strategies against Internet attacks.
| dc.contributor.advisor | Dhall, Sudarshan, | en_US |
| dc.contributor.advisor | Radhakrishnan, Sridhar, | en_US |
| dc.contributor.author | Kim, Jonghyun. | en_US |
| dc.date.accessioned | 2013-08-16T12:19:37Z | |
| dc.date.available | 2013-08-16T12:19:37Z | |
| dc.date.issued | 2005 | en_US |
| dc.description.abstract | Third, we have analyzed the tradeoff between delay caused by filtering of worms at routers, and the delay due to worms' excessive amount of network traffic. We have used the optimal control problem, to determine the appropriate tradeoffs between these two delays for a given rate of a worm spreading. Using our technique we can minimize the overall network delay by finding the number of routers that should perform filtering and the time at which they should start the filtering process. | en_US |
| dc.description.abstract | Many early Internet protocols were designed without a fundamentally secure infrastructure and hence vulnerable to attacks such as denial of service (DoS) attacks and worms. DoS attacks attempt to consume the resources of a remote host or network, thereby denying or degrading service to legitimate users. Network forensics is an emerging area wherein the source or the cause of the attacker is determined using IDS tools. The problem of finding the source(s) of attack(s) is called the "trace back problem". Lately, Internet worms have become a major problem for the security of computer networks, causing considerable amount of resources and time to be spent recovering from the disruption of systems. In addition to breaking down victims, these worms create large amounts of unnecessary network data traffic that results in network congestion, thereby affecting the entire network. | en_US |
| dc.description.abstract | In this dissertation, first we solve the trace back problem more efficiently in terms of the number of routers needed to complete the track back. We provide an efficient algorithm to decompose a network into connected components and construct a terminal network. We show that for a terminal network with n routers, the trace back can be completed in O(log n) steps. | en_US |
| dc.description.abstract | Second, we apply two classical epidemic SIS and SIR models to study the spread of Internet Worm. The analytical models that we provide are useful in determining the rate of spread and time required to infect a majority of the nodes in the network. Our simulation results on large Internet like topologies show that in a fairly small amount of time, 80% of the network nodes is infected. | en_US |
| dc.format.extent | xv, 126 leaves : | en_US |
| dc.identifier.uri | http://hdl.handle.net/11244/828 | |
| dc.note | Advisers: Sridhar Radhakrishnan; Sudarshan Dhall. | en_US |
| dc.note | Source: Dissertation Abstracts International, Volume: 66-01, Section: B, page: 0365. | en_US |
| dc.subject | Internet. | en_US |
| dc.subject | Computer security. | en_US |
| dc.subject | Control theory. | en_US |
| dc.subject | Computer networks Security measures. | en_US |
| dc.subject | Computer Science. | en_US |
| dc.thesis.degree | Ph.D. | en_US |
| dc.thesis.degreeDiscipline | School of Computer Science | en_US |
| dc.title | Modeling, analysis and defense strategies against Internet attacks. | en_US |
| dc.type | Thesis | en_US |
| ou.group | College of Engineering::School of Computer Science | |
| ou.identifier | (UMI)AAI3161634 | en_US |
Files
Original bundle
1 - 1 of 1