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.
翻译:针对多跳传输网络中常见的网络资源利用的混乱问题(即不确定性问题),本文通过在一对路径(由两条主路径组成)的发送节点和其对应的接收节点之间构建波动性信息传输机制的提出了“网络波”概念和相应的支持理论。以此来改善网络资源利用的有序性。本文证明了主路径的最大渐近吞吐量取决于其自身固有周期,其本身等于主路径的固有干扰强度。基于所提出的网络波理论,提出了一种基于主路径的固有周期传输信息块的算法,可以最大化主路径的渐近吞吐量。在同等机会遍历的情况下,提出了一种基于最大支持元素集合的路径对协同波动性传输信息块的算法。本文证明了该算法能够最大限度地提高一对路径的联合渐近吞吐量。本研究结果为进一步探索能够改善网络资源有序利用的更一般的方法奠定了思想和理论基础。