DocumentCode :
2282538
Title :
A highly scalable model for network attack identification and path prediction
Author :
Nanda, Sanjeeb ; Deo, Narsingh
Author_Institution :
Sch. of Comput. Sci., Central Florida Univ., Orlando, FL
fYear :
2007
fDate :
22-25 March 2007
Firstpage :
663
Lastpage :
668
Abstract :
The rapid growth of the Internet has triggered an explosion in the number of networked applications that leverage its capabilities. Unfortunately, many of them are intentionally designed to burden or destroy the capabilities of their peers and the supporting network infrastructure. Hence, considerable effort has been focused on detecting and predicting the breaches in security propagated by these malicious applications. However, the enormity of the Internet poses a formidable challenge to representing and analyzing such attacks on it using scalable models. Furthermore, the unavailability of complete information on network vulnerabilities makes the task of forecasting the systems that are likely to be exploited by such applications in the future even harder. This paper presents a technique to identify attacks on large networks using a highly scalable model, while filtering for false positives and negatives. It also forecasts the propagation of the security failures proliferated by attacks over time and their likely targets in the future.
Keywords :
Internet; graph theory; telecommunication security; Internet; malicious applications; network attack identification; network infrastructure; network vulnerabilities; path prediction; security failure propagation; Application software; Computer science; Computer worms; Explosions; IP networks; Information security; Intrusion detection; Payloads; Predictive models; Visualization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
SoutheastCon, 2007. Proceedings. IEEE
Conference_Location :
Richmond, VA
Print_ISBN :
1-4244-1029-0
Electronic_ISBN :
1-4244-1029-0
Type :
conf
DOI :
10.1109/SECON.2007.342984
Filename :
4147514
Link To Document :
بازگشت