Please use this identifier to cite or link to this item:
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorLuk, RWP-
dc.creatorWong, WT-
dc.rightsAssignee: The Hong Kong Polytechnic University.en_US
dc.titleString lookup using three-transition tree structureen_US
dc.description.otherinformationUS8538999; US8538999 B2; US8538999B2; US 8,538,999; US 8,538,999 B2; 8538999; Appl. No. 13/433,053en_US
dc.description.otherinformationInventor name used in this publication: Robert Wing Pong Luken_US
dcterms.abstractA tree data structure for storing strings of searchable data divided into substrings has at least one first type node that has a substring associated with it and at least one second type node that does not having a substring associated with it. A second type node is directly linked to a first type node by a fail transition. A first type node is directly linked to a second type node by a match transition. An IP address lookup system has memory for storing a tree data structure and a controller for storing and loading an incoming IP address. The system has a finite state machine having three stages including a first stage for loading the IP address and performing a length calculation, a second stage for searching the data structure to find a match, and a third stage for determine the next-hop address index.-
dcterms.bibliographicCitationUS Patent 8,538,999 B2. Washington, DC: US Patent and Trademark Office, 2013.-
dc.description.oaVersion of Recorden_US
Appears in Collections:Patent
Files in This Item:
File Description SizeFormat 
us8538999b2.pdf1.42 MBAdobe PDFView/Open
Show simple item record

Page views

Last Week
Last month
Citations as of Jun 26, 2022


Citations as of Jun 26, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.