CAJ | 학술논문

内容分发网络中基于内容名的缓存算法会导致路由表规模随网络增长而膨胀，将严重影响网络路由效率和性能。针对该问题，提出一种基于相关内容吸引的节点缓存算法。利用本地缓存算法，通过节点已缓存内容对其他内容的吸引作用吸引主要特征内容，排斥具有次要特征内容，将缓存中不同特征内容的数量差异进行放大，使缓存内容表现出明显稳定的内容特征。同时设计相关内容生存时间相互增强的缓存策略，以减少路由通告信息量，提高内容分发网络的路由能力。实验结果表明，该算法在有效解决路由问题的同时，能增强缓存内容稳定性，提高路由可信度。
내용분발망락중기우내용명적완존산법회도치로유표규모수망락증장이팽창，장엄중영향망락로유효솔화성능。침대해문제，제출일충기우상관내용흡인적절점완존산법。이용본지완존산법，통과절점이완존내용대기타내용적흡인작용흡인주요특정내용，배척구유차요특정내용，장완존중불동특정내용적수량차이진행방대，사완존내용표현출명현은정적내용특정。동시설계상관내용생존시간상호증강적완존책략，이감소로유통고신식량，제고내용분발망락적로유능력。실험결과표명，해산법재유효해결로유문제적동시，능증강완존내용은정성，제고로유가신도。
The existing content cache algorithm of Content Delivery Network( CDN) leads to the expansion of routing table with the network increasing,which will impair the routing efficiency and network performance. Therefore,based on related contents attracting,a related contents attracting algorithm is proposed. With the effect of attracting similar contents cached in other near nodes,for the purpose of apparently stable featured contents of nodes cached,the algorithm attracts major characteristic contents, rejects secondary feature contents, and enlarges the difference of different characteristic content. It also gathers the related contents on the same nodes via the mutual attraction with same contents feature,which facilitates the cache contents feature abstraction. Meanwhile,the strategy of lifetime increasement between contents with main feature is designed to deduce the routing advertisement and improve the routing scalability. Experimental results show that the proposed algorithm can reduce the update frequency of cache content,and improve the routing reliability.