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.

翻译：针对多跳传输网络中普遍存在的网络资源利用无序问题（即不确定性问题），本文通过在一对路径（由两条主路径构成）的发送节点与对应接收节点间构建波动性信息传输机制，提出了网络波动理论及其相应支撑理论，旨在提升网络资源利用的有序性。证明了一条主路径的最大渐近吞吐量取决于其固有周期，而该固有周期本身等于主路径的固有干扰强度。基于所提出的网络波动理论，提出了一种基于主路径固有周期的信息块传输算法，该算法能够最大化主路径的渐近吞吐量。在等机会遍历情形下，提出了一种基于最大支撑元素集合的成对路径信息块协同波动传输算法，并证明该算法能够最大化成对路径的渐近联合吞吐量。本文研究成果为探索更通用的网络资源有序利用方法奠定了思想与理论基础。