| Summary: | 碩士 === 中華大學 === 電機工程學系(所) === 98 === How to find frequent items of efficiently and accurately from network streams, this is a great challenge topic, this paper will propose a new algorithm, can be applied to real-time and high-speed network, has recorded of the current the maximum flow rate topic several, and spend very little resources space and the required computing time is also fixed.First we through simulation test use of software,illustrate our approch compared to traditional practices,can be get higher accuracy,finally we can use hardware implementation,but also supports more than two network 1 Gbps of network traffic.
|
|---|
