Cached IP routing tree for longest prefix search
作者： Eric Lin , Steven Hsieh , George Cravens , James Huang , Ilya Dorfman
DOI:
关键词:
摘要: Architecture for processing routing information in a data network. A set of entries is provided database first storage location. subset the created second location, which are structure an IP tree. Packet incoming packet extracted, includes multiple byte parts. The location accessed to compare parts sequentially with respective determine forwarding information. adjusted dynamically response availability entries.
lens.org 参考文章(5)
Hong-Yi Tzeng, Method for IP routing table look-up ,(1998)
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)
Fabrice Jean Verplanken, Antonios Maragkos, Piyush Chunilal Patel, Brian Mitchell Bass, Jean Louis Calvignac, Michael Steven Siegel, Marco C. Heddes, Full match (FM) search algorithm implementation for a network processor ,(2003)
Marco C. Heddes, Fabrice Jean Verplanken, Antonios Maragkos, Piyush Chunilal Patel, Brian Mitchell Bass, Jean Louis Calvignac, Michael Steven Siegel, Longest prefix match (lpm) algorithm implementation for a network processor ,(2005)
Kazuo Sugai, Yoshihito Sako, Hiroshi Sekino, Takeshi Aimoto, Shinichi Akahane, Nobuhito Matsuyama, Packet relaying apparatus and high speed multicast system ,(1999)