划分位无冲突哈希在trie树分组中的研究.pdfVIP

Computer EngineeringandApplications计算机工程与应用 划分位无冲突哈希在trie树分组中的研究 张墨华，张永强 ZHANG Mohua，ZHANGYongqiang 河南财经政法大学计算机与信息工程学院，郑州450000 and and School Information ofEconomics University Laws，Zhengzhou450000，China ofComputer Engineering，Henan ZHANG ontrie-tree non-collisionHash Mohua，ZHANGYongqiang．Researchpartitionprocessingusing basedon and functions partitionbit．ComputerEngineeringApplications，2012，48(II)：88-92． Abstract：Withthefast ofIntemet and efficient isat- broadband，time technology progress space packetprocessing needed．Onetoachieve istostorealltheattack on gently way hi曲一speedpacketprocessing signatureshigh—speed tothelimited anew tocreatethenon—collision on—chipmemory．Due on—chipmemory,thispaperproposesalgorithm functionsbasedon attack into at partition．Theevenlypartitionssignaturesmultiplegroups middle—point algorithm each intiletree．Thedatastructurecanbe ona to and layer implementedsinglechipperformpipeliningparallelism achieve and resultsshowthatthe call simultaneously,thushighthroughput．Thetheoryexperimental algorithm facilitatea．ccesstothe inthe while to the exactmatch memoryallowing expensive signaturestring on—chip perform decreasesthe of once，and operationsonly requirementon-chipmemory． ． words：non-collision