Presentation 2006-07-21
Optimum Memory Allocation in Identifying Flow Hogs
Noriaki KAMIYAMA, Tatsuya MORI, Ryoichi KAWAHARA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Hosts infected by worm generate huge amount of flows during a short time, so it is important to identify these flow hogs as soon as possible. We proposed a method identifying flow hogs using flow sampling. This method consists of a Bloom filter finding a new flow and a host table storing the sampled flow count for each host. In this paper, we propose an optimum memory allocation method for each module to minimize the false negative ratio.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) abusive traffic / flow hog / flow sampling / identification / resource allocation
Paper # NS2006-68
Date of Issue

Conference Information
Committee NS
Conference Date 2006/7/12(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Network Systems(NS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Optimum Memory Allocation in Identifying Flow Hogs
Sub Title (in English)
Keyword(1) abusive traffic
Keyword(2) flow hog
Keyword(3) flow sampling
Keyword(4) identification
Keyword(5) resource allocation
1st Author's Name Noriaki KAMIYAMA
1st Author's Affiliation NTT Service Integration Laboratories, NTT Corporation()
2nd Author's Name Tatsuya MORI
2nd Author's Affiliation NTT Service Integration Laboratories, NTT Corporation
3rd Author's Name Ryoichi KAWAHARA
3rd Author's Affiliation NTT Service Integration Laboratories, NTT Corporation
Date 2006-07-21
Paper # NS2006-68
Volume (vol) vol.106
Number (no) 167
Page pp.pp.-
#Pages 4
Date of Issue