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:43:11Z-
dc.date.available2014-12-08T15:43:11Z-
dc.date.issued2001-12-01en_US
dc.identifier.issn1229-2370en_US
dc.identifier.urihttp://hdl.handle.net/11536/29235-
dc.description.abstractNowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, this complicates the IP lookup. Currently, this process is mainly performed in software and several schemes have been proposed for hardware implementation. Since the IP lookup performance is a major design issue for the new generation routers, in this article we investigate the properties of the routing table and present a new approach for IP lookups, our approach is not based on BMP and significantly reduces the complexity, thus the computation cost of existing schemes can be significantly reduced. We also propose an efficient IP lookup algorithm, with which we improve the binary search on prefixes to 30 millions of packets per second (MPPS) and 5,000 route updates/s under the same experiment setup with an even larger routing table.en_US
dc.language.isoen_USen_US
dc.subjectInterneten_US
dc.subjectgigabit networkingen_US
dc.subjectIP address lookupen_US
dc.titleAn efficient IP routing lookup by using routing intervalen_US
dc.typeArticleen_US
dc.identifier.journalJOURNAL OF COMMUNICATIONS AND NETWORKSen_US
dc.citation.volume3en_US
dc.citation.issue4en_US
dc.citation.spage374en_US
dc.citation.epage382en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000173294900011-
dc.citation.woscount2-
Appears in Collections:Articles


Files in This Item:

  1. 000173294900011.pdf

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.