Skip to Main Content
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
Flow sampling algorithms and data streaming algorithms have widely adopted the hashing algorithms to detect flow information at the high-speed links for the applications of the flow distribution, the number of flow, the heavy-tailed flow, and so on. Hashing algorithms involve transforming a key inside a hash value. But there arenpsilat hash algorithms which are designed for flow measurement. In this paper, we propose a method to design flow hash algorithm based on traffic character. A bit probability distance metric is given to design a flow hash algorithm, and a flow hash algorithm is given using a CERNET trace, and the flow hash algorithm is compared with Bob and CRC hash algorithms by an uniformity test, the number of active flows tests, and a speed test. The experimental result shows that the flow hash algorithm is superior to others hash algorithms.