• DocumentCode
    2721864
  • Title

    IP route lookups as string matching

  • Author

    Donnelly, Austin ; Deegan, Tim

  • Author_Institution
    Comput. Lab., Cambridge Univ., UK
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    589
  • Lastpage
    595
  • Abstract
    An IP route lookup can be considered as a string matching problem on the destination address. Finite state automata (FSA) are a flexible and efficient way to match strings. This paper describes how a routing table can be encoded as an FSA and how, through a process of state reduction, we can obtain an optimal representation. This gives insights into the basic properties of the longest-prefix match problem
  • Keywords
    finite automata; string matching; table lookup; telecommunication network routing; transport protocols; IP route lookups; destination address; finite state automata; longest-prefix match problem; optimal representation; routing table encoding; state reduction; string matching; Automata; Data structures; Hardware; Laboratories; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Local Computer Networks, 2000. LCN 2000. Proceedings. 25th Annual IEEE Conference on
  • Conference_Location
    Tampa, FL
  • ISSN
    0742-1303
  • Print_ISBN
    0-7695-0912-6
  • Type

    conf

  • DOI
    10.1109/LCN.2000.891104
  • Filename
    891104
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2721864