Presentation 2012-01-20
Fast Thresholds for Binary Clustering of Packet Traffic Properties
Marat ZHANIKEEV, Yoshiaki TANAKA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Many cases of processing traffic can be generalized to splitting values of properties into two clusters - small verses large values. For example, such clustering can be useful to detect gaps between consecutive TCP windows in a packet flow. Fast calculation of efficient thresholds is important for successful clustering. This paper compares performance of a number of threshold models applied to several properties of individual packet flows and as well as aggregate traffic.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) packet traffic / traffic analysis / clustering / fast thresholds
Paper # ICM2011-41,LOIS2011-66
Date of Issue

Conference Information
Committee ICM
Conference Date 2012/1/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 Information and Communication Management(ICM)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Fast Thresholds for Binary Clustering of Packet Traffic Properties
Sub Title (in English)
Keyword(1) packet traffic
Keyword(2) traffic analysis
Keyword(3) clustering
Keyword(4) fast thresholds
1st Author's Name Marat ZHANIKEEV
1st Author's Affiliation Faculty of Engineering, Tokyo University of Science:Global Information and Telecommunication Institute, Waseda University()
2nd Author's Name Yoshiaki TANAKA
2nd Author's Affiliation Global Information and Telecommunication Institute, Waseda University:Research Institute for Science and Engineering, Waseda University
Date 2012-01-20
Paper # ICM2011-41,LOIS2011-66
Volume (vol) vol.111
Number (no) 382
Page pp.pp.-
#Pages 4
Date of Issue