Return to search

A Fast Multi-pattern Matching Algorithm for Network Processors

There are more and more Internet services such as video on demand, voice over IP,Blog, and so on. The network quality is important for providing good services. P2P technology can decentralize the usage of bandwidth, so a server can provide services with lower bandwidth. The bandwidth is filled by P2P traffic if we don¡¦t limit the usage of P2P applications, so we need a service controller that can limit the P2P traffic to provide better quality for other applications.
The traditional network systems use software solutions or hardware solutions. The software solutions offer flexibility but have low performance; The hardware solutions offer highest speed but are inflexible and expensive to modify or upgrade. there is another solution known as network processors. A network processor can be programmed and has been optimizede for packet procecssing.
We need a good service classifier to classify P2P traffic, then we can limit it. The performance of a signature based service classifier is dominated by the speed of its pattern
matching algorithm. In this paper, we proposed a fast ulti-pattern matching algorithm by improving WM algorithm. Serveral algorithms are implemented on IXP2400 network
processor for performance evaluation, and our proposed algorithm outperforms other algorithms if its parameters are properly set.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0910106-144759
Date10 September 2006
CreatorsWu, Pao-chin
ContributorsSheng-tzong Cheng, Chu-sing Yang, Ce-kuen Shieh, Mon-yen Luo, Wei-kuang Lai, Li-ming Tseng
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageCholon
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0910106-144759
Rightsnot_available, Copyright information available at source archive

Page generated in 0.0019 seconds