Range Trie Software Support for Longest Prefix Match
作者： C. Mastrogeorgopoulos
DOI:
关键词:
摘要: The range trie constitutes an advanced address lookup scheme aiming at low throughput, latency and memory requirements. structure has been enhanced with longest prefix match updating capabilities in order to simulate the forwarding process performed network routers. For main work involved this thesis we fixed, improved, performance introduced additional functionality software implementation of heuristics which generate high quality configurations based on bounds extracted from tables. With our work, is capable producing for a great possible hardware implementations, any length (IPv4 IPv6 among others), size tables relatively time. As supplementary developed support IPv4 HTX reconfigurable platform. translates generated configuration into suitable commands software/hardware interface also offers all necessary verifying maintaining configuration.
tudelft.nl参考文章(21)
D.J.A. Van Adrichem, Design and Prototype of the Range-Trie IP: Lookup in the HTX reconfigurable platform TU Delft, Delft University of Technology. ,(2011)
G. Stefanakis, Design and Implementation of a Range Trie for Address Lookup TU Delft, Delft University of Technology. ,(2009)
Pankaj Gupta, Nick McKeown, Packet Classification using Hierarchical Intelligent Cuttings ,(1999)
William N. Eatherton, Zubin D. Dittia, Tree bitmap data structures and their use in performing lookup operations ,(2004)
Keith Sklower, A Tree-Based Packet Routing Table for Berkeley Unix. USENIX Winter. pp. 93- 104 ,(1991)
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese, An Improved Construction for Counting Bloom Filters Lecture Notes in Computer Science. pp. 684- 695 ,(2006) , 10.1007/11841036_61
V. Fuller, K. Varadhan, J. Yu, T. Li, Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy RFC 1519. ,vol. 1519, pp. 1- 24 ,(1993)
Priyank Warkhede, Subhash Suri, George Varghese, Multiway range trees: scalable IP lookup with fast updates Computer Networks. ,vol. 44, pp. 289- 303 ,(2004) , 10.1016/J.COMNET.2003.09.004
M.A. Ruiz-Sanchez, E.W. Biersack, W. Dabbous, Survey and taxonomy of IP address lookup algorithms IEEE Network. ,vol. 15, pp. 8- 23 ,(2001) , 10.1109/65.912716
Mikael Degermark, Andrej Brodnik, Svante Carlsson, Stephen Pink, Small forwarding tables for fast routing lookups acm special interest group on data communication. ,vol. 27, pp. 3- 14 ,(1997) , 10.1145/263105.263133