会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 16. 发明申请
    • METHOD FOR CACHING CONTENT DATA PACKAGES IN CACHING NODES
    • 在缓存中缓存内容数据包的方法
    • US20090119455A1
    • 2009-05-07
    • US12256560
    • 2008-10-23
    • Andrey KiselDave Cecil Robinson
    • Andrey KiselDave Cecil Robinson
    • G06F12/08
    • H04L67/104H04L67/1093H04L67/2819H04L67/2847H04L67/2852H04L67/288H04L67/2885
    • A method for caching content data packages in caching nodes 2 of a network 1 comprising a plurality of nodes 2,8 and a plurality of data lines 5 that extend between adjacent of said nodes 2,8, wherein content data traffic is to be routed on traffic connections between a content data library server 7 and user nodes 8 is proposed.The method is comprising the steps of assigning a popularity value of each content data package to each caching node 2 having at least one user node 8 as an adjacent node, calculating a weighted request probability for each content data package at each caching node 2, preferably by combining each popularity value with a distance from the respective caching node 2 to the caching node to which the respective popularity value is assigned to, deciding which of the weighted request probabilities of the content data packages are fulfilling a predefined condition, and caching the respective content data packages in the caching nodes at which the weighted request probability of the content data package fulfils said predefined condition.
    • 一种用于在网络1的高速缓存节点2中缓存内容数据包的方法,包括在所述节点2,8的相邻之间延伸的多个节点2,8和多个数据线5,其中内容数据业务将被路由到 提出内容数据库服务器7与用户节点8之间的业务连接。 该方法包括以下步骤:将每个内容数据包的流行度值分配给具有至少一个用户节点8作为相邻节点的每个高速缓存节点2,优选地计算每个高速缓存节点2处的每个内容数据包的加权请求概率 通过将每个流行度值与从相应的缓存节点2到分配相应流行度值的缓存节点的距离组合,确定内容数据包的加权请求概率中的哪一个正在满足预定条件,并且缓存相应的 高速缓存节点中的内容数据包,其中内容数据包的加权请求概率满足所述预定义条件。