论文标题
数据包切换网络中的端到端延迟近似
End-to-End Delay Approximation in Packet-Switched Networks
论文作者
论文摘要
在本文中，我开发了一种广义方法，以在包装转换网络（PSN）（PSN）中近似端到端延迟（平均延迟，抖动和密度功能）的任何大小以下1）kleinrock的独立性假设（KIA）和2时，当包装长度从node to node to node to node to newets nettory the网络中，替代kle）的独立性（kle）的独立性（kle）是独立的，而kleinri则是一个独立的kleinr，则可以保持不变。我引入了一个新的相型分布$ c（\ mathbf {p}，\boldsymbolθ）$;然后使用网络流理论和排队理论的结果表明，起亚和AKIA下的PSN的端到端延迟是两个不同的随机变量，该变量近似于$ c（\ Mathbf {p}，\boldsymbolθ）$。当PSN具有AKIA时，我从模拟中表明，AKIA下的方法显着降低了端到端延迟近似误差，并与KIA下的方法相比提供了近似值。
In this paper, I develop a generalized method to approximate end-to-end delay (average delay, jitter and density functions) in packet-switched networks (PSNs) of any size under 1) Kleinrock's independence assumption (KIA) and 2) when packet lengths are kept unchanged when they traverse from node to node in a network, which is an Alternative to Kleinrock's independence assumption (AKIA). I introduce a new phase-type distribution $C(\mathbf{p},\boldsymbol θ)$; and then use results from the network flow theory and queueing theory to show that the end-to-end delay in PSNs under KIA and AKIA are two different random variables approximately described by $C(\mathbf{p},\boldsymbol θ)$. When PSNs have AKIA, I show from simulation that the method under AKIA significantly reduces end-to-end delay approximation errors and provides close approximation compared with the method under KIA.
