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

价格
元 500
不含税

远程仓调货

预计送达时间 年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
语言 德语