|Table of Contents|

Comparison and Analysis of Hash Algorithm Based on Flows(PDF)

南京师范大学学报（工程技术版）[ISSN:1006-6977/CN:61-1281/TN]

Issue:
2008年04期
Page:
25-28
Research Field:
Publishing date:

Info

Title:
Comparison and Analysis of Hash Algorithm Based on Flows
Author(s):
Qiang Shiqing1; Cheng Guang2
1.School of Computer Science and Engineering,Southeast University,Nanjing 210096,China;2.Jiangsu Provincial Key Laboratory of Computer Network Technology,Southeast University,Nanjing 210096,China
Keywords:
flow hash;  packet hash;  un ifo rm ity;  co llision ra te
PACS:
TP393.08
DOI:
-
Abstract:
In orde r to re lax the contradiction betw een the high- speed ne tw ork measurem ent and the hardware resou rces it is necessary to make a sam pling trea tm ent w ith ne tw ork flow. The em erg ing techn iques based on hash-samp ling have been w ide ly used, and the perform ance o f flow hash a lgor ithm is one o f the key m easuring technolog ies. The study o f hash in h igh-speed ne tw ork m easu rem ent w as m ainly concentrated on the perform ance o f the packet hash function, yet there haven’ t been the ana lysis and comparative study fo r the perform ance of the ex isting flow hash. From the theoretical analysis and experim ental verification point, th is paper pu ts forward severa l pe rform ance estim ations of flow hash, and uses the CERNET backbone tra ffic to m ake comparative study in un iform ity and low co llision ra te of genera l flow hash, and thus prov ides a foundation fo r se lecting flow hash.

References:

[ 1] M o linaM, N icco lini S, Du ffie ld N G. A com para tive expe rim ental study o f hash functions applied to packe t samp ling [ C ] / /Interna tiona l Teletra ffic Congress( ITC- 19). Be ijing: 2005.
[ 2] M o linaM, Tartare lli S, Raspa llm F, et a.l Imp lementation o f an IPFIX com pliant flow trafficm ete r: cha llenges and pe rfo rmance assessm ent[ C] / / IEEEW orkshop on IP Operations andM anagem ent, 2003: 61-67.
[ 3] 程光, 龚俭, 丁伟, 等. 面向IP流测量的哈希算法研究[ J]. 软件学报, 2005, 16( 5): 652-658.
Cheng Guang, Gong Jian, D ingW e,i et a.l A hash a lgo rithm for IP flow m easurem ent[ J] . Journa l of So ftw are, 2005, 16( 5): 652-658. ( in Ch inese)
[ 4] W hang K, Vander Zanden B, Taylor H. A L inear- tim e probabilistic counting a lgo rithm for database applica tions[ J]. ACM Trans on Da tabase System s, 1990, 15( 2): 208-229.
[ 5] Zseby T, M olinaM, Raspa ll F, et a.l Sam pling and filte ring techn iques fo r IP packet selection[ EB /OL] . IETF 2004: 32-33.http: / / too ls. iet.f org /htm l/draft- ie tf- psam p- samp le- tech- 05# section- 17.
[ 6] Jenkins B. A lgor ithm A lley, Dr. Dobb’ s Journa,l September 1997[ J /OL]. http: / /burtleburtle. net/bob /hash /doobs. html.

Memo

Memo:
-
Last Update: 2013-04-24