Longest prefix match operations

A method of matching an entry in a list, e.g. phone number prefixes to data, e.g. phone numbers, by writing source code, preferably using nested switch statements, to match an entry in a list to data by sorting the list and turning it into a tree, preferably partitioning the tree into a plurality of...

Full description

Saved in:
Bibliographic Details
Main Authors KULDEEP NIGAM, ERIC BOUILLET, VIBHORE KUMAR, ANAND RANGANATHAN, DEEPAK SRINIVAS TURAGA, SWATI SHAH, LAURENT SEBASTIEN MIGNET
Format Patent
LanguageEnglish
Published 08.05.2013
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:A method of matching an entry in a list, e.g. phone number prefixes to data, e.g. phone numbers, by writing source code, preferably using nested switch statements, to match an entry in a list to data by sorting the list and turning it into a tree, preferably partitioning the tree into a plurality of disjoint trees and then compiling the source code and running that code to match an entry in a list to data.
Bibliography:Application Number: GB20120018825