ChinaCom2009-Frontiers on Communications and Networking Symposium

Research Article

An Active Routing Prefix Caching Algorithm For IP Address Lookup

  • @INPROCEEDINGS{10.1109/CHINACOM.2009.5339861,
        author={Guo-sheng Zhu and Shao-hua Yu and Jin-you Dai},
        title={An Active Routing Prefix Caching Algorithm For IP Address Lookup},
        proceedings={ChinaCom2009-Frontiers on Communications and Networking Symposium},
        publisher={IEEE},
        proceedings_a={CHINACOM2009-FCN},
        year={2009},
        month={11},
        keywords={prefix caching prefix covering IP address lookup.},
        doi={10.1109/CHINACOM.2009.5339861}
    }
    
  • Guo-sheng Zhu
    Shao-hua Yu
    Jin-you Dai
    Year: 2009
    An Active Routing Prefix Caching Algorithm For IP Address Lookup
    CHINACOM2009-FCN
    IEEE
    DOI: 10.1109/CHINACOM.2009.5339861
Guo-sheng Zhu1, Shao-hua Yu1,*, Jin-you Dai1,*
  • 1: School of Computer Science and Technology Huazhong University of Science and Technology Wuhan,430074
*Contact email: shyu@fhn.com, jydai@fhn.com.cn

Abstract

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. Perfermance evalulation shows our proposed scheme has higher cache hit rate,less memory space than previous schemes.