loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Advanced Industrial Conference on Telecommunications/Service Assurance with Partial and Intermittent Resources Conference/E-Learning on Telecommunications Workshop (AICT/SAPIR/ELETE'05)
Packet Classification Using Adaptive Rules Cutting (ARC)
Lisbon, Portugal
July 17-July 22
ISBN: 0-7695-2388-9
Motasem Abdelghani, Queen's University Belfast
Sakir Sezer, Queen's University Belfast
Emi Garcia, Queen's University Belfast
Mu Jun, Queen's University Belfast
This paper introduces an advanced packet classification algorithm called Adaptive Rules Cutting (ARC). Same as HiCuts and HyperCuts Algorithm, ARC is based on cutting the multi-dimensional space into smaller segments for rule reduction. Unlike HiCuts where dividing the region takes more than 1 level, and unlike HyperCuts in which each node represents a k-dimensional hypercube, ARC allows the flexibility of considering all dimensions. This extra degree of freedom and a new set of heuristics allow adaptation for optimum rule cutting for a given amount of storage. Rule cutting simulations and performance studies show that ARC can provide a reduction of up to 98% of the given rules in the first instance.
Citation:
Motasem Abdelghani, Sakir Sezer, Emi Garcia, Mu Jun, "Packet Classification Using Adaptive Rules Cutting (ARC)," aict-sapir-elete, pp.28-33, Advanced Industrial Conference on Telecommunications/Service Assurance with Partial and Intermittent Resources Conference/E-Learning on Telecommunications Workshop (AICT/SAPIR/ELETE'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.