Multi-resolution tree for longest match address lookups
作者： John Chanak , Antoni B. Przygienda
DOI:
关键词: Tree (descriptive set theory) 、 Computer science 、 Default route 、 Longest prefix match 、 Computer network 、 Multi resolution 、 Routing table 、 Value (computer science) 、 Network packet 、 Prefix
摘要: A method and apparatus for forwarding packets in a network is described. routing table constructed using p-structures. An address packet received. The matched with longest prefix stored the table. decision value associated retrieved. forwarded accordance value.
lens.org 参考文章(15)
Ronald M. Parker, Mark G. Libby, Closed user group preprocessing decision for efficient call security validation ,(1998)
Yakov Rekhter, Efficient packet forwarding arrangement for routing packets in an internetwork ,(1996)
Andrej Brodnik, Mikael Degermark, Svante Carlsson, Stephen Pink, Fast routing lookup system using complete prefix tree, bit vector, and pointers in a routing table for determining where to route IP datagrams ,(1998)
Hong-Yi Tzeng, High speed routing using compressed tree process ,(1998)
George Frank Irwin, Address lookup in packet data communication networks ,(1998)
Philippe Bazot, Marc Lamberton, Didier Avargues, Jean-Francois Bortolotti, Method and system for performing a least cost routing function for data communications between end users in a multi-network environment ,(1997)
Radia J. Perlman, Method and apparatus for determining a longest matching prefix from a dictionary of prefixes ,(1997)
Hemant Kanakia, Roy Illingworth, Bakul Shah, Ritesh Ahuja, System and method for locating a route in a route table using hashing and compressed radix tree searching ,(1997)
Raymond Kloth, Derived VLAN mapping technique ,(2001)
Srinivasan Venkatachary, George Varghese, Method and apparatus for fast hierarchical address lookup using controlled expansion of prefixes ,(1997)