DocumentCode
775283
Title
Detecting Threats in Star Graphs
Author
Imani, Navid ; Sarbazi-Azad, Hamid ; Zomaya, Albert Y. ; Moinzadeh, Parya
Author_Institution
Simon Fraser Univ., Vancouver, BC
Volume
20
Issue
4
fYear
2009
fDate
4/1/2009 12:00:00 AM
Firstpage
474
Lastpage
483
Abstract
In this paper, we consider the problem of searching a network for intruders. We propose a strategy for capturing the intruder in the popular interconnection topology, the star network. According to the proposed strategy, a team of collaborative software agents are responsible for capturing a hostile intruder (e.g. a virus). These agents asynchronously move along the network links and the intruder has the capability of escaping arbitrarily fast.
Keywords
graph theory; groupware; parallel processing; search problems; security of data; software agents; collaborative software agent; graph theoretical property; intrusion detection; parallel processing; search problem; star graph; star interconnection network topology; threat detection; Folded star graph; Graph searching.; Intrusion capturing; Network Security; Spanning tree; Star interconnection network;
fLanguage
English
Journal_Title
Parallel and Distributed Systems, IEEE Transactions on
Publisher
ieee
ISSN
1045-9219
Type
jour
DOI
10.1109/TPDS.2008.108
Filename
4553703
Link To Document