Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 임혜숙 | * |
dc.date.accessioned | 2016-08-28T11:08:24Z | - |
dc.date.available | 2016-08-28T11:08:24Z | - |
dc.date.issued | 2005 | * |
dc.identifier.isbn | 780389247 | * |
dc.identifier.other | OAK-12791 | * |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/228862 | - |
dc.description.abstract | Packet classification is to classify incoming packets into "class" in the Internet routers in order to provide different services according to classes that packet belongs. Packet classification is one of the most challenging operations since it should be performed in wire-speed referring the thousands of pre-defined multi-field rules. In this paper, we proposed a new packet classification architecture. The proposed scheme is based on parallel multiple hashing for source-destination prefix tuples and linked-list search for remaining fields on rules with the same source and destination prefixes. Prefix grouping is also proposed to reduce the number of tuples. Simulation results using real databases show that the proposed scheme requires small number of memory accesses and O(N) memory space for N rule classifier. The proposed scheme also has very good characteristics in rule updating and scalability toward large classifier. © 2005 IEEE. | * |
dc.language | English | * |
dc.title | Parallel multiple hashing for packet classification | * |
dc.type | Conference Paper | * |
dc.relation.index | SCOPUS | * |
dc.relation.startpage | 104 | * |
dc.relation.lastpage | 107 | * |
dc.relation.journaltitle | 2005 Workshop on High Performance Switching and Routing, HPSR 2005 | * |
dc.identifier.scopusid | 2-s2.0-27644478533 | * |
dc.author.google | Lim H. | * |
dc.author.google | Kim H.-R. | * |
dc.author.google | Jung Y.-J. | * |
dc.contributor.scopusid | 임혜숙(7403095209) | * |
dc.date.modifydate | 20240419140241 | * |