Packet classification is a vital and complicated task as the processing of packets should be done at a specified line speed. In order to classify a packet as belonging to a particular flow or set of flows, network nodes must perform a search over a set of filters using multiple fields of the packet as the search key. Packet classification is used by networking equipment to sort packets into flows by comparing their headers to a list of rules. A flow is used to decide a packet’s priority and the manner in which it is processed. Packet classification is a difficult task due to the fact that all packets must be processed at wire speed and rulesets can contain tens of thousands of rules. Also the performance of today's packet classification solutions depends on the characteristics of rulesets. The range-based packet classification function maps input packets to the highest-priority matching rule in a given rule set specified by ranges. In this project, a Merge FSM model based Classifier is proposed to reduce its complexity and time consumption. The contributions of this work towards the area of packet classification are hardware accelerators that allow packet classification to be implemented at core network line speeds when classifying packets using rulesets containing tens of thousands of rules. A new pre-cutting process has been implemented to reduce the memory size to fit in an FPGA. This classifier can classify packets with high speed and with a power consumption factor of less than 3W. The proposed algorithm also removes the need for floating point division to be performed when classifying a packet, allowing higher clock speeds and thus obtaining higher throughputs.
Swapna S.R, Dr Sreeja Mole S.S
Packet Classification, Low Power, Accelerator, FSM, Throughput, Speed, Classification Engine
'. Usage and populationÂ Â Â statistics (2012,jun.) [online].Available:http://www.internetworldstats.com/stats.htm
. P. Gupta and N. McKeown, â€śPacket classification using hierarchical intelligent cuttings,â€ť IEEE Micro, Feb. 2000,vol. 20, no. 1, pp. 34â€“4.
. T. Woo, â€śA modular approach to packet classification: Algorithms and results,â€ť in Proc.Â IEEE Int. Conf. Comput. Commun.,Â Â Mar. 2000, pp. 1213â€“1222.
. S. Singh, F. Baboescu, G. Varghese, and J. Wang, â€śPacket classification usingmultidimensional cutting,â€ť in Proc. ACM Special Interest Group Data Commun. Conf., Aug.2003, pp. 213â€“224.
. P. Gupta and N. McKeown, â€śPacket classification on multiple fields,â€ť in Proc. ACM Special Interest Group Data Commun.Â Â Â Â Conf., Sep. 1999, pp. 147â€“160.
. T. V. Lakshman and D. Stiliadis, â€śHigh-speed policy based packet forwarding using efficientÂ multi-dimensional range matching,â€ť in Proc. ACM Special Interest Group Data Commun.Conf., Sep. 1998, pp. 203â€“214.
. V. Srinivasan, S. Suri, and G. Varghese, â€śPacket classification using tuple space search, â€ť in Proc. ACM Special Interest GroupÂ Â Â Data Commun.Conf., Sep. 1999, pp. 135â€“146.
|Published in :
||Volume 1 | Issue 1 | January-Febuary - 2015
|Date of Publication
Cite This Article
Swapna S.R, Dr Sreeja Mole S.S, "Merge FSM Based Low Power Packet Classification", International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 1, Issue 1, pp.369-375, January-Febuary-2015.
URL : http://ijsrset.com/IJSRSET151161.php