Full metadata record
DC FieldValueLanguage
dc.contributor.authorWang, PCen_US
dc.contributor.authorChan, CTen_US
dc.contributor.authorChen, YCen_US
dc.date.accessioned2014-12-08T15:26:57Z-
dc.date.available2014-12-08T15:26:57Z-
dc.date.issued2000en_US
dc.identifier.isbn0-7803-6283-7en_US
dc.identifier.issn1550-3607en_US
dc.identifier.urihttp://hdl.handle.net/11536/19177-
dc.description.abstractA major design issue for the next generation routers is the 1P lookup mechanism. The router needs to perform a longest prefix matching on the address lookup for each incoming packet to determine the next hop. Currently, the process is done in software and has become a major performance bottleneck of the router. In this paper, we propose a fast IP lookup mechanism in which the forwarding table is small enough to fit in SRAM with very low cost. It also can be implemented in hardware using the pipeline technique. A large routing table with 45,000 routing prefixes can be compressed to a forwarding table with about 430 Kbytes in size by using our proposed method. In the worst case, the number of memory accesses for a lookup is three. When implemented in pipeline technique, the proposed mechanism can achieve one routing lookup per memory access. With current ions SRAM, this mechanism provides approximately 100 million routing lookups per second. Futhermore, the lookup speed can be improved linearly through the speedup of the memory access.en_US
dc.language.isoen_USen_US
dc.subjectInterneten_US
dc.subjectgigabit networkingen_US
dc.titleA fast IP routing lookup schemeen_US
dc.typeProceedings Paperen_US
dc.identifier.journalICC 2000: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CONFERENCE RECORD, VOLS 1-3: GLOBAL CONVERGENCE THROUGH COMMUNICATIONSen_US
dc.citation.spage1140en_US
dc.citation.epage1144en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000089018200224-
Appears in Collections:Conferences Paper