检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:尹淑文 汪硕 黄韬[1,2] YIN Shuwen;WANG Shuo;HUANG Tao(State Key Laboratory of Networking and Switching Technology,Bei-jing University of Posts and Telecommunications,Beijing 100876,China;Purple Mountain Laboratories,Nanjing 211111,China)
机构地区:[1]北京邮电大学网络与交换国家重点实验室,北京100876 [2]紫金山实验室未来网络中心,南京211111
出 处:《中兴通讯技术》2022年第1期21-28,共8页ZTE Technology Journal
摘 要:时间敏感网络(TSN)中循环队列转发(CQF)机制保留了时间感知整形中门控调度的转发可控特性,同时又降低了门控列表配置的复杂度,但是缓存队列的长度作为一个关键参数直接影响着网络的调度性能,并且在实现时受到硬件资源的约束。为了寻找到合适的CQF队列长度值以实现网络系统设计的性能和成本的优化,提出了一个基于网络演算的CQF性能分析方法。通过曲线模型的构建和计算,分析流量传输时延和积压的性能上界值,从而选择出合适的队列长度值。通过不同场景的实验,得到了不同流特性参数对队列长度选择的影响。Cyclic queue forwarding(CQF)in time-sensitive networking(TSN)remains the forwarding controllability based on gated scheduling in time-aware shaper and reduces the complexity of the configuration of gate control lists.However,as a key parameter,the length of CQF queues directly affects the performance of network scheduling and is constrained by hardware resources in implementation.In order to find the appropriate value of CQF queue length to realize the performance and cost optimization of network system design,a performance analysis method of CQF-based networks based on network calculus is proposed.Through the construction of curve model and calculation,the upper bounds of delay and backlog of data traffic transmission are analyzed.Then the appropriate length of CQF queues can be selected according to these analysis results.Experiments are conducted in different scenarios,and the influence of different flow characteristic parameters on the selection of queue length is obtained.
关 键 词:时间敏感网络 循环队列转发 网络演算 性能分析 队列长度分析
分 类 号:TP393.0[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.170