Maximum weight matching in ATM switching has advantages of high throughput and good performance. But the algorithm is difficult to realize in real time due to its high complexity.
AT M交换中的赋权匹配有吞吐率高、性能好的优点，但是算法复杂度高，难以实时实现。
This paper proposes an algorithm of random maximum weight matching that resolves the problem while keeps a large sum of matching weight so as to preserve advantages of maximum weight matching.
该文提出随机赋权匹配算法以解决实时实现的问题，同时，使匹配的总权值依旧很大，保持了赋权匹配的优点。
The algorithm converts surface matching problem into maximum weight clique searching problem in graph theory, and the optimal point correspondence set is represented by the maximum weight clique.
根据从接收节点得到的反馈信息，提出了一个图模型来刻画基于网络编码的重传问题，并将发送节点的重传策略模型化为图中的最小团划分。
The algorithm converts surface matching problem into maximum weight clique searching problem in graph theory, and the optimal point correspondence set is represented by the maximum weight clique.
根据从接收节点得到的反馈信息，提出了一个图模型来刻画基于网络编码的重传问题，并将发送节点的重传策略模型化为图中的最小团划分。
应用推荐