We present new results on a distributable change-detection method inspired by the natural immune system. A weakness in the original algorithm was the exponential cost of generating detectors. Two detector-generating algorithms are introduced which run in linear time. The algorithms are analyzed, heuristics are given for setting parameters based on the analysis, and the presence of holes in detector space is examined. The analysis provides a basis for assessing the practicality of the algorithms in specific settings, and some of the implications are discussed.
|Original language||English (US)|
|Number of pages||10|
|Journal||Proceedings of the IEEE Computer Society Symposium on Research in Security and Privacy|
|State||Published - Jan 1 1996|
|Event||Proceedings of the 1996 17th IEEE Symposium on Security and Privacy - Oakland, CA, USA|
Duration: May 6 1996 → May 8 1996
ASJC Scopus subject areas