A pipelined routing lookup scheme with fast updates
- Authors
- Kim, BY; Choi, YH
- Issue Date
- 1-Sep-2003
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- forwarding engine; IP route lookup; fast updates; bounded update time
- Citation
- COMPUTER COMMUNICATIONS, v.26, no.14, pp.1594 - 1601
- Journal Title
- COMPUTER COMMUNICATIONS
- Volume
- 26
- Number
- 14
- Start Page
- 1594
- End Page
- 1601
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/25934
- DOI
- 10.1016/S0140-3664(02)00242-6
- ISSN
- 0140-3664
- Abstract
- Most of the existing IP address lookup schemes emphasize the table lookups with little attention to table updates. Updating the routing table often requires a considerable time overhead, especially for gigabit backbone routers. This paper presents a high-speed lookup scheme with a small bounded update time for IP forwarding engines in IP routers. It performs one IP address lookup per memory access by employing memory access pipelining and updates the table in the time bounded by the IP packet interarrival time on a gigabit link, regardless of the size of the database. The resulting design requires manageably small memories to be implemented using current SRAM technology. (C) 2002 Elsevier Science B.V. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Department of General Studies > Department of General Studies > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/25934)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.