메뉴 건너뛰기




Volumn 58, Issue 12, 2009, Pages 1695-1709

Efficient 2D multibit tries for packet classification

Author keywords

2D tries; Dynamic programming.; Fixed stride tries; Multibit tries; Packet classification; Prefix expansion; Switch pointers; Variable stride tries

Indexed keywords

EXPERIMENTAL EVIDENCE; FAST ALGORITHMS; FIXED-STRIDE TRIES; INTERNET PACKETS; MEMORY ACCESS; MEMORY REQUIREMENTS; MULTI-DIMENSIONAL PACKETS; MULTIBIT TRIES; PACKET CLASSIFICATION;

EID: 74549178460     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2009.127     Document Type: Article
Times cited : (4)

References (27)
  • 3
    • 0042976157 scopus 로고    scopus 로고
    • Packet Classification for Core Routers: Is There an Alternative to CAMs?
    • F. Baboescu, S. Singh, and G. Varghese, " Packet Classification for Core Routers: Is There an Alternative to CAMs? " Proc. IEEE INFOCOM, 2003.
    • (2003) Proc. IEEE INFOCOM
    • Baboescu, F.1    Singh, S.2    Varghese, G.3
  • 5
    • 24344481940 scopus 로고    scopus 로고
    • Tree Bitmap: Hardware/Software IP Lookups with Incremental Updates
    • W. Eatherton, G. Varghese, and Z. Dittia, " Tree Bitmap: Hardware/Software IP Lookups with Incremental Updates, " Computer Comm. Rev., vol. 34, no. 2, pp. 97-122, 2004.
    • (2004) Computer Comm. Rev , vol.34 , Issue.2 , pp. 97-122
    • Eatherton, W.1    Varghese, G.2    Dittia, Z.3
  • 8
    • 0000578923 scopus 로고    scopus 로고
    • Packet Classification Using Hierarchical Intelligent Cuts,
    • P. Gupta and N. McKeown, " Packet Classification Using Hierarchical Intelligent Cuts, " Proc. ACM SIGCOMM, 1999.
    • (1999) Proc. ACM SIGCOMM
    • Gupta, P.1    McKeown, N.2
  • 10
    • 0002436227 scopus 로고    scopus 로고
    • High Speed Policy-Based Packet Forwarding Using Efficient Multi-Dimensional Range Matching,
    • T. Lakshman and D. Stidialis, " High Speed Policy-Based Packet Forwarding Using Efficient Multi-Dimensional Range Matching, " Proc. ACM SIGCOMM, 1998.
    • (1998) Proc. ACM SIGCOMM
    • Lakshman, T.1    Stidialis, D.2
  • 13
    • 0035278505 scopus 로고    scopus 로고
    • Survey and Taxonomy of IP Address Lookup Algorithms
    • Mar./Apr
    • 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.
    • (2001) IEEE Network , vol.15 , Issue.2 , pp. 8-23
    • Ruiz-Sanchez, M.1    Biersack, E.2    Dabbous, W.3
  • 14
    • 22944465246 scopus 로고    scopus 로고
    • Data Structures for One- Dimensional Packet Classification Using Most-Specific-Rule Matching
    • S. Sahni, K. Kim, and H. Lu, " Data Structures for One- Dimensional Packet Classification Using Most-Specific-Rule Matching, " Int'l J. Foundations of Computer Science, vol. 14, no. 3, pp. 337-358, 2003.
    • (2003) Int'l J. Foundations of Computer Science , vol.14 , Issue.3 , pp. 337-358
    • Sahni, S.1    Kim, K.2    Lu, H.3
  • 18
    • 0035001155 scopus 로고    scopus 로고
    • A Packet Classification and Filter Management System,
    • V. Srinivasan, " A Packet Classification and Filter Management System, " Proc. IEEE INFOCOM, 2001.
    • (2001) Proc. IEEE INFOCOM
    • Srinivasan, V.1
  • 19
    • 0002260103 scopus 로고    scopus 로고
    • Faster IP Lookups Using Controlled Prefix Expansion
    • Feb
    • V. Srinivasan and G. Varghese, " Faster IP Lookups Using Controlled Prefix Expansion, " ACM Trans. Computer Systems, vol. 17, no. 1, pp. 1-40, Feb. 1999.
    • (1999) ACM Trans. Computer Systems , vol.17 , Issue.1 , pp. 1-40
    • Srinivasan, V.1    Varghese, G.2
  • 20
    • 74549120449 scopus 로고    scopus 로고
    • Network Security: Private Communication in a Public World, second ed, chapter 17. Prentice Hall, 2002
    • C. Kaufman, R. Perlman, and M. Speciner, Network Security: Private Communication in a Public World, second ed., chapter 17. Prentice Hall, 2002.
    • Kaufman, C.1    Perlman, R.2    Speciner, M.3
  • 21
    • 34247192413 scopus 로고    scopus 로고
    • O(log W) Multidimensional Packet Classification
    • Apr
    • H. Lu and S. Sahni, " O(log W) Multidimensional Packet Classification, " IEEE/ACM Trans. Networking, vol. 15, no. 2, pp. 462-472, Apr. 2007.
    • (2007) IEEE/ACM Trans. Networking , vol.15 , Issue.2 , pp. 462-472
    • Lu, H.1    Sahni, S.2
  • 22
    • 29844447197 scopus 로고    scopus 로고
    • Conflict Detection and Resolution in Two- Dimensional Prefix Router Tables
    • Dec
    • H. Lu and S. Sahni, " Conflict Detection and Resolution in Two- Dimensional Prefix Router Tables, " IEEE/ACM Trans. Networking, vol. 13, no. 6, pp. 1353-1363 Dec. 2005.
    • (2005) IEEE/ACM Trans. Networking , vol.13 , Issue.6 , pp. 1353-1363
    • Lu, H.1    Sahni, S.2
  • 23
    • 0042238346 scopus 로고    scopus 로고
    • Efficient Construction of Multibit Tries for IP Lookup
    • Aug
    • S. Sahni and K. Kim, " Efficient Construction of Multibit Tries for IP Lookup, " IEEE/ACM Trans. Networking, vol. 11, no. 4, pp. 650- 662, Aug. 2003.
    • (2003) IEEE/ACM Trans. Networking , vol.11 , Issue.4 , pp. 650-662
    • Sahni, S.1    Kim, K.2
  • 24
    • 25844521204 scopus 로고    scopus 로고
    • ClassBench: A Packet Classification Benchmark,
    • D. Taylor and J. Turner, " ClassBench: A Packet Classification Benchmark, " Proc. IEEE INFOCOM, 2005.
    • (2005) Proc. IEEE INFOCOM
    • Taylor, D.1    Turner, J.2
  • 25
    • 74549205453 scopus 로고    scopus 로고
    • http://www.arl.wustl.edu/~det3/, 2009.
    • (2009)
  • 26
    • 74549182892 scopus 로고    scopus 로고
    • http://www.cise.ufl.edu/~wlu/2dtries.pdf, 2009.
    • (2009)
  • 27
    • 74549126229 scopus 로고    scopus 로고
    • Private Communication, July
    • V. Srinivasan, " Private Communication, " July 2006.
    • (2006)
    • Srinivasan, V.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.