Simple and adaptive identification of superspreaders by flow sampling

Noriaki Kamiyama; Tatsuya Mori; Ryoichi Kawahara

doi:10.1109/INFCOM.2007.305

Simple and adaptive identification of superspreaders by flow sampling

Noriaki Kamiyama^*, Tatsuya Mori, Ryoichi Kawahara

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

41 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 language	English
Title of host publication	Proceedings - IEEE INFOCOM 2007
Subtitle of host publication	26th IEEE International Conference on Computer Communications
Pages	2481-2485
Number of pages	5
DOIs	https://doi.org/10.1109/INFCOM.2007.305
Publication status	Published - 2007
Externally published	Yes
Event	IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications - Anchorage, AK, United States Duration: 2007 May 6 → 2007 May 12

Publication series

Name	Proceedings - IEEE INFOCOM
ISSN (Print)	0743-166X

Conference

Conference	IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
Country/Territory	United States
City	Anchorage, AK
Period	07/5/6 → 07/5/12

ASJC Scopus subject areas

Computer Science(all)
Electrical and Electronic Engineering

Access to Document

10.1109/INFCOM.2007.305

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., 4215887, Proceedings - IEEE INFOCOM, pp. 2481-2485, IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications, Anchorage, AK, United States, 07/5/6. https://doi.org/10.1109/INFCOM.2007.305

@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",

series = "Proceedings - IEEE INFOCOM",

pages = "2481--2485",

booktitle = "Proceedings - IEEE INFOCOM 2007",

note = "IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications ; Conference date: 06-05-2007 Through 12-05-2007",

}

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

T3 - Proceedings - IEEE INFOCOM

SP - 2481

EP - 2485

BT - Proceedings - IEEE INFOCOM 2007

T2 - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications

Y2 - 6 May 2007 through 12 May 2007

ER -

Simple and adaptive identification of superspreaders by flow sampling

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this