Simple and adaptive identification of superspreaders by flow sampling

Noriaki Kamiyama, Tatsuya Mori, Ryoichi Kawahara

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

30 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 2007
Subtitle of host publication26th IEEE International Conference on Computer Communications
Pages2481-2485
Number of pages5
DOIs
Publication statusPublished - 2007 Sep 4
Externally publishedYes
EventIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications - Anchorage, AK, United States
Duration: 2007 May 62007 May 12

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Conference

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Simple and adaptive identification of superspreaders by flow sampling'. Together they form a unique fingerprint.

  • Cite this

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