Detecting Threats in Star Graphs

Authors:
Navid Imani;Hamid Sarbazi-Azad;Albert Y. Zomaya;Parya Moinzadeh
Affiliations:
Simon Frasier University, Vancouver;Sharif University of Technology and IPM, Tehran;The University of Sydney, Sydney;Sharif University of Technology and IPM, Tehran
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2009

Citing 0
Cited 2

The triangular pyramid: Routing and topological properties

Information Sciences: an International Journal
Properties of a hierarchical network based on the star graph

Information Sciences: an International Journal

Quantified Score

Hi-index	0.01

Visualization

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.