Simple and adaptive identification of superspreaders by flow sampling

Noriaki Kamiyama, Tatsuya Mori, Ryoichi Kawahara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

28 Citations (Scopus)

Abstract

Abusive traffic caused by worms is increasing severely in the Internet. In many cases, worm-infected hosts generate a huge number of flows of small size during a short time. To suppress the abusive traffic and prevent worms from spreading, identifying these "superspreaders" as soon as possible and coping with them, e.g., disconnecting them from the network, is important. This paper proposes a simple and adaptive method of identifying superspreaders by flow sampling. By satisfying the given memory size and the requirement for the processing time, the proposed method can adaptively optimize parameters according to changes in traffic patterns.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
Pages2481-2485
Number of pages5
DOIs
Publication statusPublished - 2007
Externally publishedYes
EventIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications - Anchorage, AK
Duration: 2007 May 62007 May 12

Other

OtherIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
CityAnchorage, AK
Period07/5/607/5/12

Fingerprint

Internet
Sampling
Data storage equipment
Processing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Kamiyama, N., Mori, T., & Kawahara, R. (2007). Simple and adaptive identification of superspreaders by flow sampling. In Proceedings - IEEE INFOCOM (pp. 2481-2485). [4215887] https://doi.org/10.1109/INFCOM.2007.305

Simple and adaptive identification of superspreaders by flow sampling. / Kamiyama, Noriaki; Mori, Tatsuya; Kawahara, Ryoichi.

Proceedings - IEEE INFOCOM. 2007. p. 2481-2485 4215887.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kamiyama, N, Mori, T & Kawahara, R 2007, Simple and adaptive identification of superspreaders by flow sampling. in Proceedings - IEEE INFOCOM., 4215887, pp. 2481-2485, IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications, Anchorage, AK, 07/5/6. https://doi.org/10.1109/INFCOM.2007.305
Kamiyama N, Mori T, Kawahara R. Simple and adaptive identification of superspreaders by flow sampling. In Proceedings - IEEE INFOCOM. 2007. p. 2481-2485. 4215887 https://doi.org/10.1109/INFCOM.2007.305
Kamiyama, Noriaki ; Mori, Tatsuya ; Kawahara, Ryoichi. / Simple and adaptive identification of superspreaders by flow sampling. Proceedings - IEEE INFOCOM. 2007. pp. 2481-2485
@inproceedings{47951d37fda44ef482b8c92e25b6dfbb,
title = "Simple and adaptive identification of superspreaders by flow sampling",
abstract = "Abusive traffic caused by worms is increasing severely in the Internet. In many cases, worm-infected hosts generate a huge number of flows of small size during a short time. To suppress the abusive traffic and prevent worms from spreading, identifying these {"}superspreaders{"} as soon as possible and coping with them, e.g., disconnecting them from the network, is important. This paper proposes a simple and adaptive method of identifying superspreaders by flow sampling. By satisfying the given memory size and the requirement for the processing time, the proposed method can adaptively optimize parameters according to changes in traffic patterns.",
author = "Noriaki Kamiyama and Tatsuya Mori and Ryoichi Kawahara",
year = "2007",
doi = "10.1109/INFCOM.2007.305",
language = "English",
isbn = "1424410479",
pages = "2481--2485",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Simple and adaptive identification of superspreaders by flow sampling

AU - Kamiyama, Noriaki

AU - Mori, Tatsuya

AU - Kawahara, Ryoichi

PY - 2007

Y1 - 2007

N2 - Abusive traffic caused by worms is increasing severely in the Internet. In many cases, worm-infected hosts generate a huge number of flows of small size during a short time. To suppress the abusive traffic and prevent worms from spreading, identifying these "superspreaders" as soon as possible and coping with them, e.g., disconnecting them from the network, is important. This paper proposes a simple and adaptive method of identifying superspreaders by flow sampling. By satisfying the given memory size and the requirement for the processing time, the proposed method can adaptively optimize parameters according to changes in traffic patterns.

AB - Abusive traffic caused by worms is increasing severely in the Internet. In many cases, worm-infected hosts generate a huge number of flows of small size during a short time. To suppress the abusive traffic and prevent worms from spreading, identifying these "superspreaders" as soon as possible and coping with them, e.g., disconnecting them from the network, is important. This paper proposes a simple and adaptive method of identifying superspreaders by flow sampling. By satisfying the given memory size and the requirement for the processing time, the proposed method can adaptively optimize parameters according to changes in traffic patterns.

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

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

U2 - 10.1109/INFCOM.2007.305

DO - 10.1109/INFCOM.2007.305

M3 - Conference contribution

AN - SCOPUS:34548357184

SN - 1424410479

SN - 9781424410477

SP - 2481

EP - 2485

BT - Proceedings - IEEE INFOCOM

ER -