The PBL Method: A Novel Parallel Error Detection Method for Intrusion Tolerance Systems

Li Qinghua and Zhao Feng

Journal of Computer Research and Development > 2006 > 43(8): 1411-1416.

Li Qinghua and Zhao Feng. The PBL Method: A Novel Parallel Error Detection Method for Intrusion Tolerance Systems[J]. Journal of Computer Research and Development, 2006, 43(8): 1411-1416.

Citation:

Li Qinghua and Zhao Feng. The PBL Method: A Novel Parallel Error Detection Method for Intrusion Tolerance Systems[J]. Journal of Computer Research and Development, 2006, 43(8): 1411-1416.

Citation:

Li Qinghua and Zhao Feng. The PBL Method: A Novel Parallel Error Detection Method for Intrusion Tolerance Systems[J]. Journal of Computer Research and Development, 2006, 43(8): 1411-1416.

PDF (684 KB)

The PBL Method: A Novel Parallel Error Detection Method for Intrusion Tolerance Systems

Li Qinghua and Zhao Feng

(School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074) (National High Performance Computing Center (Wuhan), Wuhan 430074)

More Information

Published Date: August 14, 2006

Graphical Abstract

Abstract

Abstract

One of the most advanced research problems in intrusion tolerance systems (ITS) is error detection, which has become another essential technique in system security to prevent the intrusion from generating a system failure. A parallel error detection method named PBL for ITS, which is based on distributed Bayesian learning, is proposed in this paper. This method is particularly suitable for detecting errors with distributed sources. The PBL method not only is useful in detecting errors in the distributed network environment, but also can be used to enhance noise tolerant ability of ITS. Some key problems of the PBL method in detail are also discussed.
- intrusion tolerance,
- error detection,
- parallel,
- system security

FullText(HTML)

References (0)

[1]	Sun Hao, Han Zhongyi, Wang Fan, Yin Yilong. Backward Pseudo-Label and Optimal Transport for Unsupervised Domain Adaptation[J]. Journal of Computer Research and Development, 2023, 60(8): 1696-1710. DOI: 10.7544/issn1000-1239.202330163
[2]	Zhu Hongrui, Yuan Guojun, Yao Chengji, Tan Guangming, Wang Zhan, Hu Zhongzhe, Zhang Xiaoyang, An Xuejun. Survey on Network of Distributed Deep Learning Training[J]. Journal of Computer Research and Development, 2021, 58(1): 98-115. DOI: 10.7544/issn1000-1239.2021.20190881
[3]	Liu Hui, Xu Jinlong, Zhao Rongcai, Yao Jinyang. Compiler Optimization Sequence Selection Method Based on Learning Model[J]. Journal of Computer Research and Development, 2019, 56(9): 2012-2026. DOI: 10.7544/issn1000-1239.2019.20180789
[4]	Hai Mo, Zhu Jianming. A Propagation Mechanism Combining an Optimal Propagation Path and Incentive in Blockchain Networks[J]. Journal of Computer Research and Development, 2019, 56(6): 1205-1218. DOI: 10.7544/issn1000-1239.2019.20180419
[5]	Liu Song, Wu Weiguo, Zhao Bo, Jiang Qing. Loop Tiling for Optimization of Locality and Parallelism[J]. Journal of Computer Research and Development, 2015, 52(5): 1160-1176. DOI: 10.7544/issn1000-1239.2015.20131387
[6]	Zhang Zhuhong, Tao Juan. Micro-Immune Optimization Approach Solving Nonlinear Interval Number Programming[J]. Journal of Computer Research and Development, 2014, 51(12): 2633-2643. DOI: 10.7544/issn1000-1239.2014.20131091
[7]	Zhou Anfu, Liu Min, and Li Zhongcheng. Study on Optimal Packet Dispersion Strategy[J]. Journal of Computer Research and Development, 2009, 46(4): 541-548.
[8]	Liu Chun'an, Wang Yuping. Dynamic Multi-Objective Optimization Evolutionary Algorithm Based on New Model[J]. Journal of Computer Research and Development, 2008, 45(4): 603-611.
[9]	Yu Kun, Wu Guoxin, Xu Libo, Wu Peng. Optimal Path Based Geographic Routing in Ad Hoc Networks[J]. Journal of Computer Research and Development, 2007, 44(12): 2004-2011.
[10]	Ma Ming, Zhou Chunguang, Zhang Libiao, Ma Jie. Fuzzy Neural Network Optimization by a Multi-Objective Particle Swarm Optimization Algorithm[J]. Journal of Computer Research and Development, 2006, 43(12): 2104-2109.