Name
Abstract | ||
|---|---|---|
Policy lookup is a very essential function in packet forwarding and network security. As it is becoming a main cause of bottleneck in many network systems, this letter introduces a new policy lookup algorithm called FRFC (Fast table building for Recursive Flow Classification). Although it is based on RFC which shows the best policy lookup speed but the worst policy table update speed, it achieves high performance in table update as well as policy lookup. FRFC divides the whole rule set into smaller sub-rule sets and by doing so, it speeds up the table building time by 50 times compared to RFC when the considered rule set size is 10,000. With the rule set size increasing, the performance gap becomes larger. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/LCOMM.2010.100810.100572 | IEEE Communications Letters |
Keywords | Field | DocType |
Buildings,Indexes,Complexity theory,Memory management,Merging,Classification algorithms,Security | Bottleneck,Computer science,Network security,Flow (psychology),Computer network,Algorithm,Memory management,Statistical classification,Recursion,Packet forwarding,Performance gap | Journal |
Volume | Issue | ISSN |
14 | 12 | 1089-7798 |
Citations | PageRank | References |
4 | 0.47 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wooguil Pak | 1 | 37 | 9.83 |
| Saewoong Bahk | 2 | 1024 | 112.58 |