東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Modeling, analysis and defense strat...

Kim, Jonghyun.

Linked to FindBook

Google Book

Amazon

博客來

Modeling, analysis and defense strategies against Internet attacks.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Modeling, analysis and defense strategies against Internet attacks./
Author:	Kim, Jonghyun.
Description:	141 p.
Notes:	Source: Dissertation Abstracts International, Volume: 66-01, Section: B, page: 0365.
Contained By:	Dissertation Abstracts International66-01B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3161634
ISBN:	9780496955060

Modeling, analysis and defense strategies against Internet attacks.
Kim, Jonghyun.

Modeling, analysis and defense strategies against Internet attacks. - 141 p.

Source: Dissertation Abstracts International, Volume: 66-01, Section: B, page: 0365.

Thesis (Ph.D.)--The University of Oklahoma, 2005.

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.

ISBN: 9780496955060Subjects--Topical Terms:

626642
Computer Science.

Modeling, analysis and defense strategies against Internet attacks.
LDR:03110nmm 2200313 4500 001 1822392
005 20061129132702.5
008 130610s2005 eng d
020 $a 9780496955060
035 $a (UnM)AAI3161634
035 $a AAI3161634
040 $a UnM $c UnM
100 1 $a Kim, Jonghyun. $3 1911538
245 1 0 $a Modeling, analysis and defense strategies against Internet attacks.
300 $a 141 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-01, Section: B, page: 0365.
500 $a Advisers: Sridhar Radhakrishnan; Sudarshan Dhall.
502 $a Thesis (Ph.D.)--The University of Oklahoma, 2005.
520 $a 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.
520 $a 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.
520 $a 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.
520 $a 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.
590 $a School code: 0169.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a The University of Oklahoma. $3 1021915
773 0 $t Dissertation Abstracts International $g 66-01B.
790 1 0 $a Radhakrishnan, Sridhar, $e advisor
790 1 0 $a Dhall, Sudarshan, $e advisor
790 $a 0169
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3161634