arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2011.06935cs.NIcs.NAmath.NA
收藏

新一代网络中路径发现MTU的数学分析

Mathematical Analysis of Path MTU Discovery With New Generation Networks

Ishfaq Hussain, Janibul Bashir

摘要:

本文从数学、逻辑和图形三个方面介绍了IPv4和IPv6中路径发现的作用。我们试图给出一个数学模型的路径mtu发现的工作,并计算其行为使用一个数据包的传输。我们分析了在IPv6网络中存在PMTUD的情况下,以及在IPv4网络中DF位为1的情况下,将单个数据包从源发送到目的地所消耗的时间。根据我们的分析,我们得出结论,通信时间的增加与不同的MTU的中间结点。此外,我们制定了数学模型,以确定在网络中的通信延迟。我们的模型表明,所需时间的渐近下限是$Ω(n)$和渐近上限是$Θ(n^2)$,使用PMTUD。我们已经发现,数据包丢弃频率遵循伯努利试验,这有助于定义数据包丢弃频率的成功概率,这表明,概率是更高的数据包丢弃率为开始$2\%$的总节点在路径中。我们进一步发现,$^{n}C_{a}$可能的数量的a-组合,没有重复,可以形成一个特定数量的数据包丢弃频率。每个组合的总和(作为时间浪费方程中的系数)与其频率之间的关系导致对称图以及测量时间浪费及其行为的数学和统计结构。这也有助于测量可能的相对最大、最小和平均时间浪费。我们还测量了相对的最大值,最小值和平均总和的概率为一个给定值的丢包频率和路径中的节点数。

英文摘要:

In this paper we have presented the effects of path mtu discovery in IPv4 & IPv6 in mathematical, logical and graphical representation. We try to give a mathematical model to the working of path mtu discovery and calculated its behaviour using a transmission of a packet. We analysed the time consumed to transmit a single packet from source to destination in IPv6 network in the presence of PMTUD and similarly in IPv4 network with DF bit 1. Based on our analysis, we concluded that the communication time increases with the varying MTU of the intermediate nodes. Moreover, we formulated the mathematical model to determine the communication delay in a network. Our model shows that the asymptotic lower bound for time taken is $Ω(n)$ and the asymptotic upper bound is $Θ(n^2)$, using PMTUD. We have find that the packet drop frequency follows the Bernoulli's trials and which helps to define the success probability of the packet drop frequency, which shows that the probability is higher for packet drop rate for beginning $2\%$ of the total nodes in the path. We further found that $^{n}C_{a}$ possible number of a-combinations without repetitions that can be formed for a particular number of packet drop frequency. The relation between summation (acts as a coefficient in the time wastage equation) of each combination and their frequency resulted in symmetric graph and also mathematical and statistical structures to measure time wastage and its behaviour. This also helps in measuring the possible relative maximum, minimum and average time wastage. We also measured the probability of relative maximum, min and average summation for a given value of packet drop frequency and number of nodes in a path.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑