Item 10203/162
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Park, DH | ko |
| dc.contributor.author | Cho, Dong-Ho | ko |
| dc.date.accessioned | 2007-05-18T06:09:55Z | - |
| dc.date.available | 2007-05-18T06:09:55Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 2006-03 | - |
| dc.identifier.citation | IEEE COMMUNICATIONS LETTERS, v.10, no.3, pp.207 - 209 | - |
| dc.identifier.issn | 1089-7798 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/162 | - |
| dc.description.abstract | Traditionally, IP address lookup has been conducted by longest prefix search or by using expensive hardware. In this article, we apply a set searching process to perform IP address lookup and propose the combined use of hardware and software. Our method enables the search of the network ID of an incoming IP address within a short time at low hardware cost. | - |
| dc.language | English | - |
| dc.language.iso | en_US | en |
| dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000237547000027 | - |
| dc.identifier.scopusid | 2-s2.0-33644878853 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 10 | - |
| dc.citation.issue | 3 | - |
| dc.citation.beginningpage | 207 | - |
| dc.citation.endingpage | 209 | - |
| dc.citation.publicationname | IEEE COMMUNICATIONS LETTERS | - |
| dc.identifier.doi | 10.1109/LCOMM.2006.1603386 | - |
| dc.embargo.liftdate | 9999-12-31 | - |
| dc.embargo.terms | 9999-12-31 | - |
| dc.contributor.localauthor | Cho, Dong-Ho | - |
| dc.description.isOpenAccess | N | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | IP address lookup | - |
| dc.subject.keywordAuthor | routing | - |
- Appears in Collection
- EE-Journal Papers(저널논문)
- Files in This Item
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 1 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.