Kimihiro Yamamoto

Learn More
We propose a method to find N hosts that have the N highest cardinalities, where cardinality is the number of distinct items such as the number of flows, ports, or peer hosts. The method also estimates their cardinalities. While existing algorithms to find the top N frequent items can be directly applied to find N hosts that send the N largest numbers of(More)
In a large-scale backbone networks, the traffic monitoring system needs to receive a large volume of flow records, so if a single central collecting process is used, it might not be able to process all flow records. In this paper, we propose a method that achieves better scalability by using flow concentrators, which aggregate and distribute flow records. A(More)
  • 1