Lancaster EPrints

Fast routing lookup system using complete prefix tree, bit vector, and pointers in a routing table for determining where to route IP datagrams.

Pink , Stephen (2001) Fast routing lookup system using complete prefix tree, bit vector, and pointers in a routing table for determining where to route IP datagrams. 6266706.

Full text not available from this repository.
Item Type: Patent
Additional Information: This patent describes a novel technique for storing IP routing tables using complete prefix trees - enabling the complete forwarding table in the core Internet to be stored in the level two cache of common microprocessors and obviating the need to make memory references to slower DRAM memory during address lookups. The result of this discovery was the ability to build IP routers on stock PC hardware. To exploit this innovation the authors co-founded Effnet, Inc. At its peak, Effnet employed more than 100 people and had a market capitalization of more than 100 million pounds. RAE_import_type : Patent / published patent application RAE_uoa_type : Computer Science and Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments: Faculty of Science and Technology > School of Computing & Communications
ID Code: 2597
Deposited By: ep_importer
Deposited On: 28 Mar 2008 11:54
Refereed?: No
Published?: Published
Last Modified: 09 Apr 2014 20:53
Identification Number: 6266706
URI: http://eprints.lancs.ac.uk/id/eprint/2597

Actions (login required)

View Item