Full metadata record
DC FieldValueLanguage
dc.contributor.authorWang, PCen_US
dc.contributor.authorChan, CTen_US
dc.contributor.authorHu, SCen_US
dc.contributor.authorChen, YCen_US
dc.date.accessioned2014-12-08T15:26:51Z-
dc.date.available2014-12-08T15:26:51Z-
dc.date.issued2001en_US
dc.identifier.isbn0-7803-7093-7en_US
dc.identifier.urihttp://hdl.handle.net/11536/19105-
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, which complicates the IP lookup. Currently, this process is mainly done 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 EP lookups, our approach does not require the rule of BMP and thus significantly reduces the complexity. By applying our proposed approach, 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 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.subjectgiga networkingen_US
dc.subjectIP route lookupen_US
dc.titleRouting interval: A new concept for IP lookupsen_US
dc.typeProceedings Paperen_US
dc.identifier.journalJOINT 4TH IEEE INTERNATIONAL CONFERENCE ON ATM (ICATM'01) AND HIGH SPEED INTELLIGENT INTERNET SYMPOSIUMen_US
dc.citation.spage310en_US
dc.citation.epage315en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000170315600061-
Appears in Collections:Conferences Paper