论文部分内容阅读
提出了一种异步分散式流控算法,它决定了实际计算机道信网中的理想传输率分配。每个入端节点重复计算着试点的信息率分配,以适当分散其流量。在每一循环中节点与相连的用户保持通信,并通过沿实际线路发送控制信令获得网络的空闲信息。显然,要获得理想特性所需的必要信息,可采用以上思想及有效的算法完成,而不需节点间的同步。
An asynchronous decentralized flow control algorithm is proposed, which determines the ideal transmission rate allocation in the actual computer channel network. Each ingress node repeatedly calculates the pilot’s information rate allocation to properly decentralize its traffic. In each cycle, the node maintains communication with connected users and obtains idle information of the network by sending control signaling along the actual line. Obviously, the necessary information to achieve the desired characteristics can be achieved using the above ideas and efficient algorithms without the need for synchronization between nodes.