A fast IP lookup algorithm with low space complexity
碩士 === 國立交通大學 === 資訊工程系 === 89 === Nowadays, IP address lookup is becoming critical because of increasing routing table sizes, speed, and traffic in the Internet. With classless interdomain routing (CIDR), routers must find out the best matching prefix (BMP) for IP packets forwarding, whi...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/97139473266183700084 |