Department of Computer Networks and Systems, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland.
Sensors (Basel). 2023 Jan 2;23(1):485. doi: 10.3390/s23010485.
We performed a non-stationary analysis of a class of buffer management schemes for TCP/IP networks, in which the arriving packets were rejected randomly, with probability depending on the queue length. In particular, we derived formulas for the packet waiting time (queuing delay) and the intensity of packet losses as functions of time. These results allow us to observe how the evolution of the waiting time and losses depend on initial conditions (e.g., the full buffer) and system parameters (e.g., dropping probabilities, load, packet size distribution). As side results, the stationary waiting time and packet loss probability were obtained. Numerical examples demonstrate applicability of the theoretical results.
我们对一类 TCP/IP 网络的缓冲管理方案进行了非平稳分析，其中到达的数据包会随机被拒绝，其概率取决于队列长度。具体来说，我们推导出了数据包等待时间（排队延迟）和数据包丢失强度作为时间函数的公式。这些结果使我们能够观察等待时间和丢失的演变如何取决于初始条件（例如，满缓冲区）和系统参数（例如，丢弃概率、负载、数据包大小分布）。作为次要结果，得到了平稳等待时间和数据包丢失概率。数值示例证明了理论结果的适用性。
