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...
| Опубліковано в:: | Computer communication review. 30, 4 (2000). |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | Англійська |
| Предмети: |