Optimum identification of worm-infected hosts

Noriaki Kamiyama, Tatsuya Mori, Ryoichi Kawahara, Shigeaki Harada

研究成果: Conference contribution

抄録

The authors have proposed a method of identifying superspreaders by flow sampling and a method of extracting worm-infected hosts from the identified superspreaders using a white list. However, the problem of how to optimally set parameters, φ, the measurement period length, m *, the identification threshold of the flow count m within φ, and H *, the identification probability for hosts with m∈=∈m *, remains unsolved. These three parameters seriously affect the worm-spreading property. In this paper, we propose a method of optimally designing these three parameters to satisfy the condition that the ratio of the number of active worm-infected hosts divided by the number of all the vulnerable hosts is bound by a given upper-limit during the time T required to develop a patch or an anti-worm vaccine.

元の言語English
ホスト出版物のタイトルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ページ103-116
ページ数14
5275 LNCS
DOI
出版物ステータスPublished - 2008
外部発表Yes
イベント8th IEEE International Workshop on IP Operations and Management, IPOM 2008 - Samos Island
継続期間: 2008 9 222008 9 26

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5275 LNCS
ISSN(印刷物)03029743
ISSN(電子版)16113349

Other

Other8th IEEE International Workshop on IP Operations and Management, IPOM 2008
Samos Island
期間08/9/2208/9/26

Fingerprint

Vaccines
Worm
Sampling
Vaccine
Patch
Count

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

これを引用

Kamiyama, N., Mori, T., Kawahara, R., & Harada, S. (2008). Optimum identification of worm-infected hosts. : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (巻 5275 LNCS, pp. 103-116). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5275 LNCS). https://doi.org/10.1007/978-3-540-87357-0_9

Optimum identification of worm-infected hosts. / Kamiyama, Noriaki; Mori, Tatsuya; Kawahara, Ryoichi; Harada, Shigeaki.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 巻 5275 LNCS 2008. p. 103-116 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 5275 LNCS).

研究成果: Conference contribution

Kamiyama, N, Mori, T, Kawahara, R & Harada, S 2008, Optimum identification of worm-infected hosts. : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 巻. 5275 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 5275 LNCS, pp. 103-116, 8th IEEE International Workshop on IP Operations and Management, IPOM 2008, Samos Island, 08/9/22. https://doi.org/10.1007/978-3-540-87357-0_9
Kamiyama N, Mori T, Kawahara R, Harada S. Optimum identification of worm-infected hosts. : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 巻 5275 LNCS. 2008. p. 103-116. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-87357-0_9
Kamiyama, Noriaki ; Mori, Tatsuya ; Kawahara, Ryoichi ; Harada, Shigeaki. / Optimum identification of worm-infected hosts. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 巻 5275 LNCS 2008. pp. 103-116 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{e39ae1c8c5ec44378dafcffb99e5e4c3,
title = "Optimum identification of worm-infected hosts",
abstract = "The authors have proposed a method of identifying superspreaders by flow sampling and a method of extracting worm-infected hosts from the identified superspreaders using a white list. However, the problem of how to optimally set parameters, φ, the measurement period length, m *, the identification threshold of the flow count m within φ, and H *, the identification probability for hosts with m∈=∈m *, remains unsolved. These three parameters seriously affect the worm-spreading property. In this paper, we propose a method of optimally designing these three parameters to satisfy the condition that the ratio of the number of active worm-infected hosts divided by the number of all the vulnerable hosts is bound by a given upper-limit during the time T required to develop a patch or an anti-worm vaccine.",
keywords = "Detection, Optimum design, Sampling, Worm",
author = "Noriaki Kamiyama and Tatsuya Mori and Ryoichi Kawahara and Shigeaki Harada",
year = "2008",
doi = "10.1007/978-3-540-87357-0_9",
language = "English",
isbn = "3540873562",
volume = "5275 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "103--116",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Optimum identification of worm-infected hosts

AU - Kamiyama, Noriaki

AU - Mori, Tatsuya

AU - Kawahara, Ryoichi

AU - Harada, Shigeaki

PY - 2008

Y1 - 2008

N2 - The authors have proposed a method of identifying superspreaders by flow sampling and a method of extracting worm-infected hosts from the identified superspreaders using a white list. However, the problem of how to optimally set parameters, φ, the measurement period length, m *, the identification threshold of the flow count m within φ, and H *, the identification probability for hosts with m∈=∈m *, remains unsolved. These three parameters seriously affect the worm-spreading property. In this paper, we propose a method of optimally designing these three parameters to satisfy the condition that the ratio of the number of active worm-infected hosts divided by the number of all the vulnerable hosts is bound by a given upper-limit during the time T required to develop a patch or an anti-worm vaccine.

AB - The authors have proposed a method of identifying superspreaders by flow sampling and a method of extracting worm-infected hosts from the identified superspreaders using a white list. However, the problem of how to optimally set parameters, φ, the measurement period length, m *, the identification threshold of the flow count m within φ, and H *, the identification probability for hosts with m∈=∈m *, remains unsolved. These three parameters seriously affect the worm-spreading property. In this paper, we propose a method of optimally designing these three parameters to satisfy the condition that the ratio of the number of active worm-infected hosts divided by the number of all the vulnerable hosts is bound by a given upper-limit during the time T required to develop a patch or an anti-worm vaccine.

KW - Detection

KW - Optimum design

KW - Sampling

KW - Worm

UR - http://www.scopus.com/inward/record.url?scp=56649111112&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=56649111112&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-87357-0_9

DO - 10.1007/978-3-540-87357-0_9

M3 - Conference contribution

AN - SCOPUS:56649111112

SN - 3540873562

SN - 9783540873563

VL - 5275 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 103

EP - 116

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -