Name
Abstract | ||
|---|---|---|
Recently, many network-device platforms provide a fast SRAM interface for short access latency. However, existing packet classification algorithms achieve high-speed performance by sacrificing the table size; consequently, the entire table is stored in a large DRAM instead of a small SRAM. In this letter, we propose a new partitioning-based packet classification algorithm that generates very small tables and enables the tables to be stored in an SRAM to achieve a very fast speed. Moreover, by removing overhead for the partitioning search, our algorithm provides excellent performance even with DRAMs as compared to other algorithms. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/LCOMM.2013.051313.121778 | IEEE Communications Letters |
Keywords | Field | DocType |
Partitioning algorithms,Random access memory,Heuristic algorithms,Arrays,Buildings,Protocols,Indexes | Dram,Computer science,Latency (engineering),Networking hardware,Universal memory,Real-time computing,Static random-access memory,Packet classification,Embedded system | Journal |
Volume | Issue | ISSN |
17 | 6 | 1089-7798 |
Citations | PageRank | References |
2 | 0.40 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wooguil Pak | 1 | 37 | 9.83 |
| Young-June Choi | 2 | 311 | 32.48 |