论文标题
网络波
Theory of Network Wave
论文作者
论文摘要
目的是针对多跳传输网络中通常存在的网络资源利用的疾病问题（即不确定性问题），本文提出了通过构建发送节点及其相应接收节点之间的发送通道的通道的波动性信息传递机制来构建波动性信息的波动性信息，从而提出了两种主要路径的订购，从而提出了波动性信息传输机制，从而提出了波动性信息的传输机制，以及相同的序列。事实证明，主要路径的最大渐近吞吐量取决于其内在周期，这本身就是等于主路径的内在干扰强度。基于提出的网络波理论，提出了基于主要路径的内在周期传输信息块的算法，该算法可以最大程度地提高主要路径的渐近吞吐量。在有机会平等的遍历情况下，提出了基于一对最大支持元素集合中信息块合作波动式传输的算法。事实证明，算法可以最大化一对路径的渐近关节吞吐量。本文的研究结果为进一步探索可以改善网络资源有序利用的更多通用方法奠定了意识形态和理论基础。
Aiming at the disorder problem (i.e. uncertainty problem) of the utilization of network resources commonly existing in multi-hop transmission networks, the paper proposes the idea and the corresponding supporting theory, i.e. theory of network wave, by constructing volatility information transmission mechanism between the sending nodes and their corresponding receiving nodes of a pair of paths (composed of two primary paths), so as to improve the orderliness of the utilization of network resources. It is proved that the maximum asymptotic throughput of a primary path depends on its intrinsic period, which in itself is equal to the intrinsic interference intensity of a primary path. Based on the proposed theory of network wave, an algorithm for the transmission of information blocks based on the intrinsic period of a primary path is proposed, which can maximize the asymptotic throughput of a primary path. In the cases of traversals with equal opportunities, an algorithm for the cooperative volatility transmission of information blocks in a pair of paths based on the set of maximum supporting elements is proposed. It is proved that the algorithm can maximize the asymptotic joint throughput of a pair of paths. The research results of the paper lay an ideological and theoretical foundation for further exploring more general methods that can improve the orderly utilization of network resources.
