Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wang, PC | en_US |
dc.contributor.author | Chan, CT | en_US |
dc.contributor.author | Chen, YC | en_US |
dc.date.accessioned | 2014-12-08T15:44:07Z | - |
dc.date.available | 2014-12-08T15:44:07Z | - |
dc.date.issued | 2001-03-01 | en_US |
dc.identifier.issn | 1089-7798 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1109/4234.913161 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/29792 | - |
dc.description.abstract | A major issue in router design for the next generation Internet is the fast IP address lookup mechanism. The existing scheme by Huang et al. performs the IP address lookup in hardware in which the forwarding table can be compressed to fit into reasonable-size SRAM, and a lookup can be accomplished in three memory accesses. In this letter, we claim that with a little extra memory, it is able to further reduce the lookup time to two memory accesses. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | gigabit networking | en_US |
dc.subject | Internet | en_US |
dc.subject | IP address | en_US |
dc.subject | lookup | en_US |
dc.title | A fast IP routing lookup scheme | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1109/4234.913161 | en_US |
dc.identifier.journal | IEEE COMMUNICATIONS LETTERS | en_US |
dc.citation.volume | 5 | en_US |
dc.citation.issue | 3 | en_US |
dc.citation.spage | 125 | en_US |
dc.citation.epage | 127 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000167766300017 | - |
dc.citation.woscount | 8 | - |
Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.