Memory-efficient state lookups with fast updates.

Routers must do a best matching prefix lookup for every packet; solutions for Gigabit speeds are well known. As Internet link speeds higher, we seek a scalable solution whose speed scales with memory speeds while allowing large prefix databases. In this paper we show that providing such a solution r...

Full description

Bibliographic Details
Published in:	Computer communication review. 30, 4 (2000).
Main Author:	Sikka, Sandeep
Format:	Article
Language:	English
Subjects:	Computer systems organization. Computer communication networks. Local and wide area networks. Internet (e.g., TCP/IP). Memory structures. Semiconductor memories. Static memory (SRAM). Network protocols. TCP IP. Internetworking. Routers. Algorithms. Design. Experimentation. Measurement. Performance. Standardization. Theory.