官渡:一种用于命名数据MANET网络的缓存策略

    Guan Du: A Cache Strategy for Named Data MANET

    • 摘要: 针对在命名数据自组织移动网络(named data mobile ad hoc network, NDM)中,原命名数据网络(named data networking,NDN)默认的沿路径全缓存策略会占用网络节点上大量缓存空间,因而不适用于NDM中存储空间有限的移动节点问题,设计了一种适用于NDM的缓存算法,取名官渡策略,意在将最有用的内容布置在最合适的节点上响应尽可能多的兴趣包. 该算法基于间隔缓存等思路,综合考虑了节点间距离、节点缓存储空间和网络缓存分布等影响因素,并尽可能地简化以便使其具有可用性. 实验结果表明:官渡策略可以有效地减少缓存空间,并维持较高的应答率,代价是增加少量的网络流量和承担一部分的网络延迟. 官渡缓存策略相对简单,实现开销小,因此,更适合于节点存储空间小、计算能力有限的NDM网络.

       

      Abstract: The on-path caching strategy which usually is used in NDN(Named Data Networking) takes up much space on mobile nodes in NDM(named data mobile ad hoc network), so it doesn't fit for these mobile nodes which space is limited in NDM. To solve the problem, a caching strategy called GuanDu was designed. The name means that the most useful data is put on the fit node so that more interest packets can be met with the less space cost. Based on the interval Caching strategy, the node distance, caching space, and data distribution were considered in GuanDu. And it was designed to be simple so as to be feasible in NDM. The result of simulation proves that GuanDu can validly reduce the caching space and remain a higher response success ratio. The cost of GuanDu is more economic and GuanDu is more adaptive for NDM in which nodes have small space and limited computing ability.

       

    /

    返回文章
    返回