An Efficient Method for Optimal Probe Deployment of Distributed IDS
Summary :
A distributed network-oriented Intrusion Detection System (IDS) is a mechanism which detects misuse accesses to an intra-network by distributed IDSs on the network with decomposed attack scenarios. However, there are only ad hoc algorithms for determining a deployment of distributed IDSs and a partition of the attack scenarios. In this paper, we formally define this problem as the IDS partition deployment problem and design an efficient algorithm for a simplified version of the problem by graph theoretical techniques.
- Publication
- IEICE TRANSACTIONS on Information Vol.E88-D No.8 pp.1948-1957
- Publication Date
- 2005/08/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietisy/e88-d.8.1948
- Type of Manuscript
- PAPER
- Category
- Dependable Computing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jing WANG, Naoya NITTA, Hiroyuki SEKI, "An Efficient Method for Optimal Probe Deployment of Distributed IDS" in IEICE TRANSACTIONS on Information,
vol. E88-D, no. 8, pp. 1948-1957, August 2005, doi: 10.1093/ietisy/e88-d.8.1948.
Abstract: A distributed network-oriented Intrusion Detection System (IDS) is a mechanism which detects misuse accesses to an intra-network by distributed IDSs on the network with decomposed attack scenarios. However, there are only ad hoc algorithms for determining a deployment of distributed IDSs and a partition of the attack scenarios. In this paper, we formally define this problem as the IDS partition deployment problem and design an efficient algorithm for a simplified version of the problem by graph theoretical techniques.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e88-d.8.1948/_p
Copy
@ARTICLE{e88-d_8_1948,
author={Jing WANG, Naoya NITTA, Hiroyuki SEKI, },
journal={IEICE TRANSACTIONS on Information},
title={An Efficient Method for Optimal Probe Deployment of Distributed IDS},
year={2005},
volume={E88-D},
number={8},
pages={1948-1957},
abstract={A distributed network-oriented Intrusion Detection System (IDS) is a mechanism which detects misuse accesses to an intra-network by distributed IDSs on the network with decomposed attack scenarios. However, there are only ad hoc algorithms for determining a deployment of distributed IDSs and a partition of the attack scenarios. In this paper, we formally define this problem as the IDS partition deployment problem and design an efficient algorithm for a simplified version of the problem by graph theoretical techniques.},
keywords={},
doi={10.1093/ietisy/e88-d.8.1948},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - An Efficient Method for Optimal Probe Deployment of Distributed IDS
T2 - IEICE TRANSACTIONS on Information
SP - 1948
EP - 1957
AU - Jing WANG
AU - Naoya NITTA
AU - Hiroyuki SEKI
PY - 2005
DO - 10.1093/ietisy/e88-d.8.1948
JO - IEICE TRANSACTIONS on Information
SN -
VL - E88-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 2005
AB - A distributed network-oriented Intrusion Detection System (IDS) is a mechanism which detects misuse accesses to an intra-network by distributed IDSs on the network with decomposed attack scenarios. However, there are only ad hoc algorithms for determining a deployment of distributed IDSs and a partition of the attack scenarios. In this paper, we formally define this problem as the IDS partition deployment problem and design an efficient algorithm for a simplified version of the problem by graph theoretical techniques.
ER -
English
