基于网络演算的聚合模型分析方法及其评估  

Analysis and Evaluation of Delay Bounds for Multiplexing Models Based on Network Calculus

作　　者：龙彦辰[1] 沈海斌[1] 鲁中海[2] LONG Yan-chen;SHEN Hai-bin;LU Zhong-hai(Institute of VLSI Design,Zhejiang University,Hangzhou,Zhejiang 310027,China;KTH Royal Institute of Technology,Stockholm 16440,Sweden)

机构地区：[1]浙江大学超大规模集成电路设计研究所,浙江杭州310027 [2]瑞典皇家工学院,斯德哥尔摩16440

出　　处：《电子学报》2018年第8期1815-1821,共7页Acta Electronica Sinica

摘　　要：在资源共享的通信媒介中,例如总线、交叉矩阵、网络,聚合模型的应用十分普遍.经由聚合节点发送的数据包的延迟上界可以通过网络演算理论得到,然而对于这种延迟上界紧致性的研究一直以来都是开放性问题.本文基于网络演算理论,讨论了单节点、多节点聚合模型的分析方法,包括两种到达曲线模型、两种等价服务曲线分析方法.同时以实验手段对延迟上界的紧致性进行了经验性的评估.最后作为结论,本文归纳了各种分析模型的质量,总结了各个参数是如何影响延迟上界的紧致性的.In resource-sharing communication media such as buses,crossbars and networks,multiplexings are inevitable.While sending packets over a multiplexing node,the worst-case delay bound can be computed using network calculus.The tightness of such delay bound remains an open problem.This paper studies different analysis approaches for multiplexing models,from the single multiplexing node to multi-flow-multi-node model,applying two traffic arrival models,and two service properties when getting equivalent service curves.We analyze per-flow delay bounds with different models,then empirically evaluate the tightness of the delay bounds.Our results show the quality of different analysis models,and how influential each parameter is to tightness.

关 键 词：网络演算 聚合模型 延迟上界 紧致性 

分 类 号：TP302[自动化与计算机技术—计算机系统结构]