处理延迟
排队论
端到端延迟
计算机科学
网络数据包
传输延迟
上下界
排队延迟
航程(航空)
泊松分布
网络延迟
路径(计算)
算法
实时计算
拓扑(电路)
计算机网络
数学
组合数学
统计
数学分析
复合材料
材料科学
出处
期刊:IRE transactions on communications systems
[Institute of Electrical and Electronics Engineers]
日期:1976-02-01
卷期号:24 (2): 210-222
被引量:28
标识
DOI:10.1109/tcom.1976.1093274
摘要
A technique is presented for the derivation of approximate average packet time-delay formulas in a packet-switching store-and-forward network. The approximation technique appropriately incorporates arrival and departure packet interferences with the recent queueing results in a noninterfered communication path. Simulation results, for basic flow configurations, show the approximate timedelay function to constitute a very close lower bound over wide range of traffic intensities. The resulting average time-delay approximation when a Poisson assumption is made, is shown to constitute an upper bound. A procedure for approximate network time-delay analysis is then presented.
科研通智能强力驱动
Strongly Powered by AbleSci AI