| 日時(Date) | 平成30年12月7日（金）3限（13:30--15:00) Fri. Dec. 7th, 2018, 3rd Period (13:30--15:00) |
|---|---|
| 場所(Location) | L1 |
| 司会(Chair) | Doudou Fall 助教 |
| 講演者(Presenter) | Kenjiro Cho (Research Director at the Internet Initiative Japan - Innovation Institute (IIJ-II) ) |
| 題目(Title) | On Finding Hierarchical Heavy Hitters |
| 概要(Abstract) | Finding frequent items (Heavy Hitters) in a large dataset has diverse applications and has been extensively studied. Items with hierarchical attributes such as IP addresses or time can be aggregated into groups such as subnets or coarser time. Identifying these frequent aggregates, known as Hierarchical Heavy Hitters, provides powerful means for traffic monitoring or anomaly detection. In this talk, I will review the existing algorithms for Heavy Hitter and Hierarchical Heavy Hitter problems, and then, introduce an efficient algorithm based on recursive space partitioning. I'll also introduce a traffic monitoring tool based on the proposed method that has been used for monitoring the WIDE backbone traffic. |
| 講演言語(Language) | English |
| 講演者紹介(Introduction of Lecturer) | Kenjiro Cho is Research Director at Internet Initiative Japan, Inc. He is also a board member of the WIDE project. He received the B.S. degree in electronic engineering from Kobe University, the M.Eng. degree in computer science from Cornell University, and the Ph.D. degree in media and governance from Keio University. His current research interests include Internet measurement and data analysis, and cloud networking. |