Issue No.04 - April (2009 vol.20)
Navid Imani , Simon Frasier University, Vancouver
Hamid Sarbazi-Azad , Sharif University of Technology and IPM, Tehran
Albert Y. Zomaya , The University of Sydney, Sydney
Parya Moinzadeh , Sharif University of Technology and IPM, Tehran
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.108
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.
Star interconnection network, Network Security, Intrusion capturing, Folded star graph, Spanning tree, Graph searching.
Navid Imani, Hamid Sarbazi-Azad, Albert Y. Zomaya, Parya Moinzadeh, "Detecting Threats in Star Graphs", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 4, pp. 474-483, April 2009, doi:10.1109/TPDS.2008.108