An Improved Algorithm to Accelerate Regular Expression Evaluation

An Improved Algorithm to Accelerate Regular Expression Evaluation

ID:37576663

大小:334.52 KB

页数:10页

时间:2019-05-25

An Improved Algorithm to Accelerate Regular Expression Evaluation_第1页
An Improved Algorithm to Accelerate Regular Expression Evaluation_第2页
An Improved Algorithm to Accelerate Regular Expression Evaluation_第3页
An Improved Algorithm to Accelerate Regular Expression Evaluation_第4页
An Improved Algorithm to Accelerate Regular Expression Evaluation_第5页
资源描述:

《An Improved Algorithm to Accelerate Regular Expression Evaluation》由会员上传分享,免费在线阅读,更多相关内容在行业资料-天天文库

1、AnImprovedAlgorithmtoAccelerateRegularExpressionEvaluationMichelaBecchiPatrickCrowleyWashingtonUniversityWashingtonUniversityComputerScienceandEngineeringComputerScienceandEngineeringSt.Louis,MO63130-4899St.Louis,MO63130-4899+1-314-935-4306+1-314-935-9186mbecchi@cs

2、e.wustl.edupcrowley@wustl.eduSecurityAppliances[13]andtheCitrixApplicationFirewall[14]—ABSTRACTuseregularexpressionstodescribepayloadpatterns.Inaddition,Modernnetworkintrusiondetectionsystemsneedtoperformregularapplication-levelsignatureanalysishasbeenrecentlypropo

3、sedasanexpressionmatchingatlinerateinordertodetecttheoccurrenceofaccuratemeanstodetectandtrackpeer-to-peertraffic,enablingcriticalpatternsinpacketpayloads.Whiledeterministicfinitesophisticatedpacketprioritizationmechanisms[17].automata(DFAs)allowthisoperationtobepe

4、rformedinlineartime,theymayexhibitprohibitivememoryrequirements.In[9],KumaretRegularexpressionsaremoreexpressivethansimplepatternsofal.proposeDelayedInputDFAs(D2FAs),whichprovideatrade-offstringsandthereforeabletodescribeawidervarietyofpayloadbetweenthememoryrequir

5、ementsofthecompressedDFAandthesignatures,buttheirimplementationsdemandfargreatermemorynumberofstatesvisitedforeachcharacterprocessed,whichspaceandbandwidth.Consequently,therehasbeenaconsiderablecorrespondsdirectlytothememorybandwidthrequiredtoevaluateamountofrecent

6、workonimplementingregularexpressionsforuseregularexpressions.inhigh-speednetworkingapplications,particularlywithrepresentationsbasedondeterministicfiniteautomata(DFA).Inthispaperweintroduceageneralcompressiontechniquethatresultsinatmost2Nstatetraversalswhenprocessi

7、ngastringofDFAshaveattractivepropertiesthatexplaintheattentionthey2lengthN.IncomparisontotheDFAapproach,ourtechniquehavereceived.Foremost,theyhavepredictableandacceptableachievescomparablelevelsofcompression,withlowerprovablememorybandwidthrequirements.Infact,theus

8、eofDFAsallowsoneboundsonmemorybandwidth(orgreatercompressionforagivensinglestatetransition,andonecorrespondingmemoryoperation,forbandwidthbound).

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。