DocumentCode
528381
Title
PCIU: An efficient packet classification algorithm with an incremental update capability
Author
Ahmed, Omar ; Areibi, Shawki ; Fayek, Dalia
Author_Institution
Sch. of Eng., Univ. of Guelph, Guelph, ON, Canada
fYear
2010
fDate
11-14 July 2010
Firstpage
81
Lastpage
88
Abstract
Packet classification plays a crucial role for a number of network services such as policy based routing, firewalls and traffic billing to name a few. However, classification can be a bottleneck in the above mentioned applications if not implemented properly and efficiently. In this work we propose PCIU, a novel algorithm, which improves upon previous published algorithms. PCIU provides lower pre-processing time, lower memory consumption, ease of incremental rule update, and reasonable classification time compared to published work. The maximum memory to accommodate 10,000 rules in the worst case is less than 2.5 MB. The proposed algorithm was evaluated and compared to several techniques such as RFC and HiCut using several benchmarks. Results obtained indicate that PCIU outperforms these algorithms in terms of speed, memory usage, incremental update capability and pre-processing time.
Keywords
authorisation; computer networks; telecommunication network routing; telecommunication traffic; HiCut; PCIU; RFC; firewalls; incremental update capability; memory consumption; network services; packet classification; policy based routing; pre-processing time; traffic billing; Benchmark testing; Decision trees; Hardware; IP networks; Memory management; Software algorithms; Table lookup; IP Lookup Table; Incremental Update; Multi-dimensional Packet Classification; Network Devices; Network Processor;
fLanguage
English
Publisher
ieee
Conference_Titel
Performance Evaluation of Computer and Telecommunication Systems (SPECTS), 2010 International Symposium on
Conference_Location
Ottawa, ON
Print_ISBN
978-1-56555-340-8
Type
conf
Filename
5588598
Link To Document