A scalable IPv6 route lookup scheme via dynamic variable-stride bitmap compression and path compression

Computer Communications

Volumn 29, Issue 16, 2006, Pages 3037-3050

  Zheng, Kai ^a   Liu, Zhen ^a   Liu, Bin ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

CAM; Compression; IPv6; Route lookup

Indexed keywords

BUFFER STORAGE; DATA COMPRESSION; DATA TRANSFER; OPTIMIZATION; ROUTERS;

IPV6; ON-CHIP MEMORIES; WIRE SPEED ROUTE;

TELECOMMUNICATION NETWORKS;

EID: 33748934206     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2005.11.003     Document Type: Article

References (21)

1. Morrison D.R. PATRICIA - practical algorithm to retrieve information coded in alphanumeric. J. ACM 15 4 (1968) 514-534
2. Nilsson S., and Karlsson G. IP-address lookup using LC-tries. IEEE J. Select. Areas Commun. 17 6 (1999)
3. A. Donnelly, T. Deegan, IP route lookup as string matching, in: Proceedings of IEEE Local Computer Networks, 2000, pp. 589-595.
4. J. van Luntereb, Searching very large routing tables in wide embedded memory, in: Proceedings of IEEE GLOBECOM, vol. 3, 2001, pp.1615-1619.
5. P. Gupta, S. Lin, N. McKeown, Routing lookups in hardware at memory access speed, in: Proceedings of IEEE INFOCOM'98, 1998, pp. 1240-1247.
6. M. Degermark, A. Brodnik, S. Carlsson, S. Pink, Small forwarding tables for fast routing lookups, in: Proceedings of ACM/SIGCOMM'97, 1997, pp. 3-14.
7. W. Eatherton, Hardware-based internet protocol prefix lookups, Washington University Electrical Engineering Department (MS Thesis), 1999.
8. Taylor D.E., Turner J.S., Lockwood J.W., Sproull T.S., and Parlour D.B. Scalable IP lookup for Internet routers. IEEE J. Selected Areas Commun. 21 4 (2003) 522-534
9. CYRESS. http://www.cypress.com/.
10. IDT. http://www.idt.com/products/.
11. RIPE 267: APNIC, ARIN, RIPE NCC, IPv6 Address Allocation and Assignment Policy, Document ID: ripe-267, January 2003, available at: http://www.ripe.net/ripe/docs/ipv6policy.html.
12. Database of the Mae-West router from the IPMA Project (A joint effort of the University of Michigan and Merit Network) http://www.merit.edu/ipma.
13. Sikka S., and Varghese G. Memory-efficient state lookups with fast updates. ACM SIGCOMM Comput. Commun. Rev. 30 4 (2000) 335-347
14. N. Tuck, T. Sherwood, B. Calder, G. Varghese, Deterministic memory-efficient string matching algorithms for intrusion detection, in: Proceedings of IEEE INFOCOM'04, vol. 4. Hong Kong, 2004, pp. 2628-2639.
15. Database of the RRC06 router from the RRCC Project (Routing Registry Consistency Check Project), available at: http://www.ripe.net/rrcc/.
16. RFC 2374: R. Hinden, M. O'Dell, S. Deering, An IPv6 Aggregatable Global Unicast Address Format, 1998, available at: ftp://ftp.ripe.net/rfc/rfc2374.txt.
17. RFC 2928: R. Hinden, S. Deering, R. Fink, T. Hain, Initial IPv6 Sub-TLA ID Assignments, 2000, available at: ftp://ftp.ripe.net/rfc/rfc2928.txt.
18. RFC 3177: IAB, IESG, IAB/IESG Recommendations on IPv6 Address. 2001, available at: ftp://ftp.ripe.net/rfc/rfc3177.txt.
19. RFC 3587: R. Hinden, S. Deering, E. Nordmark, IPv6 Global Unicast Address Format, 2003, available at: ftp://ftp.ripe.net/rfc/rfc3587.txt.
20. Route-View v6 database, available at: http://archive.routeviews.org/route-views6/bgpdata/.
21. T. Sherwood G. Varghese, B. CalderA, Pipelined memory architecture for high throughput network processors, in: Proceedings of the 30th International Symposium on Computer Architecture (ISCA), 2003, pp. 288-299.