Subscribe

Issue No.04 - April (2009 vol.20)

pp: 474-483

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

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.

INDEX TERMS

Star interconnection network, Network Security, Intrusion capturing, Folded star graph, Spanning tree, Graph searching.

CITATION

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.108REFERENCES

- [2] B. Alspach,
Searching and Sweeping Graphs: A Brief Survey, http://www.dmi.unict.it/combinatorics04/ documenti%20pdfalspach.pdf, Sept. 2004.- [3] L. Barrière, P. Flocchini, P. Fraignaud, and N. Santoro, “Capture of an Intruder by Mobile Agents,”
Proc. 14th ACM Symp. Parallel Algorithms and Architectures (SPAA '02), pp. 200-209, 2002.- [4] L. Barrière, P. Fraignaud, N. Santoro, and D.M. Thilikos, “Searching Is Not Jumping,”
Proc. 29th Workshop Graph Theoretic Concepts in Computer Science (WG '03), pp. 34-45, 2003.- [7] M. Demirbas, A. Arora, and M. Gouda, “A Pursuer-Evader Game for Sensor Networks,”
Proc. Sixth Symp. Self-Stabilizing Systems (SSS '03), pp. 1-16, June 2003.- [10] P. Flocchini, F.L. Luccio, and L. Song, “Size Optimal Strategies for Capturing an Intruder in Mesh Networks,”
Proc. Int'l Conf. Comm. in Computing (CIC '05), pp. 200-206, 2005.- [11] P. Flocchini, F.L. Luccio, and L. Song, “Decontamination of Chordal Rings and Tori,”
Proc. Eighth Workshop Advances in Parallel and Distributed Computational Models (APDCM), 2006.- [13] N. Imani, H. Sarbazi-Azad, and A.Y. Zomaya, “Capturing an Intruder in Product Networks,”
Proc. 13th Int'l Conf. High Performance Computing (HiPC '06), pp. 193-204, Dec. 2006.- [16] T.K. Li, J.J.M. Tan, and L.H. Hsu, “Hyper Hamiltonian Laceability on Edge Fault Star Graph,”
Information Sciences: An Int'l J., vol. 165, nos. 1-2, pp. 59-71, 2004.- [17] S. Myagmar, A. Lee, and W. Yurcik, “Threat Modeling as a Basis for Security Requirements,”
Proc. Symp. Requirements Eng. for Information Security (SREIS '05), Aug. 2005.- [18] N. Megiddo, S. Hakimi, M. Garey, D. Johnson, and C. Papadimitriou, “The Complexity of Searching a Graph,”
J.ACM, vol. 35, pp.18-44, 1988.- [20] T. Parson, “Pursuit-Evasion Problem on a Graph,”
Theory and Applications in Graphs, pp. 426-441, Springer, 1976.- [21] T. Parson, “The Search Number of a Connected Graph,”
Proc. Ninth Southeastern Conf. Combinatorics, Graph Theory and Computing, pp. 549-554, 1978.- [22] S. Peng, M. Ko, C. Ho, T. Hsu, and C. Tang, “Graph Searching on Chordal Graphs,”
Algorithmica, vol. 27, pp. 395-426, 2000.- [23] S. Ranka, J. Wang, and N. Yeh,
Embedding Meshes on the Star Graph. pp. 476-485, CS Press, 1990.- [25] P. Shareghi, N. Imani, and H. Sarbazi-Azad, “Capturing an Intruder in the Pyramid,”
Proc. Int'l Computer Science Symp. in Russia (CSR '06), pp. 580-590, 2006.- [28] P. Yospanya, B. Laekhanukit, D. Nanongkai, and J. Fakcharoenphol, “Detecting and Cleaning Intruders in Sensor Networks,”
Proc. Eighth Nat'l Computer Science and Eng. Conf. (NCSEC), 2004. |