Paper Info
Title
Is the Popular R*-tree Suited for Packet Classification?
Abstract
Packet classification enables network routers to provide advanced network services including network security, quality of service (QoS) routing, and multimedia communications. In order to classify a packet, network nodes must perform a search over a set of filters using multiple fields of the packet as the search key. Viewing the classification problem geometrically, classifying an arriving packet is equivalent to finding the highest priority hyperrectangle among all hyperrectangles that contain the point representing the packet. The R-tree and its variants, being among the most popular access methods for points and rectangles, have not been experimentally evaluated and benchmarked for their eligibility for the packet classification problem. In this paper we investigate how the R*-tree, a dynamic index structure for spatial data, is suited for packet classification. To this end we will benchmark R* with two representative classification algorithms using the ClassBench tools suite.
Year
DOI
Venue
2008
10.1109/NCA.2008.20
NCA
Keywords
Field
DocType
search key,popular r,advanced network service,representative classification,classification problem geometrically,packet classification,packet classification problem,network security,network routers,benchmark r,network node,routing,hydrogen,spatial data,data security,quality of service,classification algorithms,matched filters,computer applications,access method,pediatrics,computer networks,r tree,benchmark testing,decision trees,qos
Packet segmentation,Packet analyzer,Computer science,Network packet,Network security,Quality of service,Computer network,Theoretical computer science,Link state packet,Source routing,Statistical classification,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
11
Authors
2
Name
Order
Citations
PageRank
Christine Maindorfer131.45
Th. Ottmann2468124.40