首页> 外文会议>International Conference on Communications and Networking in China >An Active Routing Prefix Caching Algorithm For IP Address Lookup
【24h】

An Active Routing Prefix Caching Algorithm For IP Address Lookup

机译:IP地址查找的主动路由前缀缓存算法

获取原文

摘要

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.
机译:很多IP地址查找算法已被广泛研究。其中我们已经彻底调查了基于缓存的alcorithms.it基于InteNet业务的位置假设,这些流量是质疑的,特别是在高速骨干中。如果缓存路由前缀而不是单独的IP地址,则有足够的位置。然而,以前的前缀缓存方案需要完成完整或部分前缀扩展以缓存对应的前缀,这将导致前缀表爆炸并使增量更新变得困难。在本文中提出了一种基于前缀的基于前缀的新的Active Prefix缓存算法。在没有前缀扩展的情况下支持更新的难题更新。秘密评估显示我们所提出的方案具有更高的缓存命中率,更少的内存空间比以前的方案更少。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号