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