论文标题
建模M/M/M/R-JSQ-PS超可靠性低潜伏期通信服务的Sojourn时间分布
Modelling M/M/R-JSQ-PS sojourn time distribution for Ultra-Reliable Low Latency Communication services
论文作者
论文摘要
未来的互联网有望支持需要超低潜伏期和可靠性99.99％的时间敏感服务。细胞和WiFi连接的最新进展增强了网络，以达到高可靠性和超低潜伏期。但是，上述服务要求服务器处理时间确保可靠性高的低潜伏期，否则无法满足端到端性能。为此，在本文中，我们使用排队理论对M/M/M/R-JSQ-PS系统的超可靠性低潜伏通信服务的索期时间分布进行建模：Markovian队列带有R CPU服务器后，加入了最短的队列处理器共享分享门户（例如Linux Systems）。我们开发开源模拟软件，并开发和比较六个分布分布的六个分析近似值。提出的近似值在2个时间单位以下的距离造成的距离，而在中等载荷下，在第99.99个百分位数的索期时，误差小于1.78个时间单位（例如，毫秒）。此外，所提出的寄宿时间近似是稳定的，无论CPU的数量如何，并且保持靠近模拟。
The future Internet promises to support time-sensitive services that require ultra low latencies and reliabilities of 99.99%. Recent advances in cellular and WiFi connections enhance the network to meet high reliability and ultra low latencies. However, the aforementioned services require that the server processing time ensures low latencies with high reliability, otherwise the end-to-end performance is not met. To that end, in this paper we use queuing theory to model the sojourn time distribution for Ultra-Reliable Low Latency Communication services of M/M/R-JSQ-PS systems: Markovian queues with R CPU servers following a join shortest queue processor-sharing discipline (for example Linux systems). We develop open-source simulation software, and develop and compare six analytical approximations for the sojourn time distribution. The proposed approximations yield Wasserstein distances below 2 time units, and upon medium loads incur into errors of less than 1.78 time units (e.g., milliseconds) for the 99.99th percentile sojourn time. Moreover, the proposed sojourn time approximations are stable regardless the number of CPUs and stay close to the simulations.
