检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘红宇 倪宏[1,2] 韩锐 LIU Hongyu;NI Hong;HAN Rui(Institute of Acoustics,Chinese Academy of Sciences,Beijing 100190,China;University of Chinese Academy of Sciences,Beijing 100049,China)
机构地区:[1]中国科学院声学研究所,北京100190 [2]中国科学院大学,北京100049
出 处:《电子设计工程》2025年第6期1-5,共5页Electronic Design Engineering
基 金:国家重点研发计划课题(2023YFB2906404)。
摘 要:面向利用缓存进行中继传输的场景,针对传统中继节点选择策略不能适应信息中心网络的缓存泛在化特性,造成的网络节点缓存空间浪费和中继请求成功率低等问题,提出了一种基于节点可用缓存空间和带宽的中继节点选择方法。该方法由边缘接入节点决策是否进行中继传输并维护选择过的中继节点的状态记录,根据节点状态依次考虑边缘节点的邻域节点和传输沿途节点的邻域节点,选择可能满足传输内容大小和带宽需求的中继节点。与随机选择、轮询选择和随路选择方案进行了仿真实验对比,所提出的方案相比随机选择方案,中继请求尝试次数降低了约69%,总吞吐量提高了约27%,平均传输完成时间缩短了约24%。Aiming at the scenario of using cache for relay transmission,a relay node selection method based on available cache space and bandwidth is proposed to address the issues of wasted network node cache space and low relay request success rate caused by the inability of traditional relay node selection strategies to adapt to the ubiquitous caching characteristics of Information-Centeric Network.The edge access node to decide whether to perform relay transmission and maintain the status records of the selected relay nodes.Based on the node status,the neighboring nodes of the edge node and the neighboring nodes of the nodes along the transmission route are sequentially considered,and relay nodes that may meet the transmission content size and bandwidth requirements are selected.Through simulation experiments comparing the proposed method with random selection,polling selection,and on-path selection methods,it was found that compared to the random selection scheme,the number of relay request attempts was reduced by about 69%,the total throughput was increased by about 27%and the average flow completion time was shortened by about 24%.
分 类 号:TP393.0[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.124