|
ABSTRACT
We develop algorithms for the compact representation of the 1- and 2-dimensional tries that are used for Internet packet classification. Our compact representations are experimentally compared with competing compact representations for 1- and multi-dimensional packet classifiers and found to simultaneously reduce the number of memory accesses required for a lookup as well as the memory required to store the classifier.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
F. Baboescu, S. Singh, and G. Varghese, "Packet classification for core routers: Is there an alternative to CAMs?," in IEEE INFOCOM, 2003.
|
 |
2
|
Mikael Degermark , Andrej Brodnik , Svante Carlsson , Stephen Pink, Small forwarding tables for fast routing lookups, Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication, p.3-14, September 14-18, 1997, Cannes, France
|
 |
3
|
|
| |
4
|
A. Hari, S. Suri, and G. Parulkar, "Detecting and resolving packet filter conflicts," in IEEE INFOCOM, 2000.
|
| |
5
|
|
| |
6
|
Internet Routing Table Statistics. [Online]. Available: http://www. merit.edu/ipma/routing_table
|
| |
7
|
|
| |
8
|
S. Kumar, J. Turner, P. Crowley, and M. Mitzenmacher, "Hexa: Compact data structures for faster packet processing," in Proc. IEEE Int. Conf. Network Protocols (ICNP), 2007.
|
| |
9
|
B. Lampson, V. Srinivasan, and G. Varghese, "IP lookup using multi-way and multi-column search," in IEEE INFOCOM, 1998.
|
| |
10
|
|
| |
11
|
|
| |
12
|
|
 |
13
|
Sumeet Singh , Florin Baboescu , George Varghese , Jia Wang, Packet classification using multidimensional cutting, Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, August 25-29, 2003, Karlsruhe, Germany
[doi> 10.1145/863955.863980]
|
| |
14
|
|
| |
15
|
|
| |
16
|
W. Lu and S. Sahni, Succinct Representation of Packet Classifier [On-line]. Available: http://www.cise.ufl.edu/~wlu/papers/hsst.pdf
|
| |
17
|
J. Lunteren, "Searching very large routing tables in fast SRAM," in Proc. ICCCN, 2001.
|
| |
18
|
J. Lunteren, "Searching very large routing tables in wide embedded memory," in Proc. GLOBECOM, 2001.
|
| |
19
|
J. Munro and S. Rao, "Succinct representation of data structures," in Handbook of Data Structures and Applications, D. Mehta and S. Sahni, Eds. Boca Raton, FL: Chapman & Hall/CRC, 2005.
|
| |
20
|
|
| |
21
|
BGP Routing Table Analysis Reports. [Online]. Available: http://bgp. potaroo.net
|
| |
22
|
Routing Information Service Raw Data, RIS [Online]. Available: http:// data.ris.ripe.net
|
| |
23
|
M. Ruiz-Sanchez, E. Biersack, and W. Dabbous, "Survey and taxonomy of IP address lookup algorithms," IEEE Network, vol. 15, no. 2, pp. 8-23, Mar.-Apr. 2001.
|
| |
24
|
S. Sahni, K. Kim, and H. Lu, "Data structures for one-dimensional packet classification using most-specific-rule matching," Int. J. Foundations of Computer Science, vol. 14, no. 3, pp. 337-358, 2003.
|
 |
25
|
V. Srinivasan , G. Varghese , S. Suri , M. Waldvogel, Fast and scalable layer four switching, Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication, p.191-202, August 31-September 04, 1998, Vancouver, British Columbia, Canada
|
 |
26
|
|
| |
27
|
|
 |
28
|
|
| |
29
|
|
| |
30
|
D. Taylor and J. Turner, "Classbench: A packet classification benchmark," in Proc. IEEE INFOCOM, 2005.
|
| |
31
|
D. Taylor and J. Turner, "Scalable packet classification using distributed crossproducting of field labels," in Proc. IEEE INFOCOM, 2005.
|
|