Parallel searching techniques for routing table lookup

Author

Knox, D. ; Panchanathan, S.

Author_Institution

Bell-Northern Res. Ltd., Ottawa, Ont., Canada

fYear

1993

fDate

1993

Firstpage

1400

Abstract

The routing table lookup function is described, and recent research is reviewed, focusing on multiprocessor implementations. An implementation of the PATRICIA (practical algorithm to retrieve information coded in alphanumeric) radix searching algorithm on a linear pipelined array of processors is proposed. The implementation is described in detail and then evaluated in terms of the technology requirements, system performance, and robustness

Keywords

parallel algorithms; pipeline processing; table lookup; telecommunication equipment; telecommunication network routing; telecommunications computing; PATRICIA; alphanumeric coded information retrieval; linear pipelined array; multiprocessor; parallel searching techniques; practical algorithm; processor array; research; robustness; routing table lookup; system performance; CADCAM; Computer aided manufacturing; Computer architecture; Parallel algorithms; Random access memory; Read-write memory; Robustness; Routing; System performance; Table lookup;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '93. Proceedings.Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future, IEEE

Conference_Location

San Francisco, CA

Print_ISBN

0-8186-3580-0

Type

conf

DOI

10.1109/INFCOM.1993.253405

Filename

253405