Parallel searching techniques for routing table lookup

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

This paper proposes an implementation of the PATRICIA radix searching algorithm on a linear pipelined array of processors. The implementation is described in detail and then evaluated in terms of the technology requirements, system performance and robustness.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
PublisherPubl by IEEE
Pages1400-1405
Number of pages6
ISBN (Print)0818635800
StatePublished - Jan 1 1993
Externally publishedYes
EventProceedings of the 12th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM '93 - San Francisco, CA, USA
Duration: Mar 30 1993Apr 1 1993

Publication series

NameProceedings - IEEE INFOCOM
Volume3
ISSN (Print)0743-166X

Other

OtherProceedings of the 12th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM '93
CitySan Francisco, CA, USA
Period3/30/934/1/93

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Knox, D., & Panchanathan, S. (1993). Parallel searching techniques for routing table lookup. In Proceedings - IEEE INFOCOM (pp. 1400-1405). (Proceedings - IEEE INFOCOM; Vol. 3). Publ by IEEE.