Sequential and Parallel Algorithms: for Network Packet Classification - Newaz Rafiq - 書籍 - LAP LAMBERT Academic Publishing - 9783843353885 - 2010年11月2日
カバー画像とタイトルが一致しない場合、正しいのはタイトルです

Sequential and Parallel Algorithms: for Network Packet Classification

価格
¥ 11.654
税抜

遠隔倉庫からの取り寄せ

発送予定日 年6月8日 - 年6月18日
iMusicのウィッシュリストに追加

A network processor unit (NPU) is a programmable device that consists of several hardware accelerators for wire-speed networking operations. One of the most important functional units in an NPU is packet classification unit (PCU) that classifies data packets based on single or multiple fields of packet header or contents in payload data. Large number of tasks in computer communication require packet classification. Network packet classification requires two types of matching techniques: (i) exact and (ii) inexact match. There are two solutions for exact match: (i) sequential and (ii) parallel solutions. Inexact match can be of two types: (i) Longest prefix match and (ii) Best match. This dissertation talks about these four techniques required for the PCU. For the sequential solution, we propose a string search algorithm that requires reduced time complexity. It also requires a small amount of memory, and shows better performance than any other related algorithms as proved by numerical analysis and extensive computer simulations.

メディア 書籍     Paperback Book   (ソフトカバーで背表紙を接着した本)
リリース済み 2010年11月2日
ISBN13 9783843353885
出版社 LAP LAMBERT Academic Publishing
ページ数 244
寸法 226 × 14 × 150 mm   ·   381 g
言語 ドイツ語