An active routing prefix caching algorithm for IP address lookup

A lot of IP address lookup algorithms have been widely studied. Among them we have thorough investigated the caching based algorithms. It is based on the locality assumption of Intenet traffic which is questionable especially in high speed backbone. There is enough locality if routing prefixes are c...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2009 Fourth International Conference on Communications and Networking in China s. 1 - 6
Hlavní autoři: Guo-sheng Zhu, Shao-hua Yu, Jin-you Dai
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.08.2009
Témata:
Clocks
Computer science
Costs
Explosions
Internet
IP address lookup
Logic
Optical fiber communication
prefix caching
prefix covering
Routing
Spine
Wavelength division multiplexing
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A lot of IP address lookup algorithms have been widely studied. Among them we have thorough investigated the caching based algorithms. It is based on the locality assumption of Intenet traffic which is questionable especially in high speed backbone. There is enough locality if routing prefixes are cached instead of individual IP addresses. However the previous prefix caching scheme need to do complete or partial prefix expansion to cache corresponding prefix which will lead to prefix table explosion and make incremental updates difficult. A new active prefix caching algorithm based on prefixes covering relationship is proposed in this paper. Incremental updates are supported without prefix expansion. Performance evaluation shows our proposed scheme has higher cache hit rate, less memory space than previous schemes.
DOI:10.1109/CHINACOM.2009.5339861